oj.uz

답안 #236710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236710 2020-06-03T06:18:55 Z Vimmer Izbori (COCI17_izbori) C++14
80 / 80
 20 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 2005000
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



int kol[20];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m, k;

    cin >> n >> m >> k;

    int a[n][m];

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) {cin >> a[i][j]; a[i][j]--;}

    for (int i = 0; i < n; i++) kol[a[i][0]]++;

    int mx = -1;

    for (int i = 0; i < m; i++)
        if (mx == -1 || kol[mx] < kol[i]) mx = i;

    cout << mx + 1 << endl;

    int mn = 1e9;

    k--;

    for (int msk = 0; msk < (1 << m); msk++)
    {
        if (msk & (1 << k)) continue;

        memset(kol, 0, sizeof(kol));

        for (int i = 0; i < n; i++)
        {
            int j = 0;

            while (j < m && ((1 << a[i][j]) & msk)) j++;

            kol[a[i][j]]++;
        }

        int mx = -1;

        for (int i = 0; i < m; i++)
          if (mx == -1 || kol[mx] < kol[i]) mx = i;

        if (mx == k) mn = min(mn, __builtin_popcount(msk));
    }

    cout << mn << endl;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 8 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 17 ms 384 KB Output is correct
14 Correct 11 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 20 ms 384 KB Output is correct
17 Correct 11 ms 384 KB Output is correct
18 Correct 18 ms 384 KB Output is correct
19 Correct 20 ms 384 KB Output is correct
20 Correct 20 ms 384 KB Output is correct