# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
837217 |
2023-08-25T08:16:06 Z |
LinkedArray |
Med (COCI22_med) |
C++17 |
|
2 ms |
340 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500, MAXB = 500, NRB = 5;
string name[MAXN];
int sum[MAXN];
int main() {
int n, i, j, b, pos1, pos2;
cin >> n;
for(i = 0; i < n; i++){
cin >> name[i];
for(j = 0; j < NRB; j++){
cin >> b;
sum[i] += b;
}
}
for(i = 0; i < n; i++){
pos1 = 1;
pos2 = 0;
for(j = 0; j < n; j++){
if( (sum[i] + MAXB < sum[j]) || (sum[i] + MAXB == sum[j] && name[i] > name[j]) ){
pos1++;
}
if( (sum[j] + MAXB > sum[i]) || (sum[j] + MAXB == sum[i] && name[i] > name[j]) ){
pos2++;
}
}
cout << pos1 << ' ' << pos2 << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
320 KB |
Output is correct |
5 |
Correct |
2 ms |
216 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
212 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |