Submission #653699

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cmath>
 
using namespace std;
typedef unsigned char byte;
typedef long long int LLint;
typedef unsigned long long int uLLint;
 
int jk[4][4]={{0,0,0,0},{0,0,1,-1},{0,-1,0,1},{0,1,-1,0}};

bool cpvrh(vector<int>& v1,vector<int>& v2){
    return v1[0]<v2[0];
}
 
int main(){
    int i,j,k,n,a,b,w,l,d,jg;
    vector<vector<int>> vrh;
    vector<int> vh;
    
    cin>>n;
    for (i=0;i<n;i++){
        cin>>a>>b;
        vrh.push_back({a,b,i});
    }
    
    sort(vrh.begin(),vrh.end(),cpvrh);
    
    vector<vector<int>> vres(n,vector<int>(3));
    
    
    int itb=-1;
    for (i=0;i<n;i++){
        if(i<n-1&&vrh[i][0]==vrh[i+1][0]){
            if (itb==-1) itb=i;
        }else{
            if (0<=itb){
                for (j=itb;j<=i;j++){
                    vres[vrh[j][2]][0]+=itb;
                    vres[vrh[j][2]][1]+=n-i-1;
                    for (k=j+1;k<=i;k++){
                        switch (jk[vrh[j][1]][vrh[k][1]]){
                            case 0:
                                vres[vrh[j][2]][2]+=1;
                                vres[vrh[k][2]][2]+=1;
                                break;
                            case 1:
                                vres[vrh[j][2]][0]+=1;
                                vres[vrh[k][2]][1]+=1;
                                break;
                            case -1:
                                vres[vrh[j][2]][1]+=1;
                                vres[vrh[k][2]][0]+=1;
                                break;
                        }
                    }
                }
                itb=-1;
            }else{
                vres[vrh[i][2]][0]+=i;
                vres[vrh[i][2]][1]+=n-i-1;
            }
        }
    }
    
    for (vector<int>& v:vres)
        cout<<v[0]<<" "<<v[1]<<" "<<v[2]<<endl;
    
    return 0;
}

Submission Info

Judge Result