Submission #720334

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
720334	2023-04-08T03:42:26 Z	Yell0	Poi (IOI09_poi)	C++17	100 / 100	266 ms	12048 KB

poi

#include <bits/stdc++.h>

using namespace std;
int N,T,P,sc[2002],tot[2002],sol[2002],ans[2002];
bool a[2002][2002];

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  cin>>N>>T>>P;
  for(int i=1;i<=N;++i) 
    for(int j=1;j<=T;++j)
      cin>>a[i][j];
  for(int i=1;i<=T;++i)
    for(int j=1;j<=N;++j) sc[i]+=!a[j][i];
  for(int i=1;i<=N;++i)
    for(int j=1;j<=T;++j) {
      tot[i]+=sc[j]*a[i][j];
      sol[i]+=a[i][j];
    }
  iota(ans+1,ans+1+N,1);
  sort(ans+1,ans+1+N,[](int x,int y) {return (tot[x]==tot[y]?(sol[x]==sol[y]?x<y:sol[x]>sol[y]):tot[x]>tot[y]);});
  cout<<tot[P]<<' ';
  for(int i=1;i<=N;++i) if(ans[i]==P) cout<<i<<'\n';
  return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	476 KB	Output is correct
10	Correct	3 ms	724 KB	Output is correct
11	Correct	10 ms	1108 KB	Output is correct
12	Correct	14 ms	1616 KB	Output is correct
13	Correct	39 ms	2828 KB	Output is correct
14	Correct	55 ms	3932 KB	Output is correct
15	Correct	111 ms	5516 KB	Output is correct
16	Correct	118 ms	6128 KB	Output is correct
17	Correct	158 ms	7960 KB	Output is correct
18	Correct	183 ms	8876 KB	Output is correct
19	Correct	264 ms	11240 KB	Output is correct
20	Correct	266 ms	12048 KB	Output is correct