#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, T, P;
cin >> N >> T >> P;
vector<vector<int>> solved(N, vector<int>(T));
// Read which tasks were solved by each contestant
for (int i = 0; i < N; ++i) {
for (int j = 0; j < T; ++j) {
cin >> solved[i][j];
}
}
vector<int> scores(N, 0);
// Calculate scores for each contestant
for (int j = 0; j < T; ++j) {
int unsolved = 0; // Number of contestants who didn't solve this task
for (int i = 0; i < N; ++i) {
if (solved[i][j] == 0) {
unsolved++;
}
}
for (int i = 0; i < N; ++i) {
if (solved[i][j] == 1) {
scores[i] += unsolved;
}
}
}
// Find Philip's score
int philip_score = scores[P - 1];
// Find Philip's rank
int philip_rank = 1;
for (int i = 0; i < N; ++i) {
if (scores[i] > philip_score || (scores[i] == philip_score && i < P - 1)) {
philip_rank++;
}
}
cout << philip_score << " " << philip_rank << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
9 |
Correct |
2 ms |
348 KB |
Output is correct |
10 |
Correct |
5 ms |
344 KB |
Output is correct |
11 |
Correct |
18 ms |
1108 KB |
Output is correct |
12 |
Correct |
25 ms |
1112 KB |
Output is correct |
13 |
Incorrect |
71 ms |
2652 KB |
Output isn't correct |
14 |
Correct |
108 ms |
3676 KB |
Output is correct |
15 |
Incorrect |
183 ms |
6232 KB |
Output isn't correct |
16 |
Correct |
200 ms |
6812 KB |
Output is correct |
17 |
Correct |
288 ms |
9820 KB |
Output is correct |
18 |
Correct |
340 ms |
11344 KB |
Output is correct |
19 |
Correct |
442 ms |
14424 KB |
Output is correct |
20 |
Correct |
493 ms |
16156 KB |
Output is correct |