Submission #2132624

---

Source Code Expand

#include<bits/stdc++.h>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0;i < (ll)(n);i++)
#define INF (1e9 + 1)
#define MAXI 4951
#define MAXN 101
int main()
{
    int N,A[MAXI],B[MAXI],C[MAXI],D[MAXI],p[MAXN] = {0},I;
    cin >> N;
    I = N * (N - 1) / 2;
    REP(i,I){
        cin >> A[i] >> B[i] >> C[i] >> D[i];
    }
    REP(i,I){
        if(C[i] > D[i]){
            p[A[i] - 1] += 3;
        }
        else if(C[i] < D[i]){
            p[B[i] - 1] += 3;
        }
        else if(C[i] == D[i]){
            p[A[i] - 1]++;
            p[B[i] - 1]++;
        }
    }
    int co = 0;
    REP(i,N){
        //cout << "Team" << i + 1 << " : " << p[i] << endl;
        REP(j,N){
            if(p[i] < p[j]){
                co++;
            }
        }
        cout << co + 1 << endl;
        co = 0;
    }


    return 0;
}

/*
    REP(i,a){
        REP(j,b){

        }
    }
    */

Submission Info

Judge Result