# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
562935 |
2022-05-15T16:03:39 Z |
Drew_ |
Poi (IOI09_poi) |
C++17 |
|
289 ms |
4908 KB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int MAX = 2069;
int N, M, P;
bool ar[MAX][MAX];
int score[MAX];
int main()
{
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> M >> P;
for (int j = 1; j <= M; ++j)
score[j] = N;
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= M; ++j)
{
cin >> ar[i][j];
score[j] -= ar[i][j];
}
}
vector<array<int, 3>> v;
for (int i = 1; i <= N; ++i)
{
int sum = 0, solved = 0;
for (int j = 1; j <= M; ++j)
if (ar[i][j])
sum += score[j], solved++;
v.pb({sum, solved, -i});
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < N; ++i)
{
if (-v[i][2] == P)
{
cout << v[i][0] << " " << i+1 << '\n';
break;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
468 KB |
Output is correct |
8 |
Correct |
1 ms |
468 KB |
Output is correct |
9 |
Correct |
2 ms |
468 KB |
Output is correct |
10 |
Correct |
3 ms |
704 KB |
Output is correct |
11 |
Correct |
10 ms |
1108 KB |
Output is correct |
12 |
Correct |
19 ms |
1620 KB |
Output is correct |
13 |
Correct |
47 ms |
2252 KB |
Output is correct |
14 |
Correct |
61 ms |
2876 KB |
Output is correct |
15 |
Correct |
134 ms |
3200 KB |
Output is correct |
16 |
Correct |
119 ms |
3396 KB |
Output is correct |
17 |
Correct |
178 ms |
4020 KB |
Output is correct |
18 |
Correct |
182 ms |
4364 KB |
Output is correct |
19 |
Correct |
241 ms |
4908 KB |
Output is correct |
20 |
Correct |
289 ms |
4812 KB |
Output is correct |