Submission #770817

# Submission time Handle Problem Language Result Execution time Memory
770817 2023-07-02T03:09:21 Z SanguineChameleon Carnival Tickets (IOI20_tickets) C++17
100 / 100
601 ms 96052 KB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1.5e3 + 20;
vector<int> pos[maxn];
vector<int> neg[maxn];
int cnt[maxn];
int n, m, k;

void trace() {
	vector<vector<int>> res(n, vector<int>(m, -1));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < cnt[i]; j++) {
			pos[i].push_back(m - 1 - j);
		}
		for (int j = 0; j < k - cnt[i]; j++) {
			neg[i].push_back(j);
		}
	}
	for (int i = 0; i < k; i++) {
		int rem = n / 2;
		for (int j = 0; j < n; j++) {
			if (neg[j].empty()) {
				res[j][pos[j].back()] = i;
				pos[j].pop_back();
				rem--;
			}
		}
		for (int j = 0; j < n; j++) {
			if (!neg[j].empty()) {
				if (pos[j].empty() || rem == 0) {
					res[j][neg[j].back()] = i;
					neg[j].pop_back();
				}
				else {
					res[j][pos[j].back()] = i;
					pos[j].pop_back();
					rem--;
				}
			}
		}
	}
	allocate_tickets(res);
}

long long find_maximum(int _k, vector<vector<int>> a) {
	n = a.size();
	m = a[0].size();
	k = _k;
	vector<pair<int, int>> cost;
	long long res = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 1; j <= k; j++) {
			res -= a[i][j - 1];
			cost.emplace_back(a[i][k - j] + a[i][m - j], i);
		}
	}
	sort(cost.begin(), cost.end(), greater<pair<int, int>>());
	for (int i = 0; i < n / 2 * k; i++) {
		res += cost[i].first;
		cnt[cost[i].second]++;
	}
	trace();
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 17 ms 3212 KB Output is correct
6 Correct 422 ms 53660 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 16 ms 3024 KB Output is correct
6 Correct 392 ms 61080 KB Output is correct
7 Correct 396 ms 66944 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 4 ms 988 KB Output is correct
13 Correct 13 ms 2752 KB Output is correct
14 Correct 14 ms 2760 KB Output is correct
15 Correct 416 ms 70332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 22 ms 4360 KB Output is correct
6 Correct 4 ms 1032 KB Output is correct
7 Correct 5 ms 1236 KB Output is correct
8 Correct 588 ms 74616 KB Output is correct
9 Correct 576 ms 70476 KB Output is correct
10 Correct 546 ms 69572 KB Output is correct
11 Correct 582 ms 74540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 516 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 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 340 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 580 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 516 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 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 340 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 580 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 644 KB Output is correct
13 Correct 17 ms 3336 KB Output is correct
14 Correct 22 ms 3332 KB Output is correct
15 Correct 22 ms 3664 KB Output is correct
16 Correct 22 ms 4364 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 648 KB Output is correct
19 Correct 1 ms 516 KB Output is correct
20 Correct 19 ms 3176 KB Output is correct
21 Correct 20 ms 3680 KB Output is correct
22 Correct 20 ms 3500 KB Output is correct
23 Correct 21 ms 4040 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 17 ms 3212 KB Output is correct
12 Correct 422 ms 53660 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 516 KB Output is correct
17 Correct 16 ms 3024 KB Output is correct
18 Correct 392 ms 61080 KB Output is correct
19 Correct 396 ms 66944 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 4 ms 988 KB Output is correct
25 Correct 13 ms 2752 KB Output is correct
26 Correct 14 ms 2760 KB Output is correct
27 Correct 416 ms 70332 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 22 ms 4360 KB Output is correct
33 Correct 4 ms 1032 KB Output is correct
34 Correct 5 ms 1236 KB Output is correct
35 Correct 588 ms 74616 KB Output is correct
36 Correct 576 ms 70476 KB Output is correct
37 Correct 546 ms 69572 KB Output is correct
38 Correct 582 ms 74540 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 516 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 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 340 KB Output is correct
47 Correct 2 ms 648 KB Output is correct
48 Correct 2 ms 580 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 644 KB Output is correct
51 Correct 17 ms 3336 KB Output is correct
52 Correct 22 ms 3332 KB Output is correct
53 Correct 22 ms 3664 KB Output is correct
54 Correct 22 ms 4364 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 648 KB Output is correct
57 Correct 1 ms 516 KB Output is correct
58 Correct 19 ms 3176 KB Output is correct
59 Correct 20 ms 3680 KB Output is correct
60 Correct 20 ms 3500 KB Output is correct
61 Correct 21 ms 4040 KB Output is correct
62 Correct 46 ms 8488 KB Output is correct
63 Correct 46 ms 8556 KB Output is correct
64 Correct 65 ms 11020 KB Output is correct
65 Correct 225 ms 36288 KB Output is correct
66 Correct 249 ms 42352 KB Output is correct
67 Correct 5 ms 1284 KB Output is correct
68 Correct 4 ms 980 KB Output is correct
69 Correct 402 ms 73276 KB Output is correct
70 Correct 483 ms 81236 KB Output is correct
71 Correct 601 ms 96052 KB Output is correct
72 Correct 529 ms 79952 KB Output is correct
73 Correct 559 ms 91924 KB Output is correct
74 Correct 503 ms 67028 KB Output is correct
75 Correct 465 ms 79420 KB Output is correct