# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087928 | idk__ | Izbori (COCI17_izbori) | C++14 | 420 ms | 348 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 <iostream>
#include <vector>
#include <string>
using namespace std;
#define int long long
int a[101][16+5], n, m , k;
vector<int>temp;
int winner(){
int b[100][16+5]={};
for(int i = 0;i < n; i++){
for(int j = 0;j < m; j++){
b[i][j] = a[i][j];
}
}
for(auto cv : temp){
for(int i = 0;i < n; i++){
for(int j = 0;j < m; j++){
if(b[i][j]==cv)b[i][j]=-5;
}
}
}
int count=-1, num=-1;
int cnt[16]={}, poi[n+5]={};
for(int i = 0;i < n; i++){
while(true){
if(b[i][poi[i]]==-5)poi[i]++;
else break;
if(poi[i]>m)break;
}
int& curr = b[i][poi[i]];
if(poi[i]>=m)continue;
cnt[curr]++;
if(cnt[curr] > count){
num = curr;
count=cnt[curr];
}
else if(cnt[curr] == count and curr < num){
num = curr;
count = cnt[curr];
}
}
return num;
}
pair<int, int>fans = {1000, 1000};
void rec(int i){
if(i==m+1){
pair<int, int>f = {temp.size(), winner()};
if(f.second==k and temp.size() < fans.first)fans = f;
return;
}
rec(i+1);
temp.push_back(i);
rec(i+1);
temp.pop_back();
}
signed main() {
ios_base::sync_with_stdio(false);
cin >> n >> m >> k;
for(int i = 0;i < n; i++){
for(int j = 0;j < m; j++){
cin >> a[i][j];
}
}
int ans = winner();
cout << ans << endl;
rec(1);
cout << fans.first << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |