Submission #10219110

---

Source Code Expand

#include<iostream>
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

int main(){
    int N;cin>>N;
    pair<int,int> p[100010];
    vec H(100010);
    for(int i=0;i<N;i++){
        int R;cin>>R;
        p[i]={R,i};
        cin>>H[i];
    }
    sort(p,p+N);
    vec Rate,Gu(100010,0),Ch(100010,0),Pa(100010,0);
    mat Ind(100010);
    int k=-1,r=0,count=0;
    for(int i=0;i<N;i++){
        if(p[i].first>r){
            r=p[i].first;
            Rate.push_back(r);
            k++;
        }
        Ind[k].push_back(p[i].second);
        if(H[p[i].second]==1)Gu[k]++;
        if(H[p[i].second]==2)Ch[k]++;
        if(H[p[i].second]==3)Pa[k]++;
    }
    int R=Rate.size();
    vec Sum(100010);Sum[0]=0;
    for(int i=0;i<R;i++){
        Sum[i+1]=Sum[i]+Ind[i].size();
    }

    vec win(100010,0),lose(100010,0),draw(100010,0);
    for(int i=0;i<R;i++){
        for(int j=0;j<Ind[i].size();j++){
            win[Ind[i][j]]+=Sum[i];
            lose[Ind[i][j]]+=Sum[R]-Sum[i+1];
            if(H[Ind[i][j]]==1){
                win[Ind[i][j]]+=Ch[i];
                draw[Ind[i][j]]+=Gu[i]-1;
                lose[Ind[i][j]]+=Pa[i];
            }
            if(H[Ind[i][j]]==2){
                win[Ind[i][j]]+=Pa[i];
                draw[Ind[i][j]]+=Ch[i]-1;
                lose[Ind[i][j]]+=Gu[i];
            }
            if(H[Ind[i][j]]==3){
                win[Ind[i][j]]+=Gu[i];
                draw[Ind[i][j]]+=Pa[i]-1;
                lose[Ind[i][j]]+=Ch[i];
            }
        }
    }
    for(int i=0;i<N;i++){
        cout<<win[i]<<" "<<lose[i]<<" "<<draw[i]<<endl;
    }
    return 0;
}

Submission Info

Judge Result