# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
703275 |
2023-02-26T20:15:42 Z |
finn__ |
Poi (IOI09_poi) |
C++17 |
|
574 ms |
8712 KB |
#include <bits/stdc++.h>
using namespace std;
#define N 2000
bitset<N> solved[N];
unsigned num_solved[N], contestant_num_solved[N], score[N], ranking[N];
bool compare_contestant(unsigned a, unsigned b)
{
if (score[a] == score[b])
{
if (contestant_num_solved[a] == contestant_num_solved[b])
return a < b;
return contestant_num_solved[a] > contestant_num_solved[b];
}
return score[a] > score[b];
}
int main()
{
size_t n, t, p;
cin >> n >> t >> p;
for (size_t i = 0; i < n; i++)
{
for (size_t j = 0; j < t; j++)
{
unsigned x;
cin >> x;
solved[i][j] = x;
contestant_num_solved[i] += x;
num_solved[j] += x;
}
ranking[i] = i;
}
for (size_t i = 0; i < n; i++)
for (size_t j = 0; j < t; j++)
if (solved[i][j])
score[i] += n - num_solved[j];
sort(ranking, ranking + n, compare_contestant);
for (size_t i = 0; i < n; i++)
if (ranking[i] + 1 == p)
cout << score[p - 1] << ' ' << i + 1 << '\n';
}
# |
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 |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
312 KB |
Output is correct |
6 |
Correct |
1 ms |
312 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
316 KB |
Output is correct |
9 |
Correct |
3 ms |
340 KB |
Output is correct |
10 |
Correct |
5 ms |
340 KB |
Output is correct |
11 |
Correct |
17 ms |
576 KB |
Output is correct |
12 |
Correct |
27 ms |
812 KB |
Output is correct |
13 |
Correct |
83 ms |
1568 KB |
Output is correct |
14 |
Correct |
116 ms |
2212 KB |
Output is correct |
15 |
Correct |
212 ms |
3484 KB |
Output is correct |
16 |
Correct |
252 ms |
3804 KB |
Output is correct |
17 |
Correct |
366 ms |
5444 KB |
Output is correct |
18 |
Correct |
359 ms |
6044 KB |
Output is correct |
19 |
Correct |
485 ms |
7900 KB |
Output is correct |
20 |
Correct |
574 ms |
8712 KB |
Output is correct |