Submission #753721

# Submission time Handle Problem Language Result Execution time Memory
753721 2023-06-05T18:26:31 Z nicksms Carnival Tickets (IOI20_tickets) C++17
100 / 100
649 ms 76216 KB
/**
 *      Author:  Nicholas Winschel
 *      Created: 05.10.2023 02:23:53
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())

long long find_maximum(int k, std::vector<std::vector<int>> d);
void allocate_tickets( std::vector<std::vector<int>> _x);

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>> ans(n, vi(m,-1));
	ll cnt = 0;
	vi p(n);
	priority_queue<pi> h;
	for (int i = 0; i < n; i++) {
		h.emplace(x[i][m-1]+x[i][k-1],i);
		for (int j = 0; j < k; j++) cnt -= x[i][j];
	}
	for (int _ = 0; _ < k*n/2; _++) {
		int i = h.top().s;
		h.pop();
		p[i]++;
		cnt += x[i][m-p[i]] + x[i][k-p[i]];
		if (p[i] < k) h.emplace(x[i][m-p[i]-1] + x[i][k-p[i]-1],i);
	}
	vi l(n),r(n,m-1);
	for (int i = 0; i < k; i++) {
		int up=0,un=0; vi b;
		for (int j = 0; j < n; j++) {
			if (p[j]==0) {
				un += 1;
				ans[j][l[j]++]=i;
			} else if (p[j] == k-i) {
				up += 1;
				p[j] -= 1;
				ans[j][r[j]--]=i;
			} else b.push_back(j);
		}
		while (un++<n/2) {
			int j = b[sz(b)-1]; b.pop_back();
			ans[j][l[j]++]=i;
		}
		while (up++<n/2) {
			int j = b[sz(b)-1]; b.pop_back();
			p[j] -= 1;
			ans[j][r[j]--]=i;
		}
	}
	allocate_tickets(ans);
	return cnt;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 696 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 3148 KB Output is correct
6 Correct 485 ms 73220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 20 ms 2440 KB Output is correct
6 Correct 412 ms 56772 KB Output is correct
7 Correct 425 ms 57164 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 752 KB Output is correct
13 Correct 16 ms 2124 KB Output is correct
14 Correct 16 ms 2156 KB Output is correct
15 Correct 447 ms 57856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 27 ms 3272 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 620 ms 76040 KB Output is correct
9 Correct 617 ms 70984 KB Output is correct
10 Correct 575 ms 71152 KB Output is correct
11 Correct 649 ms 76216 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 3 ms 444 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 3 ms 444 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 21 ms 3244 KB Output is correct
14 Correct 20 ms 3180 KB Output is correct
15 Correct 21 ms 3256 KB Output is correct
16 Correct 25 ms 3292 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 20 ms 2580 KB Output is correct
21 Correct 23 ms 3200 KB Output is correct
22 Correct 20 ms 2616 KB Output is correct
23 Correct 25 ms 3152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 696 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 3148 KB Output is correct
12 Correct 485 ms 73220 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 20 ms 2440 KB Output is correct
18 Correct 412 ms 56772 KB Output is correct
19 Correct 425 ms 57164 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 752 KB Output is correct
25 Correct 16 ms 2124 KB Output is correct
26 Correct 16 ms 2156 KB Output is correct
27 Correct 447 ms 57856 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 27 ms 3272 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 980 KB Output is correct
35 Correct 620 ms 76040 KB Output is correct
36 Correct 617 ms 70984 KB Output is correct
37 Correct 575 ms 71152 KB Output is correct
38 Correct 649 ms 76216 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 3 ms 444 KB Output is correct
41 Correct 2 ms 500 KB Output is correct
42 Correct 2 ms 440 KB Output is correct
43 Correct 2 ms 500 KB Output is correct
44 Correct 2 ms 440 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 496 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 21 ms 3244 KB Output is correct
52 Correct 20 ms 3180 KB Output is correct
53 Correct 21 ms 3256 KB Output is correct
54 Correct 25 ms 3292 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 20 ms 2580 KB Output is correct
59 Correct 23 ms 3200 KB Output is correct
60 Correct 20 ms 2616 KB Output is correct
61 Correct 25 ms 3152 KB Output is correct
62 Correct 56 ms 8396 KB Output is correct
63 Correct 72 ms 8372 KB Output is correct
64 Correct 67 ms 8628 KB Output is correct
65 Correct 256 ms 33116 KB Output is correct
66 Correct 263 ms 33632 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 7 ms 680 KB Output is correct
69 Correct 491 ms 73120 KB Output is correct
70 Correct 535 ms 74180 KB Output is correct
71 Correct 624 ms 76176 KB Output is correct
72 Correct 488 ms 60492 KB Output is correct
73 Correct 587 ms 73444 KB Output is correct
74 Correct 460 ms 59052 KB Output is correct
75 Correct 494 ms 71876 KB Output is correct