# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
235297 |
2020-05-27T15:34:42 Z |
Pbezz |
Poi (IOI09_poi) |
C++14 |
|
840 ms |
11128 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 10000
#define MAXN 100005
typedef pair<ll int,ll int> pii;
int main(){
ll int n,t,p,i,j,k;
cin>>n>>t>>p;
vector<tuple<ll int,ll int, ll int> >ahm(n);
vector<ll int>solved(t);
vector<vector<int>>list(t);
for(i=0;i<n;i++){ get<2>(ahm[i])=i;
for(j=0;j<t;j++){
cin>>k;
if(k==1){
solved[j]++;
list[j].push_back(i);
get<1>(ahm[i])--;
}
}
}
for(j=0;j<t;j++){
k=n-solved[j];
for(auto u:list[j]){
get<0>(ahm[u])-=k;
}
}
sort(ahm.begin(),ahm.end());
for(i=0;i<n;i++){
if(get<2>(ahm[i])!=p-1)continue;
cout<<-get<0>(ahm[i])<<" "<<i+1 <<'\n';
break;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
6 ms |
384 KB |
Output is correct |
8 |
Correct |
6 ms |
384 KB |
Output is correct |
9 |
Correct |
8 ms |
384 KB |
Output is correct |
10 |
Correct |
11 ms |
512 KB |
Output is correct |
11 |
Correct |
30 ms |
888 KB |
Output is correct |
12 |
Correct |
46 ms |
1016 KB |
Output is correct |
13 |
Correct |
127 ms |
2296 KB |
Output is correct |
14 |
Correct |
181 ms |
2896 KB |
Output is correct |
15 |
Correct |
320 ms |
6008 KB |
Output is correct |
16 |
Correct |
348 ms |
5884 KB |
Output is correct |
17 |
Correct |
505 ms |
7544 KB |
Output is correct |
18 |
Correct |
563 ms |
7672 KB |
Output is correct |
19 |
Correct |
776 ms |
9848 KB |
Output is correct |
20 |
Correct |
840 ms |
11128 KB |
Output is correct |