Submission #1595281
Source Code Expand
#include<iostream> #include<algorithm> int team[101]; int copy[101]; std::pair<int, int> rank[101]; int N; int num; int main() { std::cin >> N; num = N*(N - 1) / 2; 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++) { copy[i] = team[i]; } std::sort(copy, copy + N); for (int i = 0; i < N; i++) { rank[i].first = copy[N - i - 1]; } 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
Submission Time | |
---|---|
Task | B - サッカー (Soccer) |
User | ikefumy |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1009 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 256 KB |
Judge Result
Set Name | set01 | set02 | set03 | set04 | set05 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 20 / 20 | 20 / 20 | 20 / 20 | 20 / 20 | 20 / 20 | ||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
set01 | data1 |
set02 | data2 |
set03 | data3 |
set04 | data4 |
set05 | data5 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
data1 | AC | 1 ms | 256 KB |
data2 | AC | 5 ms | 256 KB |
data3 | AC | 6 ms | 256 KB |
data4 | AC | 5 ms | 256 KB |
data5 | AC | 6 ms | 256 KB |