제출 #251698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251698		Vladikus004	Izbori (COCI17_izbori)	C++14	80 / 80	30 ms	384 KiB

izbori

#include <bits/stdc++.h>
#define inf 2e9
//#define int long long
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 100 + 3;
int n, m, k, a[N][15], cnt[15], mx;

int get_win(int ind, int mask){
    for (int i = 0; i < m; i++){
        if ((1<<a[ind][i]) & mask){
            continue;
        }
        return a[ind][i];
    }
}

int get(int mask){
    fill(cnt, cnt + 15, 0);
    int mx = 0;
    for (int i = 0; i < n; i++){
        int cur = get_win(i, mask);
        cnt[cur]++;
        mx = max(mx, cnt[cur]);
    }
    for (int i = 0; i < m; i++)
        if (mx == cnt[i]) return i;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            cin >> a[i][j];
            a[i][j]--;
        }
        cnt[a[i][0]]++;
        mx = max(mx, cnt[a[i][0]]);
    }
    for (int i = 0; i < m; i++){
        if (cnt[i] == mx){
            cout << i + 1 << "\n";
            break;
        }
    }
    int mn = m;
    for (int mask = 0; mask < (1<<m) - 1; mask++){
        if (get(mask) == k - 1){
            mn = min(mn, __builtin_popcount(mask));
        }
    }
    cout << mn;
}

컴파일 시 표준 에러 (stderr) 메시지

izbori.cpp: In function 'int get_win(int, int)':
izbori.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
izbori.cpp: In function 'int get(int)':
izbori.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 80 / 80