Submission #236710

#	Time	Username	Problem	Language	Result	Execution time	Memory
236710		Vimmer	Izbori (COCI17_izbori)	C++14	80 / 80	20 ms	384 KiB

izbori

#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 / 80