# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800950 | 2023-08-02T02:12:27 Z | tlnk07 | Med (COCI22_med) | C++17 | 2 ms | 320 KB |
#include<bits/stdc++.h> using namespace std; long long n, a[501], x; string s[501]; int main() { cin >> n; for(int i = 1; i <= n; ++i) { cin >> s[i]; for(int j = 1; j <= 5; ++j) { cin >> x; a[i] += x; } } for(int i = 1; i <= n; ++i) { long long cnt1 = 1, cnt2 = 1; for(int j = 1; j <= n; ++j) { if(i != j) { if(a[i] + 500 == a[j] && s[i] > s[j] || a[i] + 500 < a[j]) ++cnt1; if(a[i] == a[j] + 500 && s[i] > s[j] || a[i] < a[j] + 500) ++cnt2; } } cout << cnt1 << " " << cnt2 << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 2 ms | 212 KB | Output is correct |
6 | Correct | 2 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 2 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 320 KB | Output is correct |