# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
771881 |
2023-07-03T11:10:22 Z |
BlockOG |
Poi (IOI09_poi) |
C++14 |
|
468 ms |
15964 KB |
#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
/*
5 3 2
0 0 1
1 1 0
1 0 0
1 1 0
1 1 0
*/
int solved[2000][2000];
int not_solved[2000];
pair<int, pair<int, int>> score[2000];
int main() {
int n, t, p; cin >> n >> t >> p; p--;
for (int i = 0; i < n; i++) {
score[i].second.second = i;
for (int j = 0; j < t; j++) {
cin >> solved[i][j];
if (solved[i][j]) score[i].second.first--;
else not_solved[j]++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
if (solved[i][j])
score[i].first -= not_solved[j];
}
}
for (int i = 0; i < n; i++) {
if (score[i].second.second == p) {
cout << i + 1 << endl;
break;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
9 |
Incorrect |
3 ms |
724 KB |
Output isn't correct |
10 |
Incorrect |
4 ms |
1140 KB |
Output isn't correct |
11 |
Incorrect |
14 ms |
1868 KB |
Output isn't correct |
12 |
Incorrect |
26 ms |
3076 KB |
Output isn't correct |
13 |
Incorrect |
70 ms |
5336 KB |
Output isn't correct |
14 |
Incorrect |
101 ms |
7540 KB |
Output isn't correct |
15 |
Incorrect |
175 ms |
9620 KB |
Output isn't correct |
16 |
Incorrect |
192 ms |
10520 KB |
Output isn't correct |
17 |
Incorrect |
281 ms |
12048 KB |
Output isn't correct |
18 |
Incorrect |
318 ms |
13508 KB |
Output isn't correct |
19 |
Incorrect |
419 ms |
15916 KB |
Output isn't correct |
20 |
Incorrect |
468 ms |
15964 KB |
Output isn't correct |