# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
480172 |
2021-10-15T03:51:32 Z |
gg123_pe |
Poi (IOI09_poi) |
C++17 |
|
685 ms |
23816 KB |
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a; i < b; i++)
int n, t, p, grade[2005], a[2005][2005];
vector <pair<int,pair<int,int>>> v;
int main(){
cin >> n >> t >> p;
f(i,1,n+1) f(j,1,t+1) cin >> a[i][j];
f(i,1,t+1){
f(j,1,n+1) grade[i] += (a[j][i] == 0);
}
f(i,1,n+1){
int score = 0, c = 0;
f(j,1,t+1) score += a[i][j]*grade[j], c += a[i][j];
v.push_back({score, {-c, i}});
}
sort(v.begin(), v.end());
f(i,0,n){
if(v[i].second.second == p){
cout << v[i].first << " " << i+1 << endl;
return 0;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
460 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
588 KB |
Output isn't correct |
9 |
Incorrect |
3 ms |
716 KB |
Output isn't correct |
10 |
Incorrect |
6 ms |
1248 KB |
Output isn't correct |
11 |
Incorrect |
21 ms |
2184 KB |
Output isn't correct |
12 |
Incorrect |
41 ms |
3536 KB |
Output isn't correct |
13 |
Incorrect |
106 ms |
6552 KB |
Output isn't correct |
14 |
Incorrect |
151 ms |
9264 KB |
Output isn't correct |
15 |
Incorrect |
256 ms |
12688 KB |
Output isn't correct |
16 |
Incorrect |
276 ms |
13664 KB |
Output isn't correct |
17 |
Incorrect |
431 ms |
16784 KB |
Output isn't correct |
18 |
Incorrect |
475 ms |
18968 KB |
Output isn't correct |
19 |
Incorrect |
635 ms |
23024 KB |
Output isn't correct |
20 |
Incorrect |
685 ms |
23816 KB |
Output isn't correct |