Submission #823648

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
823648	2023-08-12T23:42:53 Z	GusterGoose27	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	589 ms	65388 KB

tickets

#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 1505;
int pos[MAXN];
int n, m, k;
vector<vector<int>> x;
int alloc[2];
int apos[2];

typedef pair<int, int> pii;

int get_val(int i) {
	return x[i][k-pos[i]-1]+x[i][m-pos[i]-1];
}

bool mat[MAXN][MAXN];
int cap[MAXN];
int match[2][MAXN];

// bool flow(int cur, bool side = 0) {
// 	if (side && cap[cur]) {
// 		cap[cur]--;
// 		return 1;
// 	}
// 	if (side == 0) {
// 		for (; match[0][cur] < k; match[0][cur]++) {
// 			if (!mat[cur][match[0][cur]]) continue;
// 			bool b = flow(match[0][cur], 1);
// 			if (b) {
// 				mat[cur][match[0][cur]] ^= 1;
// 				return 1;
// 			}
// 		}
// 		return 0;
// 	}
// 	if (side == 1) {
// 		for (; match[1][cur] < n; match[1][cur]++) {
// 			if (mat[match[1][cur]][cur]) continue;
// 			bool b = flow(match[1][cur], 0);
// 			if (b) {
// 				mat[match[1][cur]][cur] ^= 1;
// 				return 1;
// 			}
// 		}
// 		return 0;
// 	}
// 	assert(false);
// }

ll find_maximum(int K, vector<vector<int>> X) {
	k = K;
	x = X;
	ll ans = 0;
	n = x.size();
	m = x[0].size();
	priority_queue<pii> pq;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			ans -= x[i][j];
		}
		pq.push(pii(get_val(i), i));
	}
	for (int _ = 0; _ < n*k/2; _++) {
		pii tp = pq.top(); pq.pop();
		ans += tp.first;
		pos[tp.second]++;
		if (pos[tp.second] < k) pq.push(pii(get_val(tp.second), tp.second));
	}
	fill(cap, cap+k, n/2);
	// for (int i = 0; i < n; i++) fill(mat[i], mat[i]+k, 1);
	int p = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < pos[i]; j++) {
			mat[i][p++] = 1;
			p %= k;
			// bool b = flow(i);
			// if (!b) exit(0);
			// assert(b);
		}
	}
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row(m, -1);
		int a = 0, b = m-pos[i];
		for (int j = 0; j < k; j++) {
			if (!mat[i][j]) {
				assert(a < k-pos[i]);
				row[a++] = j;
			}
			else {
				assert(b < m);
				row[b++] = j;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return ans;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	724 KB	Output is correct
6	Correct	2 ms	2652 KB	Output is correct

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	16 ms	3156 KB	Output is correct
6	Correct	461 ms	62012 KB	Output is correct

Subtask #3

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	2 ms	592 KB	Output is correct
5	Correct	15 ms	3156 KB	Output is correct
6	Correct	368 ms	63408 KB	Output is correct
7	Correct	405 ms	63748 KB	Output is correct
8	Correct	2 ms	724 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	4 ms	1108 KB	Output is correct
13	Correct	13 ms	3028 KB	Output is correct
14	Correct	13 ms	2516 KB	Output is correct
15	Correct	395 ms	65224 KB	Output is correct

Subtask #4

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	20 ms	3176 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	8 ms	3156 KB	Output is correct
8	Correct	535 ms	65388 KB	Output is correct
9	Correct	468 ms	61064 KB	Output is correct
10	Correct	487 ms	60964 KB	Output is correct
11	Correct	589 ms	65336 KB	Output is correct

Subtask #5

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	2 ms	596 KB	Output is correct
3	Correct	3 ms	596 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	3 ms	596 KB	Output is correct
6	Correct	2 ms	596 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct

Subtask #6

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	2 ms	596 KB	Output is correct
3	Correct	3 ms	596 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	3 ms	596 KB	Output is correct
6	Correct	2 ms	596 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	24 ms	3216 KB	Output is correct
14	Correct	24 ms	3136 KB	Output is correct
15	Correct	18 ms	3136 KB	Output is correct
16	Correct	21 ms	3208 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	2 ms	980 KB	Output is correct
19	Correct	1 ms	852 KB	Output is correct
20	Correct	26 ms	3136 KB	Output is correct
21	Correct	19 ms	3088 KB	Output is correct
22	Correct	21 ms	3140 KB	Output is correct
23	Correct	19 ms	3156 KB	Output is correct

Subtask #7

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	724 KB	Output is correct
6	Correct	2 ms	2652 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	16 ms	3156 KB	Output is correct
12	Correct	461 ms	62012 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	2 ms	592 KB	Output is correct
17	Correct	15 ms	3156 KB	Output is correct
18	Correct	368 ms	63408 KB	Output is correct
19	Correct	405 ms	63748 KB	Output is correct
20	Correct	2 ms	724 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	4 ms	1108 KB	Output is correct
25	Correct	13 ms	3028 KB	Output is correct
26	Correct	13 ms	2516 KB	Output is correct
27	Correct	395 ms	65224 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	2 ms	596 KB	Output is correct
32	Correct	20 ms	3176 KB	Output is correct
33	Correct	3 ms	724 KB	Output is correct
34	Correct	8 ms	3156 KB	Output is correct
35	Correct	535 ms	65388 KB	Output is correct
36	Correct	468 ms	61064 KB	Output is correct
37	Correct	487 ms	60964 KB	Output is correct
38	Correct	589 ms	65336 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	2 ms	596 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	2 ms	596 KB	Output is correct
43	Correct	3 ms	596 KB	Output is correct
44	Correct	2 ms	596 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	468 KB	Output is correct
47	Correct	2 ms	596 KB	Output is correct
48	Correct	2 ms	596 KB	Output is correct
49	Correct	2 ms	596 KB	Output is correct
50	Correct	2 ms	592 KB	Output is correct
51	Correct	24 ms	3216 KB	Output is correct
52	Correct	24 ms	3136 KB	Output is correct
53	Correct	18 ms	3136 KB	Output is correct
54	Correct	21 ms	3208 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	2 ms	980 KB	Output is correct
57	Correct	1 ms	852 KB	Output is correct
58	Correct	26 ms	3136 KB	Output is correct
59	Correct	19 ms	3088 KB	Output is correct
60	Correct	21 ms	3140 KB	Output is correct
61	Correct	19 ms	3156 KB	Output is correct
62	Correct	48 ms	8560 KB	Output is correct
63	Correct	52 ms	8504 KB	Output is correct
64	Correct	65 ms	8664 KB	Output is correct
65	Correct	209 ms	29736 KB	Output is correct
66	Correct	240 ms	30112 KB	Output is correct
67	Correct	5 ms	3272 KB	Output is correct
68	Correct	4 ms	888 KB	Output is correct
69	Correct	449 ms	62480 KB	Output is correct
70	Correct	461 ms	63444 KB	Output is correct
71	Correct	540 ms	65352 KB	Output is correct
72	Correct	428 ms	63716 KB	Output is correct
73	Correct	501 ms	62848 KB	Output is correct
74	Correct	384 ms	62260 KB	Output is correct
75	Correct	438 ms	61512 KB	Output is correct