oj.uz

Submission #957514

# Submission time Handle Problem Language Result Execution time Memory
957514 2024-04-04T00:04:50 Z hirayuu_oj Poi (IOI09_poi) C++17
70 / 100
 192 ms 31844 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<pair<ll,ll>> srt(N);
    rep(i,N){
        srt[i].second=i;
        rep(j,T){
            if(solved[i][j]){
                srt[i].first-=score[j];
            }
        }
    }
    sort(all(srt));
    rep(i,N){
        if(srt[i].second==P-1){
            cout<<-srt[i].first<<" "<<i+1<<"\n";
            return 0;
        }
    }
}

Subtask #1
70.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 600 KB Output isn't correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Incorrect 1 ms 344 KB Output isn't correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 6 ms 1320 KB Output is correct
12 Correct 10 ms 1884 KB Output is correct
13 Incorrect 28 ms 5144 KB Output isn't correct
14 Correct 41 ms 7000 KB Output is correct
15 Incorrect 86 ms 12248 KB Output isn't correct
16 Correct 86 ms 13148 KB Output is correct
17 Correct 116 ms 19304 KB Output is correct
18 Correct 130 ms 21824 KB Output is correct
19 Correct 177 ms 28704 KB Output is correct
20 Correct 192 ms 31844 KB Output is correct