Submission #417000

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
417000	2021-06-03T10:06:04 Z	KoD	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	944 ms	67988 KB

tickets

#include <bits/stdc++.h>
#include "tickets.h"

using ll = long long;

template <class T> using Vec = std::vector<T>;

ll find_maximum(int K, Vec<Vec<int>> X) {
	const int N = (int) X.size();
	const int M = (int) X[0].size();
	ll ret = 0;
	std::priority_queue<std::pair<int, int>> heap;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < K; ++j) {
			ret -= X[i][j];
			heap.emplace(X[i][M - j - 1] + X[i][K - j - 1], i);
		}
	}
	Vec<int> up(N);
	for (int i = 0; i < N * K / 2; ++i) {
		const auto [a, k] = heap.top();
		heap.pop();
		ret += a;
		up[k] += 1;
	}
	Vec<Vec<int>> Y(N, Vec<int>(M, -1));
	int s = 0, t = K;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < K - up[i]; ++j) {
			Y[i][j] = s;
			s += 1;
			if (s == K) {
				s = 0;
			}
		}
		for (int j = 0; j < up[i]; ++j) {
			t -= 1;
			Y[i][M - j - 1] = t;
			if (t == 0) {
				t = K;
			}
		}
	}
	allocate_tickets(Y);
	return ret;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	2 ms	716 KB	Output is correct

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	288 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	25 ms	3204 KB	Output is correct
6	Correct	630 ms	53352 KB	Output is correct

Subtask #3

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	2 ms	460 KB	Output is correct
5	Correct	25 ms	2608 KB	Output is correct
6	Correct	604 ms	57916 KB	Output is correct
7	Correct	642 ms	60684 KB	Output is correct
8	Correct	4 ms	588 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	7 ms	852 KB	Output is correct
13	Correct	22 ms	2356 KB	Output is correct
14	Correct	22 ms	2376 KB	Output is correct
15	Correct	661 ms	63004 KB	Output is correct

Subtask #4

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 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	34 ms	3612 KB	Output is correct
6	Correct	6 ms	792 KB	Output is correct
7	Correct	6 ms	1100 KB	Output is correct
8	Correct	944 ms	64276 KB	Output is correct
9	Correct	884 ms	59960 KB	Output is correct
10	Correct	888 ms	59880 KB	Output is correct
11	Correct	943 ms	64200 KB	Output is correct

Subtask #5

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	428 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	296 KB	Output is correct
9	Correct	3 ms	428 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

Subtask #6

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	428 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	296 KB	Output is correct
9	Correct	3 ms	428 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	26 ms	3140 KB	Output is correct
14	Correct	29 ms	3244 KB	Output is correct
15	Correct	30 ms	3252 KB	Output is correct
16	Correct	34 ms	3648 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	3 ms	560 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	28 ms	2832 KB	Output is correct
21	Correct	30 ms	3236 KB	Output is correct
22	Correct	33 ms	3100 KB	Output is correct
23	Correct	32 ms	3428 KB	Output is correct

Subtask #7

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	2 ms	716 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Correct	1 ms	288 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	25 ms	3204 KB	Output is correct
12	Correct	630 ms	53352 KB	Output is correct
13	Correct	0 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	2 ms	460 KB	Output is correct
17	Correct	25 ms	2608 KB	Output is correct
18	Correct	604 ms	57916 KB	Output is correct
19	Correct	642 ms	60684 KB	Output is correct
20	Correct	4 ms	588 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	7 ms	852 KB	Output is correct
25	Correct	22 ms	2356 KB	Output is correct
26	Correct	22 ms	2376 KB	Output is correct
27	Correct	661 ms	63004 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	0 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	34 ms	3612 KB	Output is correct
33	Correct	6 ms	792 KB	Output is correct
34	Correct	6 ms	1100 KB	Output is correct
35	Correct	944 ms	64276 KB	Output is correct
36	Correct	884 ms	59960 KB	Output is correct
37	Correct	888 ms	59880 KB	Output is correct
38	Correct	943 ms	64200 KB	Output is correct
39	Correct	0 ms	204 KB	Output is correct
40	Correct	2 ms	332 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	488 KB	Output is correct
43	Correct	3 ms	488 KB	Output is correct
44	Correct	3 ms	428 KB	Output is correct
45	Correct	1 ms	300 KB	Output is correct
46	Correct	1 ms	296 KB	Output is correct
47	Correct	3 ms	428 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	26 ms	3140 KB	Output is correct
52	Correct	29 ms	3244 KB	Output is correct
53	Correct	30 ms	3252 KB	Output is correct
54	Correct	34 ms	3648 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	3 ms	560 KB	Output is correct
57	Correct	2 ms	332 KB	Output is correct
58	Correct	28 ms	2832 KB	Output is correct
59	Correct	30 ms	3236 KB	Output is correct
60	Correct	33 ms	3100 KB	Output is correct
61	Correct	32 ms	3428 KB	Output is correct
62	Correct	69 ms	8392 KB	Output is correct
63	Correct	70 ms	8392 KB	Output is correct
64	Correct	98 ms	9632 KB	Output is correct
65	Correct	330 ms	33580 KB	Output is correct
66	Correct	391 ms	37452 KB	Output is correct
67	Correct	7 ms	1100 KB	Output is correct
68	Correct	6 ms	844 KB	Output is correct
69	Correct	625 ms	53548 KB	Output is correct
70	Correct	789 ms	55392 KB	Output is correct
71	Correct	934 ms	64228 KB	Output is correct
72	Correct	822 ms	67988 KB	Output is correct
73	Correct	881 ms	60956 KB	Output is correct
74	Correct	685 ms	60780 KB	Output is correct
75	Correct	777 ms	54028 KB	Output is correct