Submission #2133694

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#include <random>
#include <chrono>
#define INF 1000000000
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
using namespace std;
 
int main(){
  int n;
  cin >> n;
  int w[n] = { };
  REP(i, n*(n-1)/2){
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    a--;
    b--;
    if(c > d) w[a] += 3;
    else if(c == d){
      w[a]++;
      w[b]++;
    }
    else w[b] += 3;
  }
  int t[n];
  REP(i, n) t[i] = w[i];
  sort(t, t+n);
  map<int, int> m;
  REP(i, n){
    if(m[t[n-1-i]] == 0) m[t[n-1-i]] = i+1;
  }
  REP(i, n) cout << m[w[i]] << endl;
}

Submission Info

Judge Result