# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236722 | VEGAnn | Izbori (COCI17_izbori) | C++14 | 19 ms | 768 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;
const int N = 1010;
const int oo = int(2e9);
bool mrk[N];
int n, m, k, ans = oo, kol[N], per[N][N];
int who(int mask){
fill(kol, kol + m, 0);
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++)
if (!(mask & (1 << j))) {
kol[per[i][j]]++;
break;
}
}
int mx = -1;
for (int i = 0; i < m; i++)
mx = max(mx, kol[i]);
for (int i = 0; i < m; i++)
if (mx == kol[i])
return i;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |