# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
591805 |
2022-07-08T00:10:44 Z |
ozed |
Poi (IOI09_poi) |
C++14 |
|
551 ms |
15948 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
bool compare(tuple<int,int,int> &t1,tuple<int,int,int> &t2){
if(get<0> (t1) > get<0>(t2)) return true;
else if(get<0> (t1) < get<0>(t2)) return false;
else if(get<1> (t1) >get<1> (t2)) return true;
else if(get<1> (t1) < get<1> (t2)) return false;
else return get<2> (t1) < get<2> (t2);
}
int main(){
int n,t,p;
cin>>n>>t>>p;
vector<vi>v(n);
vi score(t);
vector<tuple<int,int,int>> ranks(n);
for(int i=0;i<n;i++){
v[i]=vi(t);
for(int j=0;j<t;j++){
cin>>v[i][j];
if(v[i][j]==0){score[j]++;}
}
}
for(int i=0;i<n;i++){
get<2>(ranks[i])=i+1;
for(int j=0;j<t;j++){
if(v[i][j]==1){
get<0>(ranks[i])+=score[j];
get<1>(ranks[i])++;
}
}
}
sort(ranks.begin(),ranks.end(),&compare);
for(int i=0;i<n;i++){
if(get<2>(ranks[i]) == p ){
cout<<get<0>(ranks[i]) << " " << i+1;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
3 ms |
340 KB |
Output is correct |
10 |
Correct |
4 ms |
340 KB |
Output is correct |
11 |
Correct |
17 ms |
724 KB |
Output is correct |
12 |
Correct |
33 ms |
996 KB |
Output is correct |
13 |
Correct |
82 ms |
2644 KB |
Output is correct |
14 |
Correct |
121 ms |
3636 KB |
Output is correct |
15 |
Correct |
208 ms |
6092 KB |
Output is correct |
16 |
Correct |
229 ms |
6604 KB |
Output is correct |
17 |
Correct |
337 ms |
9880 KB |
Output is correct |
18 |
Correct |
374 ms |
10908 KB |
Output is correct |
19 |
Correct |
506 ms |
14484 KB |
Output is correct |
20 |
Correct |
551 ms |
15948 KB |
Output is correct |