| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 239443 |
2020-06-15T15:23:21 Z |
Autoratch |
Poi (IOI09_poi) |
C++14 |
|
310 ms |
23928 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 2001;
int n,t,p,lv;
int a[N][N],no[N],sc[N];
vector<pair<int,int> > res;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> t >> p;
for(int i = 1;i <= n;i++) for(int j = 1;j <= t;j++) cin >> a[i][j];
for(int i = 1;i <= n;i++) for(int j = 1;j <= t;j++) if(!a[i][j]) no[j]++;
for(int i = 1;i <= n;i++) for(int j = 1;j <= t;j++) if(a[i][j]) sc[i]+=no[j];
for(int i = 1;i <= n;i++) if(sc[i]>sc[p]) lv++;
cout << sc[p] << ' ' << lv+1 << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 5 |
Correct |
5 ms |
512 KB |
Output is correct |
| 6 |
Correct |
5 ms |
640 KB |
Output is correct |
| 7 |
Incorrect |
5 ms |
640 KB |
Output isn't correct |
| 8 |
Correct |
6 ms |
896 KB |
Output is correct |
| 9 |
Incorrect |
6 ms |
928 KB |
Output isn't correct |
| 10 |
Correct |
7 ms |
1408 KB |
Output is correct |
| 11 |
Correct |
15 ms |
2304 KB |
Output is correct |
| 12 |
Incorrect |
20 ms |
3584 KB |
Output isn't correct |
| 13 |
Incorrect |
49 ms |
6652 KB |
Output isn't correct |
| 14 |
Incorrect |
72 ms |
9336 KB |
Output isn't correct |
| 15 |
Incorrect |
128 ms |
12664 KB |
Output isn't correct |
| 16 |
Correct |
126 ms |
13828 KB |
Output is correct |
| 17 |
Incorrect |
189 ms |
16760 KB |
Output isn't correct |
| 18 |
Correct |
212 ms |
19068 KB |
Output is correct |
| 19 |
Correct |
277 ms |
23236 KB |
Output is correct |
| 20 |
Correct |
310 ms |
23928 KB |
Output is correct |
