Submission #1595207

---

Source Code Expand

#include<iostream>
#include<algorithm>
int team[101];
std::pair<int, int> rank[101];
int N;
int num;
int main() {

	std::cin >> N;
	num = N*(N - 1) / 2;
	std::cout << num << std::endl;
	for (int i = 0; i < num; i++) {
		int a, b, c, d;
		std::cin >> a >> b >> c >> d;
		a--;
		b--;
		c++;
		d++;
		if (c > d) {
			team[a] += 3;
		}
		else if(d > c){
			team[b] += 3;
		}
		else if(c==d){
			team[a]++;
			team[b]++;
		}
	}
	for (int i = 0; i < N; i++) {
		rank[i].first = team[i];
	}
	std::sort(rank, rank + N);
	for (int i = 0; i < N; i++) {
		if (i == 0) {
			rank[i].second = 1;
		}
		else if (rank[i].first == rank[i - 1].first) {
			rank[i].second = rank[i - 1].second;
		}
		else {
			rank[i].second = i + 1;
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (rank[j].first == team[i]) {
				std::cout << rank[j].second << std::endl;
				break;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result