Submission #10262836

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
  int N; cin>>N;
  vector<pii> A(N);
  vi B(N);
  vi W(N),D(N),L(N);
  map<pii,int> M;
  rep(i,0,N){
    cin>>A[i].first>>A[i].second;
    B[i]=A[i].first;
    M[A[i]]++;
  }
  sort(ALL(B));
  B.pb(INF);
  rep(i,0,N){
    L[i]=N-disup(B,A[i].first);
    int K=A[i].second;
    if(K==1){
      W[i]+=M[mp(A[i].first,2)];
      D[i]+=M[mp(A[i].first,1)]-1;
      L[i]+=M[mp(A[i].first,3)];
      W[i]+=N-1-L[i]-D[i]-W[i];
    }
    else if(K==2){
      W[i]+=M[mp(A[i].first,3)];
      D[i]+=M[mp(A[i].first,2)]-1;
      L[i]+=M[mp(A[i].first,1)];
      W[i]+=N-1-L[i]-D[i]-W[i];
    }
    else{
      W[i]+=M[mp(A[i].first,1)];
      D[i]+=M[mp(A[i].first,3)]-1;
      L[i]+=M[mp(A[i].first,2)];
      W[i]+=N-1-L[i]-D[i]-W[i];
    }
  }
  rep(i,0,N) cout<<W[i]<<" "<<L[i]<<" "<<D[i]<<endl;
  }

Submission Info

Judge Result