Submission #300591

# Submission time Handle Problem Language Result Execution time Memory
300591 2020-09-17T10:02:00 Z ecnerwala Carnival Tickets (IOI20_tickets) C++17
100 / 100
962 ms 62312 KB
#include "tickets.h"
#include <bits/stdc++.h>

long long find_maximum(int K, std::vector<std::vector<int>> X) {
	int N = int(X.size());
	int M = int(X[0].size());

	std::vector<std::vector<int>> answer(N, std::vector<int>(M, -1));
	struct cnd_t {
		int val;
		int i;
	};

	std::vector<cnd_t> cnds; cnds.reserve(N*K);

	int64_t tot_val = 0;
	{
		std::vector<std::pair<int, int>> vals(M);
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < K; j++) {
				tot_val -= X[i][j];
				cnds.push_back({X[i][j] + X[i][j+(M-K)], i});
			}
		}
	}

	auto md = cnds.begin() + N/2*K;
	std::nth_element(cnds.begin(), md, cnds.end(),
			[&](const auto& a, const auto& b) { return a.val > b.val; });
	cnds.erase(md, cnds.end());

	std::vector<int> num_hi(N, 0);
	for (auto [v, i] : cnds) {
		tot_val += v;
		num_hi[i]++;
	}

	for (int k = K-1; k >= 0; k--) {
		int c0 = 0;
		int c1 = 0;
		for (int i = 0; i < N; i++) {
			if (num_hi[i] == k+1) {
				c1++;
			} else if (num_hi[i] == 0) {
				c0++;
			} else {
				// do nothing
			}
		}
		assert(c0 <= N/2 && c1 <= N/2);
		for (int i = 0; i < N; i++) {
			int d;
			if (num_hi[i] == k+1) {
				d = 1;
			} else if (num_hi[i] == 0) {
				d = 0;
			} else if (c0 < N/2) {
				c0++;
				d = 0;
			} else if (c1 < N/2) {
				c1++;
				d = 1;
			} else assert(false);
			if (d) {
				answer[i][M - (num_hi[i]--)] = k;
			} else {
				answer[i][k - num_hi[i]] = k;
			}
		}
	}

	allocate_tickets(answer);
	return tot_val;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 31 ms 2452 KB Output is correct
6 Correct 740 ms 51468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 24 ms 2464 KB Output is correct
6 Correct 639 ms 53496 KB Output is correct
7 Correct 644 ms 56376 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 23 ms 2304 KB Output is correct
14 Correct 25 ms 2304 KB Output is correct
15 Correct 594 ms 58744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 33 ms 2816 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 840 ms 62280 KB Output is correct
9 Correct 754 ms 58184 KB Output is correct
10 Correct 768 ms 58104 KB Output is correct
11 Correct 845 ms 62200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 36 ms 2464 KB Output is correct
14 Correct 43 ms 2400 KB Output is correct
15 Correct 44 ms 2460 KB Output is correct
16 Correct 53 ms 2816 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 33 ms 2560 KB Output is correct
21 Correct 31 ms 2560 KB Output is correct
22 Correct 33 ms 2688 KB Output is correct
23 Correct 59 ms 2680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 31 ms 2452 KB Output is correct
12 Correct 740 ms 51468 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 24 ms 2464 KB Output is correct
18 Correct 639 ms 53496 KB Output is correct
19 Correct 644 ms 56376 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 6 ms 896 KB Output is correct
25 Correct 23 ms 2304 KB Output is correct
26 Correct 25 ms 2304 KB Output is correct
27 Correct 594 ms 58744 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 33 ms 2816 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 8 ms 1024 KB Output is correct
35 Correct 840 ms 62280 KB Output is correct
36 Correct 754 ms 58184 KB Output is correct
37 Correct 768 ms 58104 KB Output is correct
38 Correct 845 ms 62200 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 36 ms 2464 KB Output is correct
52 Correct 43 ms 2400 KB Output is correct
53 Correct 44 ms 2460 KB Output is correct
54 Correct 53 ms 2816 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 33 ms 2560 KB Output is correct
59 Correct 31 ms 2560 KB Output is correct
60 Correct 33 ms 2688 KB Output is correct
61 Correct 59 ms 2680 KB Output is correct
62 Correct 84 ms 6008 KB Output is correct
63 Correct 94 ms 6060 KB Output is correct
64 Correct 123 ms 7192 KB Output is correct
65 Correct 360 ms 23928 KB Output is correct
66 Correct 364 ms 27896 KB Output is correct
67 Correct 9 ms 1024 KB Output is correct
68 Correct 8 ms 768 KB Output is correct
69 Correct 858 ms 51584 KB Output is correct
70 Correct 830 ms 53496 KB Output is correct
71 Correct 962 ms 62312 KB Output is correct
72 Correct 639 ms 59552 KB Output is correct
73 Correct 838 ms 59104 KB Output is correct
74 Correct 619 ms 52600 KB Output is correct
75 Correct 785 ms 52280 KB Output is correct