# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
648522 | inksamurai | Izbori (COCI17_izbori) | C++17 | 35 ms | 336 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 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
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 p0=-1,p1=m;
rep(msk,1<<m){
vi cnt(m);
rep(i,n){
rep(j,m){
int v=a[i][j];
if(msk>>v&1) continue;
cnt[v]+=1;
break;
}
}
int ma=-1;
int pvt=-1;
rep(v,m){
if(cnt[v]>ma)ma=cnt[v],pvt=v;
}
if(msk==0)p0=pvt+1;
else if(pvt==id){
p1=min(p1,__builtin_popcount(msk));
}
}
cout<<p0<<"\n";
// cout<<p1<<"\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |