# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
657245 |
2022-11-09T10:09:31 Z |
happypotato |
Poi (IOI09_poi) |
C++17 |
|
596 ms |
15956 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, p;
cin >> n >> t >> p;
int a[n + 1][t];
int score[n + 1], solves[n + 1];
for (int i = 1; i <= n; i++) {
score[i] = 0;
solves[i] = 0;
for (int j = 0; j < t; j++) {
cin >> a[i][j];
solves[i] += a[i][j];
}
}
for (int i = 0; i < t; i++) {
int mark = 0;
for (int j = 1; j <= n; j++) {
mark += (a[j][i] == 0);
}
for (int j = 1; j <= n; j++) {
if (a[j][i]) score[j] += mark;
}
}
int rank = 1;
for (int i = 1; i <= n; i++) {
if (i == p) continue;
if (score[i] > score[p]) rank++;
else if (score[i] == score[p]) {
if (solves[i] > solves[p]) rank++;
else if (solves[i] == solves[p]) {
if (i < p) rank++;
}
}
}
cout << score[p] << ' ' << rank << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 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 |
2 ms |
340 KB |
Output is correct |
10 |
Correct |
5 ms |
340 KB |
Output is correct |
11 |
Correct |
17 ms |
724 KB |
Output is correct |
12 |
Correct |
34 ms |
980 KB |
Output is correct |
13 |
Correct |
99 ms |
2608 KB |
Output is correct |
14 |
Correct |
122 ms |
3616 KB |
Output is correct |
15 |
Correct |
208 ms |
6156 KB |
Output is correct |
16 |
Correct |
269 ms |
6656 KB |
Output is correct |
17 |
Correct |
339 ms |
9688 KB |
Output is correct |
18 |
Correct |
422 ms |
10952 KB |
Output is correct |
19 |
Correct |
522 ms |
14292 KB |
Output is correct |
20 |
Correct |
596 ms |
15956 KB |
Output is correct |