oj.uz

Submission #896751

# Submission time Handle Problem Language Result Execution time Memory
896751 2024-01-02T04:35:41 Z box Olympiads (BOI19_olympiads) C++17
100 / 100
 15 ms 968 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
template <class T, class... U> void bug_h(const T& t, const U&... u) { cerr << t; ((cerr << " | " << u), ...); cerr << endl; }
#define bug(...) cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: ", bug_h(__VA_ARGS__)
#else
#define cerr if (0) cerr
#define bug(...)
#endif

#define ar array
#define all(v) std::begin(v), std::end(v)
#define sz(v) int(std::size(v))
typedef long long i64;
typedef vector<int> vi;
typedef pair<int, int> pi;

using vb = vector<bool>;

int N, K, C;

struct event {
    int who, type, score;
    bool operator<(const event e) const {
        return score > e.score;
    }
};

vector<event> ev;

struct node {
    vb ban; vi use;
    int fix, score;
    node(vb ban, int fix) : ban(ban), fix(fix) {
        vb cover(K); int covered = 0;
        exchange(use, {}), score = 0;
        for (int i = 0; i < sz(ev) && covered < K && sz(use) < K; i++) {
            if (ban[ev[i].who] || cover[ev[i].type]) continue;
            score += ev[i].score;
            cover[ev[i].type] = 1, covered++;
            if (find(all(use), ev[i].who) == end(use)) use.push_back(ev[i].who);
        }
        for (int i = 0; i < sz(ev) && sz(use) < K; i++) {
            if (ban[ev[i].who]) continue;
            if (find(all(use), ev[i].who) == end(use)) use.push_back(ev[i].who);
        }
        // for (int x : use) cout << x << ' ';
        // cout << "=> " << score << endl;
    }
    bool operator<(const node v) const {
        return score < v.score;
    }
};

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K >> C;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < K; j++) {
            int v;
            cin >> v;
            ev.push_back({i, j, v});
        }
    }
    sort(all(ev));
    priority_queue<node> pq;
    pq.push(node(vb(N), 0));
    while (sz(pq)) {
        auto v = pq.top(); pq.pop();
        bug(v.score);
        if (--C == 0) {
            cout << v.score << '\n';
            return 0;
        }
        while (v.fix < K) {
            auto ban = v.ban; ban[v.use[v.fix]] = 1;
            node u(ban, v.fix);
            if (sz(u.use) == K) pq.push(u);
            v.fix++;
        }
    }
    cout << "-1\n";

}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 ms 488 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 13 ms 348 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 6 ms 548 KB Output is correct
5 Correct 8 ms 552 KB Output is correct
6 Correct 3 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 6 ms 548 KB Output is correct
13 Correct 8 ms 552 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 14 ms 604 KB Output is correct
16 Correct 15 ms 968 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 5 ms 348 KB Output is correct
19 Correct 8 ms 568 KB Output is correct