| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 44573 | heon | Izbori (COCI17_izbori) | C++11 | 34 ms | 560 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 grid[105][15];
int winner(int mask){
	int winner[20];
	memset(winner,0,sizeof(winner));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(mask & (1 << (grid[i][j]-1))) continue;
			winner[grid[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 main(){
	cin >> n >> m >> k;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> grid[i][j]; 
		}
	}
	int izbaceni = 10000;
	int fullmask = 1 << m;
	for(int i = 0; i < fullmask-1; i++){
		if(winner(i) == k){
			izbaceni = min(izbaceni,__builtin_popcount(i));
		}
	}
	cout << winner(0) << endl << izbaceni;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
