# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348315 | 2021-01-14T15:10:39 Z | Mefarnis | Poi (IOI09_poi) | C++14 | 439 ms | 23164 KB |
#include <bits/stdc++.h> #define maxn 2001 using namespace std; struct person { int score,cnt,id; }ar[maxn]; int n,m,p; int cnt[maxn]; int x[maxn][maxn]; bool comp(const person& a , const person& b) { if(a.score != b.score) return a.score > b.score; if(a.cnt != b.cnt) return a.cnt > b.cnt; return a.id < b.id; } int main() { scanf("%d%d%d",&n,&m,&p); for( int i = 1 ; i <= n ; i++ ) for( int j = 1 ; j <= m ; j++ ) { scanf("%d",&x[i][j]); cnt[j] += x[i][j]; } for( int i = 1 ; i <= n ; i++ ) { ar[i].id = i; for( int j = 1 ; j <= m ; j++ ) if(x[i][j]) ar[i].cnt++ , ar[i].score += n-cnt[j]; } sort(ar+1,ar+n+1,comp); for( int i = 1 ; i <= n ; i++ ) if(ar[i].id == p) { printf("%d %d\n",ar[i].score,i); break; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
7 | Correct | 1 ms | 620 KB | Output is correct |
8 | Correct | 1 ms | 748 KB | Output is correct |
9 | Correct | 2 ms | 876 KB | Output is correct |
10 | Correct | 4 ms | 1260 KB | Output is correct |
11 | Correct | 14 ms | 2284 KB | Output is correct |
12 | Correct | 23 ms | 3564 KB | Output is correct |
13 | Correct | 68 ms | 6636 KB | Output is correct |
14 | Correct | 97 ms | 9324 KB | Output is correct |
15 | Correct | 166 ms | 12652 KB | Output is correct |
16 | Correct | 183 ms | 13676 KB | Output is correct |
17 | Correct | 265 ms | 16876 KB | Output is correct |
18 | Correct | 303 ms | 19004 KB | Output is correct |
19 | Correct | 398 ms | 23164 KB | Output is correct |
20 | Correct | 439 ms | 22820 KB | Output is correct |