Submission #415273

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
415273	2021-05-31T19:07:12 Z	Antekb	Poi (IOI09_poi)	C++14	70 / 100	735 ms	16064 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+=sco[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

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Incorrect	1 ms	332 KB	Output isn't correct
4	Incorrect	1 ms	332 KB	Output isn't correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Incorrect	2 ms	588 KB	Output isn't correct
8	Incorrect	2 ms	588 KB	Output isn't correct
9	Correct	4 ms	716 KB	Output is correct
10	Correct	7 ms	1224 KB	Output is correct
11	Correct	24 ms	1868 KB	Output is correct
12	Correct	39 ms	2968 KB	Output is correct
13	Incorrect	115 ms	5400 KB	Output isn't correct
14	Correct	158 ms	7616 KB	Output is correct
15	Incorrect	276 ms	9668 KB	Output isn't correct
16	Correct	299 ms	10580 KB	Output is correct
17	Correct	442 ms	12032 KB	Output is correct
18	Correct	502 ms	13652 KB	Output is correct
19	Correct	672 ms	16064 KB	Output is correct
20	Correct	735 ms	16032 KB	Output is correct