Submission #10330400

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;

int main(){
    int N;  cin >> N;
    vector<int> R(N), H(N);
    for(int i=0; i<N; i++){
        cin >> R[i] >> H[i];
        H[i]--;
    }

    int maxR = 100000;
    vector<vector<int>> G(maxR + 1, vector<int>(3));
    for(int i=0; i<N; i++){
        G[R[i]][H[i]]++;
    }
    for(int i=1; i<=maxR; i++) for(int j=0; j<3; j++){
        G[i][j] += G[i-1][j];
    }

    for(int i=0; i<N; i++){
        int even = G[R[i]][H[i]] - G[R[i] - 1][H[i]] - 1;
        int vic = G[R[i]][(H[i]+1)%3] - G[R[i]-1][(H[i]+1)%3];
        for(int j=0; j<3; j++){
            vic += G[R[i]-1][j];
        }
        int lose = N - 1 - even - vic;
        cout << vic << " " << lose << " " << even << endl;
    }
}

Submission Info

Judge Result