$O(n^2)$
#include<cstdio> int s[101], n; int main() { scanf("%d", &n); for (int i = 0, a, b, c, d; i < n*(n - 1) / 2; i++) { scanf("%d%d%d%d", &a, &b, &c, &d); if (c == d) s[a]++, s[b]++; else s[c > d ? a : b] += 3; } for (int i = 1; i <= n; i++) { int r = 1; for (int j = 1; j <= n; j++) r += s[i] < s[j]; printf("%d\n", r); } return 0; }
댓글 없음 :
댓글 쓰기