| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 685066 |
2023-01-23T08:36:50 Z |
acceptify |
Poi (IOI09_poi) |
C++17 |
|
568 ms |
15988 KB |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2005;
const int mxt = 2005;
int n, t, p, ac[mxn][mxt], pt[mxt], scr[mxn], cnt[mxn], rk[mxn];
int main() {
cin >> n >> t >> p;
for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) {
cin >> ac[i][j];
cnt[i] += ac[i][j];
pt[j] += 1 - ac[i][j];
}
for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) scr[i] += ac[i][j] * pt[j];
for (int i = 1; i <= n; i++) rk[i] = i;
sort(rk + 1, rk + n + 1, [](int x, int y) -> bool {
if (scr[x] != scr[y]) return scr[x] > scr[y];
if (cnt[x] != cnt[y]) return cnt[x] > cnt[y];
return x < y;
});
cout << scr[p] << " ";
for (int i = 1; i <= n; i++) if (rk[i] == p) cout << i << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
596 KB |
Output is correct |
| 9 |
Correct |
3 ms |
724 KB |
Output is correct |
| 10 |
Correct |
5 ms |
1236 KB |
Output is correct |
| 11 |
Correct |
17 ms |
2004 KB |
Output is correct |
| 12 |
Correct |
32 ms |
3156 KB |
Output is correct |
| 13 |
Correct |
83 ms |
5332 KB |
Output is correct |
| 14 |
Correct |
116 ms |
7580 KB |
Output is correct |
| 15 |
Correct |
227 ms |
9664 KB |
Output is correct |
| 16 |
Correct |
278 ms |
10448 KB |
Output is correct |
| 17 |
Correct |
333 ms |
11980 KB |
Output is correct |
| 18 |
Correct |
401 ms |
13548 KB |
Output is correct |
| 19 |
Correct |
522 ms |
15988 KB |
Output is correct |
| 20 |
Correct |
568 ms |
15928 KB |
Output is correct |
