제출 #237180

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237180		kartel	Izbori (COCI17_izbori)	C++14	44 / 80	17 ms	768 KiB

izbori

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +2005
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int i, j, n, m, k, a[N][N], mp[N], mask, mx, nm, ans;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m >> k;
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= m; j++) cin >> a[i][j];
        mp[a[i][1]]++;
    }

    for (i = 1; i <= m; i++)
        if (mp[i] > mx)
        mx = mp[i], ans = i;

    cout << ans << el;

    ans = m;

    for (mask = 0; mask < (1 << m); mask++)
    {
        for (i = 1; i <= m; i++) mp[i] = 0;
        for (i = 1; i <= n; i++)
        {
            j = 1;
            while (j <= m && (mask & (1 << (j - 1)))) j++;
            if (j <= m) mp[a[i][j]]++;
        }

        mx = 0;
        for (i = 1; i <= m; i++)
            if (mp[i] > mx)
                mx = mp[i], nm = i;

        if (nm == k) ans = min(ans, __builtin_popcount(mask));
    }

    cout << ans;
}

//  x ^ 2 + y ^ 2 = 1
//  x * a_i + y * b_i
//  a_i = -b_i * tan(alpha)
//  a_i / -b_i = tan(alpha)
//  alpha = atan(a_i / (-b_i))

• Subtask 1: 44 / 80