oj.uz

Submission #769409

# Submission time Handle Problem Language Result Execution time Memory
769409 2023-06-29T14:14:18 Z t6twotwo Carnival Tickets (IOI20_tickets) C++17
100 / 100
 537 ms 58352 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll find_maximum(int K, vector<vector<int>> x) {
    int N = x.size();
    int M = x[0].size();
    ll ans = 0;
    vector<int> f(N, K);
    priority_queue<pair<int, int>> pq;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < K; j++) {
            ans -= x[i][j];
        }
        pq.emplace(x[i][K - 1] + x[i][M - 1], i);
    }
    for (int i = 0; i < N * K / 2; i++) {
        auto [v, p] = pq.top();
        pq.pop();
        ans += v;
        if (--f[p]) {
            pq.emplace(x[p][f[p] - 1] + x[p][M - (K - f[p]) - 1], p);
        }
    }
    vector a(N, vector<int>(M, -1));
    int s = 0, t = K - 1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < f[i]; j++) {
            a[i][j] = s++;
            if (s == K) {
                s = 0;
            }
        }
        for (int j = M - (K - f[i]); j < M; j++) {
            a[i][j] = t--;
            if (t == -1) {
                t = K - 1;
            }
        }
    }
    allocate_tickets(a);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory 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 340 KB Output is correct
5 Correct 17 ms 2280 KB Output is correct
6 Correct 404 ms 51416 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory 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 2 ms 436 KB Output is correct
5 Correct 16 ms 2516 KB Output is correct
6 Correct 430 ms 56720 KB Output is correct
7 Correct 397 ms 57080 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 824 KB Output is correct
13 Correct 13 ms 2132 KB Output is correct
14 Correct 14 ms 2100 KB Output is correct
15 Correct 400 ms 57708 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 22 ms 3232 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 6 ms 916 KB Output is correct
8 Correct 528 ms 56120 KB Output is correct
9 Correct 494 ms 52220 KB Output is correct
10 Correct 486 ms 52396 KB Output is correct
11 Correct 537 ms 56144 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 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 468 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 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 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 468 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 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 17 ms 3228 KB Output is correct
14 Correct 17 ms 3228 KB Output is correct
15 Correct 18 ms 3252 KB Output is correct
16 Correct 20 ms 3272 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 340 KB Output is correct
20 Correct 17 ms 2624 KB Output is correct
21 Correct 18 ms 3188 KB Output is correct
22 Correct 18 ms 2616 KB Output is correct
23 Correct 19 ms 3108 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 17 ms 2280 KB Output is correct
12 Correct 404 ms 51416 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 16 ms 2516 KB Output is correct
18 Correct 430 ms 56720 KB Output is correct
19 Correct 397 ms 57080 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 4 ms 824 KB Output is correct
25 Correct 13 ms 2132 KB Output is correct
26 Correct 14 ms 2100 KB Output is correct
27 Correct 400 ms 57708 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 22 ms 3232 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 6 ms 916 KB Output is correct
35 Correct 528 ms 56120 KB Output is correct
36 Correct 494 ms 52220 KB Output is correct
37 Correct 486 ms 52396 KB Output is correct
38 Correct 537 ms 56144 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 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 468 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 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 17 ms 3228 KB Output is correct
52 Correct 17 ms 3228 KB Output is correct
53 Correct 18 ms 3252 KB Output is correct
54 Correct 20 ms 3272 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 340 KB Output is correct
58 Correct 17 ms 2624 KB Output is correct
59 Correct 18 ms 3188 KB Output is correct
60 Correct 18 ms 2616 KB Output is correct
61 Correct 19 ms 3108 KB Output is correct
62 Correct 46 ms 8396 KB Output is correct
63 Correct 46 ms 8368 KB Output is correct
64 Correct 55 ms 8620 KB Output is correct
65 Correct 220 ms 29780 KB Output is correct
66 Correct 224 ms 30252 KB Output is correct
67 Correct 4 ms 980 KB Output is correct
68 Correct 4 ms 776 KB Output is correct
69 Correct 416 ms 53644 KB Output is correct
70 Correct 466 ms 54428 KB Output is correct
71 Correct 513 ms 56268 KB Output is correct
72 Correct 426 ms 58352 KB Output is correct
73 Correct 486 ms 54160 KB Output is correct
74 Correct 392 ms 56780 KB Output is correct
75 Correct 463 ms 52612 KB Output is correct