# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
312223 |
2020-10-12T19:04:27 Z |
joseacaz |
Poi (IOI09_poi) |
C++17 |
|
1074 ms |
24056 KB |
#include <iostream>
#include <algorithm>
#define MAXN 2005
#define MAXT 2005
using namespace std;
typedef long long int lld;
int N, T, P, s[MAXN][MAXT], score[MAXT];
pair < int, pair < int, int > > points[MAXN];
int main ()
{
cin >> N >> T >> P;
for ( int i = 0; i < N; i++ )
{
for ( int task = 0; task < T; task++ )
{
cin >> s[i][task];
score[task] += (s[i][task] ^ 1);
}
}
for ( int i = 0; i < N; i++ )
for ( int j = 0; j < T; j++ )
points[i].first -= (s[i][j] ? score[j] : 0 ), points[i].second.first -= s[i][j], points[i].second.second = i;
sort ( points, points + N );
for ( int i = 0; i < N; i++ )
if ( points[i].second.second == P - 1 )
cout << -points[i].first << " " << i + 1 << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
512 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 |
384 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 |
5 ms |
768 KB |
Output is correct |
10 |
Correct |
9 ms |
1280 KB |
Output is correct |
11 |
Correct |
35 ms |
2168 KB |
Output is correct |
12 |
Correct |
55 ms |
3576 KB |
Output is correct |
13 |
Correct |
161 ms |
6648 KB |
Output is correct |
14 |
Correct |
230 ms |
9336 KB |
Output is correct |
15 |
Correct |
405 ms |
12796 KB |
Output is correct |
16 |
Correct |
444 ms |
13688 KB |
Output is correct |
17 |
Correct |
645 ms |
16888 KB |
Output is correct |
18 |
Correct |
724 ms |
19064 KB |
Output is correct |
19 |
Correct |
970 ms |
23160 KB |
Output is correct |
20 |
Correct |
1074 ms |
24056 KB |
Output is correct |