Submission #311632

# Submission time Handle Problem Language Result Execution time Memory
311632 2020-10-10T19:58:33 Z tfg Carnival Tickets (IOI20_tickets) C++17
100 / 100
1031 ms 62372 KB
#include "tickets.h"
#include <vector>
#include <utility>
#include <algorithm>
#include <cassert>

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer(n, std::vector<int>(m, -1));
	std::vector<int> h(n, 0), l(n, k);
	long long tot = 0;
	std::vector<std::pair<int, int>> things;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < k; j++) {
			things.emplace_back(x[i][k-j-1] + x[i][m-j-1], i);
			tot -= x[i][j];
		}
	}
	std::sort(things.rbegin(), things.rend());
	for(int i = 0; i < n * k / 2; i++) {
		tot += things[i].first;
		h[things[i].second]++;
		l[things[i].second]--;
	}
	for(int col = 0; col < k; col++) {
		int U = n / 2, L = n / 2;
		std::vector<bool> wtf(n, false);
		for(int i = 0; i < n; i++) {
			if(h[i] == 0) {
				l[i]--;
				answer[i][l[i]] = col;
				wtf[i] = true;
				L--;
			} else if(l[i] == 0) {
				h[i]--;
				answer[i][m-h[i]-1] = col;
				wtf[i] = true;
				U--;
			}
		}
		assert(U >= 0 && L >= 0);
		for(int i = 0; i < n; i++) {
			if(!wtf[i]) {
				if(U) {
					h[i]--;
					answer[i][m-h[i]-1] = col;
					wtf[i] = true;
					U--;
				} else {
					l[i]--;
					answer[i][l[i]] = col;
					wtf[i] = true;
					L--;
				}
			}
		}
		assert(U == 0 && L == 0);
	}
	allocate_tickets(answer);
	return tot;
}
# 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 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 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 31 ms 2432 KB Output is correct
6 Correct 749 ms 51448 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 2 ms 512 KB Output is correct
5 Correct 27 ms 2448 KB Output is correct
6 Correct 627 ms 53576 KB Output is correct
7 Correct 639 ms 56392 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 22 ms 2296 KB Output is correct
14 Correct 21 ms 2428 KB Output is correct
15 Correct 645 ms 58824 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 41 ms 2804 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 1014 ms 62372 KB Output is correct
9 Correct 954 ms 58200 KB Output is correct
10 Correct 937 ms 58272 KB Output is correct
11 Correct 1031 ms 62248 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 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 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 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 31 ms 2424 KB Output is correct
14 Correct 31 ms 2424 KB Output is correct
15 Correct 35 ms 2448 KB Output is correct
16 Correct 39 ms 2796 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 32 ms 2552 KB Output is correct
21 Correct 36 ms 2544 KB Output is correct
22 Correct 34 ms 2668 KB Output is correct
23 Correct 37 ms 2676 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 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 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2432 KB Output is correct
12 Correct 749 ms 51448 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 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 27 ms 2448 KB Output is correct
18 Correct 627 ms 53576 KB Output is correct
19 Correct 639 ms 56392 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 22 ms 2296 KB Output is correct
26 Correct 21 ms 2428 KB Output is correct
27 Correct 645 ms 58824 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 41 ms 2804 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 8 ms 1024 KB Output is correct
35 Correct 1014 ms 62372 KB Output is correct
36 Correct 954 ms 58200 KB Output is correct
37 Correct 937 ms 58272 KB Output is correct
38 Correct 1031 ms 62248 KB Output is correct
39 Correct 0 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 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 31 ms 2424 KB Output is correct
52 Correct 31 ms 2424 KB Output is correct
53 Correct 35 ms 2448 KB Output is correct
54 Correct 39 ms 2796 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 32 ms 2552 KB Output is correct
59 Correct 36 ms 2544 KB Output is correct
60 Correct 34 ms 2668 KB Output is correct
61 Correct 37 ms 2676 KB Output is correct
62 Correct 84 ms 6008 KB Output is correct
63 Correct 85 ms 6136 KB Output is correct
64 Correct 110 ms 7272 KB Output is correct
65 Correct 385 ms 24160 KB Output is correct
66 Correct 444 ms 27860 KB Output is correct
67 Correct 8 ms 1024 KB Output is correct
68 Correct 7 ms 768 KB Output is correct
69 Correct 746 ms 51620 KB Output is correct
70 Correct 883 ms 53576 KB Output is correct
71 Correct 1018 ms 62240 KB Output is correct
72 Correct 853 ms 59544 KB Output is correct
73 Correct 939 ms 59076 KB Output is correct
74 Correct 723 ms 52540 KB Output is correct
75 Correct 853 ms 52292 KB Output is correct