Submission #1609997

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int n,a,b,c,d,li[101]={},li2[200001]={},p[200001]={};

int main(){
	cin >> n;
	REP(i,0,n*(n-1)/2){
		cin >> a >> b >> c >> d;
		if(c==d) li[a-1]++,li[b-1]++;
		else if(c>d) li[a-1]+=3;
		else li[b-1]+=3;
	}
	REP(i,0,n) li2[li[i]]++;
	c=1;
	RREP(i,200000,0) if(li2[i]) p[i]=c,c+=li2[i];
	REP(i,0,n) cout << p[li[i]] << endl;
	return 0;
}

Submission Info

Judge Result