# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087511 | idk__ | Izbori (COCI17_izbori) | C++14 | 1 ms | 420 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 int long long
signed main() {
int n, m, k;
cin >> n >> m >> k;
int a[n+50][m+50] = {};
for(int i = 0;i < n; i++){
for(int j = 0;j < m ;j++){
cin >> a[i][j];
}
}
int poi[n] = {}, ans = 0;
while(true){
int count=-1, num=-1;
int cnt[16]={};
for(int i = 0;i < 16; i++)cnt[i] = 0;
for(int i = 0;i < n; i++){
while(true){
if(a[i][poi[i]]==-5)poi[i]++;
else break;
}
if(poi[i]==m)continue;
int& curr = a[i][poi[i]];
cnt[curr]++;
if(cnt[curr] > count){
num = curr;
count=cnt[curr];
}
else if(cnt[curr] == count and curr < num){
num = curr;
count = cnt[curr];
}
}
if(ans==0)cout << num << endl;
if(num == k)break;
for(int i = 0;i < n; i++){
for(int j = 0;j < m; j++){
if(a[i][j]==num)a[i][j]=-5;
}
}
ans++;
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |