Submission #406301

# Submission time Handle Problem Language Result Execution time Memory
406301 2021-05-17T10:40:25 Z Falcon Carnival Tickets (IOI20_tickets) C++17
100 / 100
964 ms 65652 KB
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i{}; i < (n); ++i)

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size(), m = x[0].size();

    long long ans{};
    rep(i, n) rep(j, k)
        ans -= x[i][j];

    vector<int> max_unused(n, m - 1), max_small(n, k - 1);
    priority_queue<pair<int, int>> p;
    rep(i, n)
        p.push({x[i][max_unused[i]] + x[i][max_small[i]], i});
    

    rep(_, n * k / 2) {
        auto [d, i] = p.top(); p.pop();
        ans += d;
        --max_unused[i], --max_small[i];
        if(max_small[i] >= 0)
            p.push({x[i][max_unused[i]] + x[i][max_small[i]], i});
    }

    vector<vector<int>> allocation(n, vector<int>(m, -1));

    vector<int> order(n); iota(order.begin(), order.end(), 0);
    rep(r, k) {
        sort(order.begin(), order.end(), [&](int i, int j) {
                return max_unused[i] < max_unused[j];
            });
        rep(i, n)
            if(i >= n / 2) {
                assert(max_small[order[i]] >= 0);
                allocation[order[i]][max_small[order[i]]] = r;
                max_small[order[i]]--;
            } else {
                assert(max_unused[order[i]] < m - 1);
                allocation[order[i]][max_unused[order[i]] + 1] = r;
                max_unused[order[i]]++;
            }
    }

    allocate_tickets(allocation);

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 27 ms 3172 KB Output is correct
6 Correct 722 ms 65160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 26 ms 2452 KB Output is correct
6 Correct 619 ms 56756 KB Output is correct
7 Correct 645 ms 57128 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 7 ms 812 KB Output is correct
13 Correct 21 ms 2120 KB Output is correct
14 Correct 22 ms 2168 KB Output is correct
15 Correct 643 ms 57668 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 39 ms 3292 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 7 ms 944 KB Output is correct
8 Correct 964 ms 56528 KB Output is correct
9 Correct 787 ms 50872 KB Output is correct
10 Correct 820 ms 50968 KB Output is correct
11 Correct 964 ms 59220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 3 ms 432 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 292 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 3 ms 432 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 292 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 39 ms 3160 KB Output is correct
14 Correct 28 ms 3168 KB Output is correct
15 Correct 29 ms 3232 KB Output is correct
16 Correct 44 ms 3236 KB Output is correct
17 Correct 2 ms 304 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 35 ms 2592 KB Output is correct
21 Correct 29 ms 3068 KB Output is correct
22 Correct 29 ms 2608 KB Output is correct
23 Correct 31 ms 3140 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 27 ms 3172 KB Output is correct
12 Correct 722 ms 65160 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 26 ms 2452 KB Output is correct
18 Correct 619 ms 56756 KB Output is correct
19 Correct 645 ms 57128 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 7 ms 812 KB Output is correct
25 Correct 21 ms 2120 KB Output is correct
26 Correct 22 ms 2168 KB Output is correct
27 Correct 643 ms 57668 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 39 ms 3292 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 7 ms 944 KB Output is correct
35 Correct 964 ms 56528 KB Output is correct
36 Correct 787 ms 50872 KB Output is correct
37 Correct 820 ms 50968 KB Output is correct
38 Correct 964 ms 59220 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 4 ms 460 KB Output is correct
41 Correct 3 ms 432 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 3 ms 432 KB Output is correct
44 Correct 4 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 2 ms 292 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 39 ms 3160 KB Output is correct
52 Correct 28 ms 3168 KB Output is correct
53 Correct 29 ms 3232 KB Output is correct
54 Correct 44 ms 3236 KB Output is correct
55 Correct 2 ms 304 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 35 ms 2592 KB Output is correct
59 Correct 29 ms 3068 KB Output is correct
60 Correct 29 ms 2608 KB Output is correct
61 Correct 31 ms 3140 KB Output is correct
62 Correct 73 ms 8348 KB Output is correct
63 Correct 115 ms 8388 KB Output is correct
64 Correct 92 ms 8520 KB Output is correct
65 Correct 371 ms 32832 KB Output is correct
66 Correct 387 ms 33272 KB Output is correct
67 Correct 7 ms 972 KB Output is correct
68 Correct 8 ms 716 KB Output is correct
69 Correct 642 ms 65652 KB Output is correct
70 Correct 753 ms 52648 KB Output is correct
71 Correct 925 ms 63724 KB Output is correct
72 Correct 720 ms 52308 KB Output is correct
73 Correct 933 ms 54464 KB Output is correct
74 Correct 633 ms 58996 KB Output is correct
75 Correct 863 ms 51052 KB Output is correct