Submission #789167

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
789167	2023-07-21T06:56:05 Z	irmuun	Poi (IOI09_poi)	C++17	100 / 100	191 ms	23788 KB

poi

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

bool compare(tuple<int,int,int>a,tuple<int,int,int>b){
    if(get<0>(a)>get<0>(b)){
        return true;
    }
    if(get<0>(a)<get<0>(b)){
        return false;
    }
    if(get<1>(a)>get<1>(b)){
        return true;
    }
    if(get<1>(a)<get<1>(b)){
        return false;
    }
    return get<2>(a)<get<2>(b);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n,t,p;
    cin>>n>>t>>p;
    int a[n+1][t+1];
    tuple<int,int,int>point[n+1];
    int score[t+1];
    fill(score,score+t+1,0);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=t;j++){
            cin>>a[i][j];
            score[j]+=(1-a[i][j]);
        }
    }
    for(int i=1;i<=n;i++){
        get<2>(point[i])=i;
        for(int j=1;j<=t;j++){
            if(a[i][j]==1){
                get<1>(point[i])++;
                get<0>(point[i])+=score[j];
            }
        }
    }
    sort(point+1,point+n+1,compare);
    for(int i=1;i<=n;i++){
        if(get<2>(point[i])==p){
            cout<<get<0>(point[i])<<' '<<i;
            return 0;
        }
    }
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	6 ms	1028 KB	Output is correct
12	Correct	13 ms	1504 KB	Output is correct
13	Correct	31 ms	3796 KB	Output is correct
14	Correct	42 ms	5308 KB	Output is correct
15	Correct	80 ms	9128 KB	Output is correct
16	Correct	79 ms	9804 KB	Output is correct
17	Correct	117 ms	14396 KB	Output is correct
18	Correct	134 ms	16220 KB	Output is correct
19	Correct	176 ms	21464 KB	Output is correct
20	Correct	191 ms	23788 KB	Output is correct