Submission #434606

# Submission time Handle Problem Language Result Execution time Memory
434606 2021-06-21T13:00:24 Z frodakcin Carnival Tickets (IOI20_tickets) C++17
100 / 100
742 ms 83988 KB
#include "tickets.h"
#include <cassert>
#include <vector>
#include <numeric>
#include <algorithm>
#include <functional>

using ll = long long;

struct delta
{
	public:
		int i, v;
		bool operator > (const delta& o) const {return v > o.v;}
};

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));
	ll ans=0;
	for(int i=0;i<N;++i)
		for(int j=0;j<K;++j)
			ans -= x[i][j];

	std::vector<int> u(N, 0);
	std::vector<delta> gains;
	for(int i=0;i<N;++i)
		for(int j=0;j<K;++j)
			gains.push_back({i, x[i][M-j-1]+x[i][K-j-1]});
	std::nth_element(gains.begin(), gains.begin()+(N*K/2), gains.end(), std::greater<delta>());

	for(int i=0;i<N*K/2;++i)
		++u[gains[i].i], ans += gains[i].v; // u = how many R we use

	std::vector<int> L(N, 0), R(N, M), ord(N);
	std::iota(ord.begin(), ord.end(), 0);
	for(int i=0;i<K;++i)
	{
		std::nth_element(ord.begin(), ord.begin()+N/2, ord.end(), [&](int x, int y){return u[x]<u[y];});
		for(int j=0;j<N/2;++j)
			answer[ord[j]][L[ord[j]]++]=i;
		for(int j=N/2;j<N;++j)
			answer[ord[j]][--R[ord[j]]]=i, --u[ord[j]];
	}

	for(int i=0;i<N;++i)
		assert(u[i] == 0);
	ll ans2=0;
	for(int i=0;i<N;++i)
	{
		for(int j=0;j<L[i];++j)
			ans2 -= x[i][j];
		for(int j=R[i];j<M;++j)
			ans2 += x[i][j];
	}
	assert(ans == ans2);

	allocate_tickets(answer);
	return ans;
}
# 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 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
# 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 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 24 ms 2320 KB Output is correct
6 Correct 611 ms 51368 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 2 ms 460 KB Output is correct
5 Correct 24 ms 2628 KB Output is correct
6 Correct 599 ms 57708 KB Output is correct
7 Correct 572 ms 60640 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 6 ms 852 KB Output is correct
13 Correct 21 ms 2348 KB Output is correct
14 Correct 21 ms 2328 KB Output is correct
15 Correct 609 ms 63024 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 4 ms 476 KB Output is correct
5 Correct 35 ms 3664 KB Output is correct
6 Correct 5 ms 836 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 739 ms 83948 KB Output is correct
9 Correct 686 ms 78448 KB Output is correct
10 Correct 679 ms 78444 KB Output is correct
11 Correct 723 ms 83988 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 408 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 4 ms 456 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 420 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 408 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 4 ms 456 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 420 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 25 ms 3192 KB Output is correct
14 Correct 25 ms 3176 KB Output is correct
15 Correct 28 ms 3268 KB Output is correct
16 Correct 31 ms 3636 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 24 ms 2768 KB Output is correct
21 Correct 26 ms 3324 KB Output is correct
22 Correct 25 ms 2980 KB Output is correct
23 Correct 29 ms 3476 KB Output is correct
# 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 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 24 ms 2320 KB Output is correct
12 Correct 611 ms 51368 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 2 ms 460 KB Output is correct
17 Correct 24 ms 2628 KB Output is correct
18 Correct 599 ms 57708 KB Output is correct
19 Correct 572 ms 60640 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 6 ms 852 KB Output is correct
25 Correct 21 ms 2348 KB Output is correct
26 Correct 21 ms 2328 KB Output is correct
27 Correct 609 ms 63024 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 4 ms 476 KB Output is correct
32 Correct 35 ms 3664 KB Output is correct
33 Correct 5 ms 836 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 739 ms 83948 KB Output is correct
36 Correct 686 ms 78448 KB Output is correct
37 Correct 679 ms 78444 KB Output is correct
38 Correct 723 ms 83988 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 3 ms 408 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 4 ms 456 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 2 ms 420 KB Output is correct
48 Correct 2 ms 460 KB Output is correct
49 Correct 2 ms 460 KB Output is correct
50 Correct 2 ms 460 KB Output is correct
51 Correct 25 ms 3192 KB Output is correct
52 Correct 25 ms 3176 KB Output is correct
53 Correct 28 ms 3268 KB Output is correct
54 Correct 31 ms 3636 KB Output is correct
55 Correct 1 ms 292 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 24 ms 2768 KB Output is correct
59 Correct 26 ms 3324 KB Output is correct
60 Correct 25 ms 2980 KB Output is correct
61 Correct 29 ms 3476 KB Output is correct
62 Correct 69 ms 8324 KB Output is correct
63 Correct 68 ms 8456 KB Output is correct
64 Correct 97 ms 9656 KB Output is correct
65 Correct 299 ms 33576 KB Output is correct
66 Correct 330 ms 37540 KB Output is correct
67 Correct 6 ms 1100 KB Output is correct
68 Correct 8 ms 844 KB Output is correct
69 Correct 631 ms 73180 KB Output is correct
70 Correct 711 ms 75076 KB Output is correct
71 Correct 742 ms 83872 KB Output is correct
72 Correct 630 ms 67872 KB Output is correct
73 Correct 695 ms 80224 KB Output is correct
74 Correct 575 ms 60900 KB Output is correct
75 Correct 688 ms 73356 KB Output is correct