# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44571 | heon | Izbori (COCI17_izbori) | C++11 | 2359 ms | 65536 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;
vector <int> vec[105];
int currvecfind(vector <int> &currvec, int a){
for(auto x : currvec){
if(x == a) return 1;
}
return 0;
}
int currentwinner(vector <int> &currvec){
int winner[105];
memset(winner,0,sizeof(winner));
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(!currvecfind(currvec,vec[i][j])){
winner[vec[i][j]]++;
break;
}
}
}
int winval = 0, win;
for(int i = 1; i <= m; i++){
if(winner[i] > winval){
winval = winner[i];
win = i;
}
}
return win;
}
int winner(){
int winner[105];
memset(winner,0,sizeof(winner));
for(int i = 0; i < n; i++){
winner[vec[i][0]]++;
}
int winval = 0, win;
for(int i = 1; i <= m; i++){
if(winner[i] > winval){
winval = winner[i];
win = i;
}
}
return win;
}
int main(){
cin >> n >> m >> k;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
int input;
cin >> input;
vec[i].push_back(input);
}
}
int originalwinner = winner();
int izbaceni = 0;
queue < pair<vector<int>,int> > q;
vector <int> v = {originalwinner};
q.push(make_pair(v,1));
if(originalwinner == k) goto kr;
while(!q.empty()){
auto node = q.front();
q.pop();
auto currvec = node.first;
if(currentwinner(currvec) == k){
izbaceni = node.second;
break;
}
for(int i = 1; i <= m; i++){
if(!currvecfind(currvec,i) && i != k){
vector <int> temp = currvec;
temp.push_back(i);
q.push(make_pair(temp,node.second+1));
}
}
}
kr:;
cout << originalwinner << endl << izbaceni;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |