Submission #415277

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
415277	2021-05-31T19:21:53 Z	Antekb	Poi (IOI09_poi)	C++14	100 / 100	753 ms	16008 KB

poi

#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
const int N=2005;
int tab[N][N];
int sco[N];
int main(){
    int n, m, t;
    cin>>n>>m>>t;
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            cin>>tab[i][j];
            sco[j]+=1-tab[i][j];
        }
    }
    vector<pair<pair<int, int>, int> > V;
    int ans=0;
    for(int i=0; i<n; i++){
        int k=0, l=0;
        for(int j=0; j<m; j++){
            k+=sco[j]*tab[i][j];
            l+=tab[i][j];
        }
        if(i==t-1)ans=k;
        V.push_back({{k, l}, -i});
    }
    sort(V.begin(), V.end());
    //reverse(V.begin(), V.end());
    cout<<ans<<" ";
    for(int i=0; i<n; i++)if(V[i].nd==1-t){
        cout<<n-i;
        break;
    }

}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	2 ms	596 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	6 ms	716 KB	Output is correct
10	Correct	7 ms	1100 KB	Output is correct
11	Correct	31 ms	1852 KB	Output is correct
12	Correct	40 ms	3068 KB	Output is correct
13	Correct	114 ms	5316 KB	Output is correct
14	Correct	175 ms	7560 KB	Output is correct
15	Correct	280 ms	9688 KB	Output is correct
16	Correct	301 ms	10416 KB	Output is correct
17	Correct	440 ms	12076 KB	Output is correct
18	Correct	530 ms	13648 KB	Output is correct
19	Correct	679 ms	15960 KB	Output is correct
20	Correct	753 ms	16008 KB	Output is correct