Submission #2141944

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
using namespace std;
typedef pair<int,int> P;
int main(){
    int nn;
    cin>>nn;
    int n=(nn*(nn-1))/2;
    int k[114]={};
    for(int i=0;i<n;i++){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        if(c==d){
            k[a]+=1;
            k[b]+=1;
        }else if(c<d){
            k[b]+=3;
        }else{
            k[a]+=3;
        }
    }
    
    vector<P> p;
    for(int i=1;i<=nn;i++){
        p.push_back(P(k[i],i));
    }
    sort(p.begin(),p.end(),greater<P>());
    vector<P> v;
    int a;
    for(int i=1;i<=nn;i++){
        if(i>1){
            if(p[i-1].first==p[i-2].first){
                v.push_back(P(p[i-1].second,a));
                continue;
            }
        }
        a=i;
        v.push_back(P(p[i-1].second,i));
    }
    sort(v.begin(),v.end());
    for(int i=1;i<=nn;i++){
        cout<<v[i-1].second<<endl;
    }
    return 0;
}
            
            
        
        

Submission Info

Judge Result