oj.uz

Submission #300305

# Submission time Handle Problem Language Result Execution time Memory
300305 2020-09-17T04:57:57 Z ecnerwala Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1149 ms 106504 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 {
		std::pair<int, int> val;
		int i;
		int j0, j1;
	};

	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 < M; j++) {
				vals[j] = {X[i][j], j};
			}
			std::sort(vals.begin(), vals.end(), [&](const auto& a, const auto& b) { return a.first < b.first; });
			for (int j = 0; j < K; j++) {
				tot_val -= vals[j].first;
				answer[i][vals[j].second] = -2;
				cnds.push_back({{vals[j].first + vals[j+(M-K)].first, j}, i, vals[j].second, vals[j+(M-K)].second});
			}
		}
	}
	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());
	for (auto [v, i, j0, j1] : cnds) {
		tot_val += v.first;
		answer[i][j0] ++;
		answer[i][j1] ++;
	}

	std::vector<std::array<std::vector<int>, 2>> ticks(N);
	for (int i = 0; i < N; i++) {
		ticks[i][0].reserve(K);
		ticks[i][1].reserve(K);
		for (int j = 0; j < M; j++) {
			if (answer[i][j] == -2) ticks[i][0].push_back(j);
			else if (answer[i][j] == 0) ticks[i][1].push_back(j);
			else if (answer[i][j] == -1);
			else assert(false);
		}
		assert(int(ticks[i][0].size()) + int(ticks[i][1].size()) == K);
	}

	for (int k = 0; k < K; k++) {
		int c0 = 0;
		int c1 = 0;
		for (int i = 0; i < N; i++) {
			if (ticks[i][0].empty()) {
				c1++;
			} else if (ticks[i][1].empty()) {
				c0++;
			} else {
				// do nothing
			}
		}
		assert(c0 <= N/2 && c1 <= N/2);
		for (int i = 0; i < N; i++) {
			int d;
			if (ticks[i][0].empty()) {
				d = 1;
			} else if (ticks[i][1].empty()) {
				d = 0;
			} else if (c0 < N/2) {
				c0++;
				d = 0;
			} else if (c1 < N/2) {
				c1++;
				d = 1;
			} else assert(false);
			answer[i][ticks[i][d].back()] = k;
			ticks[i][d].pop_back();
		}
	}

	allocate_tickets(answer);
	return tot_val;
}

Subtask #1
11.0 / 11.0

# 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 952 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 33 ms 2424 KB Output is correct
6 Correct 789 ms 51576 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 2 ms 512 KB Output is correct
5 Correct 26 ms 3328 KB Output is correct
6 Correct 680 ms 75504 KB Output is correct
7 Correct 686 ms 85884 KB Output is correct
8 Correct 4 ms 768 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 7 ms 1152 KB Output is correct
13 Correct 22 ms 3328 KB Output is correct
14 Correct 22 ms 3456 KB Output is correct
15 Correct 710 ms 93944 KB Output is correct

Subtask #4
14.0 / 14.0

# 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 4 ms 640 KB Output is correct
5 Correct 38 ms 4640 KB Output is correct
6 Correct 9 ms 1024 KB Output is correct
7 Correct 8 ms 1408 KB Output is correct
8 Correct 1149 ms 106464 KB Output is correct
9 Correct 924 ms 99132 KB Output is correct
10 Correct 936 ms 98756 KB Output is correct
11 Correct 1049 ms 106060 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 640 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 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 628 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 640 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 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 628 KB Output is correct
13 Correct 49 ms 2428 KB Output is correct
14 Correct 32 ms 2560 KB Output is correct
15 Correct 61 ms 3424 KB Output is correct
16 Correct 36 ms 4608 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 28 ms 3712 KB Output is correct
21 Correct 37 ms 3704 KB Output is correct
22 Correct 32 ms 4352 KB Output is correct
23 Correct 37 ms 4352 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 952 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 33 ms 2424 KB Output is correct
12 Correct 789 ms 51576 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 26 ms 3328 KB Output is correct
18 Correct 680 ms 75504 KB Output is correct
19 Correct 686 ms 85884 KB Output is correct
20 Correct 4 ms 768 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 7 ms 1152 KB Output is correct
25 Correct 22 ms 3328 KB Output is correct
26 Correct 22 ms 3456 KB Output is correct
27 Correct 710 ms 93944 KB Output is correct
28 Correct 1 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 640 KB Output is correct
32 Correct 38 ms 4640 KB Output is correct
33 Correct 9 ms 1024 KB Output is correct
34 Correct 8 ms 1408 KB Output is correct
35 Correct 1149 ms 106464 KB Output is correct
36 Correct 924 ms 99132 KB Output is correct
37 Correct 936 ms 98756 KB Output is correct
38 Correct 1049 ms 106060 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 640 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 640 KB Output is correct
48 Correct 4 ms 640 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 4 ms 628 KB Output is correct
51 Correct 49 ms 2428 KB Output is correct
52 Correct 32 ms 2560 KB Output is correct
53 Correct 61 ms 3424 KB Output is correct
54 Correct 36 ms 4608 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 28 ms 3712 KB Output is correct
59 Correct 37 ms 3704 KB Output is correct
60 Correct 32 ms 4352 KB Output is correct
61 Correct 37 ms 4352 KB Output is correct
62 Correct 92 ms 6212 KB Output is correct
63 Correct 126 ms 6236 KB Output is correct
64 Correct 101 ms 12152 KB Output is correct
65 Correct 496 ms 33824 KB Output is correct
66 Correct 465 ms 47516 KB Output is correct
67 Correct 8 ms 1408 KB Output is correct
68 Correct 7 ms 1024 KB Output is correct
69 Correct 870 ms 51672 KB Output is correct
70 Correct 911 ms 75504 KB Output is correct
71 Correct 1070 ms 106504 KB Output is correct
72 Correct 823 ms 100384 KB Output is correct
73 Correct 1000 ms 98580 KB Output is correct
74 Correct 721 ms 76164 KB Output is correct
75 Correct 861 ms 75044 KB Output is correct