oj.uz

Submission #957515

# Submission time Handle Problem Language Result Execution time Memory
957515 2024-04-04T00:07:27 Z hirayuu_oj Poi (IOI09_poi) C++17
100 / 100
 192 ms 31836 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,l,r) for(int i=(l); i<(r); i++)
#define all(x) x.begin(),x.end()
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll N,T,P;
    cin>>N>>T>>P;
    vector<vector<ll>> solved(N,vector<ll>(T));
    vector<ll> score(T);
    rep(i,N){
        rep(j,T){
            cin>>solved[i][j];
            if(!solved[i][j]){
                score[j]++;
            }
        }
    }
    vector<array<ll,3>> srt(N);
    rep(i,N){
        srt[i][2]=i;
        rep(j,T){
            if(solved[i][j]){
                srt[i][0]-=score[j];
                srt[i][1]-=1;
            }
        }
    }
    sort(all(srt));
    rep(i,N){
        if(srt[i][2]==P-1){
            cout<<-srt[i][0]<<" "<<i+1<<"\n";
            return 0;
        }
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 6 ms 1368 KB Output is correct
12 Correct 10 ms 1884 KB Output is correct
13 Correct 34 ms 5128 KB Output is correct
14 Correct 46 ms 7152 KB Output is correct
15 Correct 72 ms 12248 KB Output is correct
16 Correct 79 ms 13236 KB Output is correct
17 Correct 125 ms 19288 KB Output is correct
18 Correct 135 ms 21840 KB Output is correct
19 Correct 175 ms 28504 KB Output is correct
20 Correct 192 ms 31836 KB Output is correct