| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 957515 | hirayuu_oj | Poi (IOI09_poi) | C++17 | 192 ms | 31836 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
        }
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
