# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
275322 |
2020-08-20T05:27:31 Z |
Bill_00 |
Poi (IOI09_poi) |
C++14 |
|
301 ms |
23928 KB |
#include <bits/stdc++.h>
typedef long long ll;
const ll inf=1000000000000000000;
#define fr(i,c,d) for(ll i=c;i<=d;i++)
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pp push
using namespace std;
const int sz=173;
string str(string x,int l,int r){
string h;
for(int i=l;i<=r;i++){
h+=x[i];
}
return h;
}
int a[2001][2001],b[2001]={0};
int main(){
//int color[200001];
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,t,p;
cin >> n >> t >> p;
for(int i=1;i<=n;i++){
for(int j=1;j<=t;j++){
cin >> a[i][j];
if(a[i][j]==0){
b[j]++;
}
}
}
vector<pair<pair<int,int>,int> >standings;
for(int i=1;i<=n;i++){
int ans=0,solved=0;
for(int j=1;j<=t;j++){
if(a[i][j]==1){
ans+=b[j];
solved++;
}
}
standings.pb(mp(mp(ans,solved),-i));
}
sort(standings.begin(),standings.end());
int len=standings.size();
for(int i=len-1;i>=0;i--){
if(standings[i].ss==-p){
cout << standings[i].ff.ff << ' ' << len-i;
break;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
512 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
512 KB |
Output is correct |
6 |
Correct |
1 ms |
544 KB |
Output is correct |
7 |
Correct |
1 ms |
640 KB |
Output is correct |
8 |
Correct |
1 ms |
640 KB |
Output is correct |
9 |
Correct |
2 ms |
768 KB |
Output is correct |
10 |
Correct |
4 ms |
1308 KB |
Output is correct |
11 |
Correct |
10 ms |
2304 KB |
Output is correct |
12 |
Correct |
17 ms |
3584 KB |
Output is correct |
13 |
Correct |
46 ms |
6648 KB |
Output is correct |
14 |
Correct |
66 ms |
9376 KB |
Output is correct |
15 |
Correct |
129 ms |
12664 KB |
Output is correct |
16 |
Correct |
144 ms |
13816 KB |
Output is correct |
17 |
Correct |
194 ms |
16888 KB |
Output is correct |
18 |
Correct |
204 ms |
19012 KB |
Output is correct |
19 |
Correct |
280 ms |
23032 KB |
Output is correct |
20 |
Correct |
301 ms |
23928 KB |
Output is correct |