oj.uz

답안 #604207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
604207 2022-07-24T20:51:14 Z skittles1412 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 708 ms 67512 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using ll = long long;

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

void allocate_tickets(std::vector<std::vector<int>> _x);

ll find_maximum(int k, vector<vector<int>> arr) {
    int n = sz(arr), m = sz(arr[0]);
    long ans = 0;
    for (auto& a : arr) {
        assert(is_sorted(begin(a), end(a)));
        ans -= accumulate(a.begin(), a.begin() + k, long(0));
    }
    int cnt[n] {};
    priority_queue<pair<int, int>> pq;
    auto upd = [&](int i) -> void {
        if (cnt[i] >= k) {
            return;
        }
        pq.emplace(arr[i][k - cnt[i] - 1] + arr[i][m - cnt[i] - 1], i);
    };
    for (int i = 0; i < n; i++) {
        upd(i);
    }
    for (int i = 0; i < n * k / 2; i++) {
        auto [d, j] = pq.top();
        pq.pop();
        ans += d;
        cnt[j]++;
        upd(j);
    }
    vector<vector<int>> qans(n, vector<int>(m, -1));
    vector<int> inds[n][2];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k - cnt[i]; j++) {
            inds[i][0].push_back(j);
        }
        for (int j = 0; j < cnt[i]; j++) {
            inds[i][1].push_back(m - j - 1);
        }
    }
    for (int i = 0; i < k; i++) {
        int cur = 0;
        auto add = [&](int j, int ci) -> void {
            cur += !ci;
            qans[j][inds[j][ci].back()] = i;
            inds[j][ci].pop_back();
        };
        vector<int> v;
        for (int j = 0; j < n; j++) {
            if (!sz(inds[j][0])) {
                add(j, 1);
            } else if (!sz(inds[j][1])) {
                add(j, 0);
            } else {
                v.push_back(j);
            }
        }
        assert(cur <= n / 2);
        for (auto& a : v) {
            if (cur < n / 2) {
                add(a, 0);
            } else {
                add(a, 1);
            }
        }
    }
    allocate_tickets(qans);
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 19 ms 2412 KB Output is correct
6 Correct 468 ms 51440 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 372 KB Output is correct
5 Correct 19 ms 2784 KB Output is correct
6 Correct 467 ms 58856 KB Output is correct
7 Correct 484 ms 62224 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 16 ms 2520 KB Output is correct
14 Correct 16 ms 2516 KB Output is correct
15 Correct 497 ms 63976 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 25 ms 3304 KB Output is correct
6 Correct 4 ms 824 KB Output is correct
7 Correct 5 ms 1208 KB Output is correct
8 Correct 708 ms 66308 KB Output is correct
9 Correct 633 ms 62636 KB Output is correct
10 Correct 634 ms 61984 KB Output is correct
11 Correct 662 ms 66316 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 444 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 3 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 444 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 28 ms 2580 KB Output is correct
14 Correct 21 ms 2728 KB Output is correct
15 Correct 22 ms 3000 KB Output is correct
16 Correct 24 ms 3304 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 25 ms 2868 KB Output is correct
21 Correct 26 ms 2884 KB Output is correct
22 Correct 23 ms 3092 KB Output is correct
23 Correct 24 ms 3172 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 19 ms 2412 KB Output is correct
12 Correct 468 ms 51440 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 372 KB Output is correct
17 Correct 19 ms 2784 KB Output is correct
18 Correct 467 ms 58856 KB Output is correct
19 Correct 484 ms 62224 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 16 ms 2520 KB Output is correct
26 Correct 16 ms 2516 KB Output is correct
27 Correct 497 ms 63976 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 25 ms 3304 KB Output is correct
33 Correct 4 ms 824 KB Output is correct
34 Correct 5 ms 1208 KB Output is correct
35 Correct 708 ms 66308 KB Output is correct
36 Correct 633 ms 62636 KB Output is correct
37 Correct 634 ms 61984 KB Output is correct
38 Correct 662 ms 66316 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 440 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 444 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 496 KB Output is correct
49 Correct 2 ms 460 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 28 ms 2580 KB Output is correct
52 Correct 21 ms 2728 KB Output is correct
53 Correct 22 ms 3000 KB Output is correct
54 Correct 24 ms 3304 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 25 ms 2868 KB Output is correct
59 Correct 26 ms 2884 KB Output is correct
60 Correct 23 ms 3092 KB Output is correct
61 Correct 24 ms 3172 KB Output is correct
62 Correct 54 ms 6476 KB Output is correct
63 Correct 58 ms 6408 KB Output is correct
64 Correct 70 ms 8016 KB Output is correct
65 Correct 256 ms 27044 KB Output is correct
66 Correct 331 ms 29904 KB Output is correct
67 Correct 6 ms 1108 KB Output is correct
68 Correct 6 ms 852 KB Output is correct
69 Correct 482 ms 52568 KB Output is correct
70 Correct 570 ms 59540 KB Output is correct
71 Correct 668 ms 67512 KB Output is correct
72 Correct 575 ms 65032 KB Output is correct
73 Correct 642 ms 64824 KB Output is correct
74 Correct 477 ms 57676 KB Output is correct
75 Correct 579 ms 57800 KB Output is correct