Submission #957515

#TimeUsernameProblemLanguageResultExecution timeMemory
957515hirayuu_ojPoi (IOI09_poi)C++17
100 / 100
192 ms31836 KiB
#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 timeMemoryGrader output
Fetching results...