#include <bits/stdc++.h>
using namespace std;
struct Contestant {
int score, ntasks, id;
};
const int N = 2005;
int status[N][N], task_score[N];
Contestant contestants[N];
bool cmp(Contestant a, Contestant b) {
if (a.score != b.score) return a.score > b.score;
if (a.ntasks != b.ntasks) return a.ntasks > b.ntasks;
return a.id < b.id;
}
int main() {
int n, t, p;
cin >> n >> t >> p;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= t; j++) cin >> status[i][j];
}
for (int j = 1; j <= t; j++) {
for (int i = 1; i <= n; i++) task_score[j] += (status[i][j] == 0);
}
for (int i = 1; i <= n; i++) {
contestants[i].score = 0;
contestants[i].ntasks = 0;
contestants[i].id = i;
for (int j = 1; j <= t; j++) {
if (status[i][j]) {
contestants[i].score += task_score[j];
contestants[i].ntasks++;
}
}
}
sort(contestants + 1, contestants + n + 1, cmp);
for (int i = 1; i <= n; i++) {
if (contestants[i].id == p) {
cout << contestants[i].score << ' ' << i << '\n';
return 0;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
416 KB |
Output is correct |
6 |
Correct |
1 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
640 KB |
Output is correct |
8 |
Correct |
2 ms |
640 KB |
Output is correct |
9 |
Correct |
6 ms |
896 KB |
Output is correct |
10 |
Correct |
9 ms |
1408 KB |
Output is correct |
11 |
Correct |
35 ms |
1920 KB |
Output is correct |
12 |
Correct |
58 ms |
3064 KB |
Output is correct |
13 |
Correct |
170 ms |
5496 KB |
Output is correct |
14 |
Correct |
241 ms |
7644 KB |
Output is correct |
15 |
Correct |
417 ms |
9848 KB |
Output is correct |
16 |
Correct |
455 ms |
10616 KB |
Output is correct |
17 |
Correct |
670 ms |
12152 KB |
Output is correct |
18 |
Correct |
792 ms |
13816 KB |
Output is correct |
19 |
Correct |
1020 ms |
16432 KB |
Output is correct |
20 |
Correct |
1138 ms |
16048 KB |
Output is correct |