//IOI 2023 I am coming.
#include "bits/stdc++.h"
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define int int64_t
#define pb push_back
int32_t main(){
fast;
int n,t,p;
cin>>n>>t>>p;
vector<vector<int>>a(n,vector<int>(t,0));
vector<int>b(t);
for(int i=0;i<n;++i){
for(int j=0;j<t;++j){
cin>>a[i][j];
b[j]+=a[i][j];
}
}
vector<array<int,3>>scores(n);
for(int i=0;i<n;++i){
for(int j=0;j<t;++j){
if(a[i][j]!=0){
scores[i][0]+=(n-b[j]);
}
scores[i][1]+=a[i][j];
}
scores[i][2]=-i;
}
p--;
sort(scores.rbegin(),scores.rend());
for(int i=0;i<n;++i){
//~ cerr<<scores[i][0]<<" "<<scores[i][1]<<" "<<scores[i][2]<<"\n";
if(scores[i][2]==-p){
cout<<scores[i][0]<<" "<<i+1<<"\n";
break;
}
}
//~ cout<<"\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
2 ms |
468 KB |
Output is correct |
11 |
Correct |
11 ms |
1276 KB |
Output is correct |
12 |
Correct |
16 ms |
1904 KB |
Output is correct |
13 |
Correct |
34 ms |
4948 KB |
Output is correct |
14 |
Correct |
51 ms |
7016 KB |
Output is correct |
15 |
Correct |
80 ms |
12100 KB |
Output is correct |
16 |
Correct |
88 ms |
13092 KB |
Output is correct |
17 |
Correct |
132 ms |
19156 KB |
Output is correct |
18 |
Correct |
155 ms |
21708 KB |
Output is correct |
19 |
Correct |
200 ms |
28500 KB |
Output is correct |
20 |
Correct |
217 ms |
31704 KB |
Output is correct |