# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087418 | guymmk | Izbori (COCI17_izbori) | C++14 | 3097 ms | 440 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;
int n,m,k;
int kk[25];
int cnt[25];
vector<vector<int>>s;
int f(int i){
if(i==n)return 1e9;
int mx=0,mxi=0;
for(int i=1;i<=m;i++){
if(cnt[i]>mx)mx=cnt[i],mxi=i;
}
if(mxi==k)return 0;
int ret=f(i+1);
int c=0;
cnt[s[i][0]]--;
cnt[k]++;
ret=min(ret,f(i+1)+kk[i]+1);
return ret;
}
int main(){
cin>>n>>m>>k;
s.resize(n);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
int x;
cin>>x;
s[i].push_back(x);if(k==x)kk[i]=j;
}
}int mx=0,mxi=0;
for(int i=0;i<n;i++){
cnt[s[i].front()]++;
}for(int i=1;i<=m;i++){
if(cnt[i]>mx)mx=cnt[i],mxi=i;
}cout<<mxi<<endl;
cout<<f(0)<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |