Submission #936672

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936672	2024-03-02T13:25:54 Z	Malix	Poi (IOI09_poi)	C++14	100 / 100	205 ms	24008 KB

poi

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair

int main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("test_input.txt", "r", stdin);
 //freopen("test_output.txt", "w", stdout);
  int n,t,p;cin>>n>>t>>p;
  vector<vi> arr(n,vi(t));
  REP(i,0,n)REP(j,0,t)cin>>arr[i][j];
  vi m(t,0);
  REP(j,0,t)REP(i,0,n)m[j]+=abs(arr[i][j]-1);
  vector<vi> s(n,vi(3));
  REP(i,0,n){
    s[i][0]=0;
    s[i][1]=0;
    s[i][2]=-i;
  }
  REP(i,0,n)REP(j,0,t)if(arr[i][j]){
    s[i][0]+=m[j];
    s[i][1]++;
  }
  sort(s.begin(),s.end());
  reverse(s.begin(),s.end());
  int ans=0;int ans2=0;
  REP(i,0,n)if(s[i][2]==1-p){
    ans=i+1;
    ans2=s[i][0];
  }
  cout<<ans2<<" "<<ans;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	456 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	344 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	6 ms	1116 KB	Output is correct
12	Correct	10 ms	1628 KB	Output is correct
13	Correct	29 ms	3948 KB	Output is correct
14	Correct	41 ms	5340 KB	Output is correct
15	Correct	92 ms	9276 KB	Output is correct
16	Correct	81 ms	10068 KB	Output is correct
17	Correct	128 ms	14416 KB	Output is correct
18	Correct	136 ms	16524 KB	Output is correct
19	Correct	183 ms	21516 KB	Output is correct
20	Correct	205 ms	24008 KB	Output is correct