Submission #561441

#	Time	Username	Problem	Language	Result	Execution time	Memory
561441		OttoTheDino	Olympiads (BOI19_olympiads)	C++17	44 / 100	33 ms	48036 KiB

olympiads

#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

const int mx = 1e6;

map<vi,bool> mp;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, k, r; cin >> n >> k >> r;

    vi c[k];
    int a[n][k], b[k][mx+1] = {};

    rep (i,0,n-1) {
        rep (j,0,k-1) {
            cin >> a[i][j];
            if (!b[j][a[i][j]]) {
                b[j][a[i][j]] = 1;
                c[j].pb(a[i][j]);
            }
        }
    }

    priority_queue<pair<int,vi>> pq;

    int s = 0;
    vi v;
    rep (i,0,k-1) {
        sort(all(c[i]), greater<int>());
        s += c[i][0];
        v.pb(0);
    }

    pq.push({s, v});

    int x = 0;

    while (!pq.empty()) {
        s = pq.top().fi;
        v = pq.top().se;
        pq.pop();

        int dp[k+1][1<<k] = {};
        dp[0][0] = 1;

        rep (i,0,n-1) {
            int cur = 0, suc = 1;
            rep (j,0,k-1) {
                if (a[i][j]==c[j][v[j]]) cur += (1<<j);
                else if (a[i][j]>c[j][v[j]]) suc = 0; 
            }
            if (suc) rrep (j,k-1,0) rep (mask,0,(1<<k)-1) dp[j+1][mask|cur] += dp[j][mask];
        }

        x += dp[k][(1<<k)-1];

        if (x>=r) {
            cout << s << "\n";
            return 0;
        }

        rep (i,0,k-1) {
            ++v[i];
            if (v[i]<len(c[i]) && !mp[v]) {
                mp[v] = 1;
                pq.push({s + c[i][v[i]] - c[i][v[i]-1], v});
            }
            --v[i];
        }
    }

    assert(0==1);

    return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 31 / 31
• Subtask 3: 0 / 24
• Subtask 4: 0 / 32