Submission #648514

#TimeUsernameProblemLanguageResultExecution timeMemory
648514inksamuraiIzbori (COCI17_izbori)C++17
48 / 80
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define rng(i,c,n) for(int i=c;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3Rz7lEu ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e const int mod=1000000007; signed main(){ _3Rz7lEu; int n,m,id; cin>>n>>m>>id; id-=1; vec(vi) a(n,vi(m)); rep(i,n){ rep(j,m){ cin>>a[i][j]; a[i][j]--; } } int cnt=0; int p0=-1,p1=-1; map<int,int> usd; while(1){ std::map<int,int> mp; rep(i,n){ rep(j,m){ int v=a[i][j]; if(usd.find(v)==usd.end()){ mp[v]+=1; break; } } } int pvt=-1; int ma=0; for(auto p:mp){ if(p.se>ma){ ma=p.se; pvt=p.fi; }else if(p.se==ma){ pvt=min(pvt,p.fi); } } if(cnt==0)p0=pvt+1; if(pvt==id){ p1=cnt; break; }else{ usd[pvt]=1; } cnt+=1; } cout<<p0<<"\n"<<p1<<"\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...