oj.uz

답안 #1087989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087989 2024-09-13T16:29:22 Z Has2008 Izbori (COCI17_izbori) C++17
50 / 80
 32 ms 360 KB 
#include "bits/stdc++.h"
using namespace std;

#define int long long
#define endl endl

const int mod = 1e9 + 7;
const int maxn = 105;

int n, m, k, arr[maxn][20], ans = INT_MAX;
vector < int > v;

int the_winner()
{
    bool out[20] = { };
    for(auto i : v) out[i] = 1;

    int frq[20] = { }, winner = -1, mx = -1;
    for(int i = 0; i < n; i++)
    {
        int j;
        for(j = 0; j < m; j++) if(!out[arr[i][j]]) break;

        frq[arr[i][j]]++;
        if(frq[arr[i][j]] > mx || arr[i][j] < winner) winner = arr[i][j], mx = frq[arr[i][j]];
    }

    return winner;
}

void rec(int i, int cnt)
{
    if(i == m)
    {
        if(the_winner() == k) ans = min(ans, cnt);
        return;
    }

    v.push_back(i + 1);
    rec(i + 1, cnt + 1);
    v.pop_back();

    rec(i + 1, cnt);
}

void solve()
{

    cin >> n >> m >> k;

    int frq[m + 5] = { };
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            cin >> arr[i][j];
            if(j == 0) frq[arr[i][j]] ++;
        }
    }

    int mx = -1, winner = -1;
    for(int i = 1; i <= m; i++) if(frq[i] > mx) mx = frq[i], winner = i;
    cout << winner << endl;


    rec(0, 0);
    cout << ans << endl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int tt = 1;
    //cin >> tt;

    while(tt--) solve();
}

Subtask #1
50.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 348 KB Partially correct
2 Partially correct 2 ms 348 KB Partially correct
3 Correct 1 ms 348 KB Output is correct
4 Partially correct 6 ms 348 KB Partially correct
5 Partially correct 2 ms 348 KB Partially correct
6 Partially correct 1 ms 348 KB Partially correct
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 2 ms 348 KB Partially correct
9 Partially correct 4 ms 348 KB Partially correct
10 Partially correct 0 ms 348 KB Partially correct
11 Correct 3 ms 360 KB Output is correct
12 Partially correct 14 ms 348 KB Partially correct
13 Correct 26 ms 348 KB Output is correct
14 Partially correct 13 ms 348 KB Partially correct
15 Partially correct 4 ms 348 KB Partially correct
16 Partially correct 28 ms 344 KB Partially correct
17 Partially correct 14 ms 348 KB Partially correct
18 Partially correct 24 ms 348 KB Partially correct
19 Correct 30 ms 348 KB Output is correct
20 Partially correct 32 ms 348 KB Partially correct