Submission #367293

# Submission time Handle Problem Language Result Execution time Memory
367293 2021-02-16T19:25:53 Z NachoLibre Carnival Tickets (IOI20_tickets) C++17
100 / 100
945 ms 71148 KB
#include <bits/stdc++.h>
using namespace std;
#define sz(a) ((int)(a).size())
typedef vector<int> vint;
typedef vector<vint> vvint;
#ifndef wambule
#include "tickets.h"
#else
void allocate_tickets(vvint a) {
	int n = a.size();
	int m = a.begin()->size();
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < m; ++j) {
			cout << a[i][j] << " ";
		}
		cout << "\n";
	}
}
#endif

long long find_maximum(int k, vvint x) {
	int n = x.size();
	int m = x.begin()->size();
	vint v(n, 0);
	priority_queue<pair<int, int>> pq;
	long long dr = 0;
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < k; ++j) {
			dr -= x[i][j];
		}
		pq.push({x[i][k - 1] + x[i][m - 1], i});
	}
	for(int i = 0; i < n * k / 2; ++i) {
		int y = pq.top().second;
		dr += pq.top().first;
		pq.pop();
		++v[y];
		if(v[y] < k) {
			pq.push({x[y][k - 1 - v[y]] + x[y][m - 1 - v[y]], y});
		}
	}
	vector<pair<pair<int, int>, int>> u;
	for(int i = 0; i < n; ++i) {
		u.push_back({{k - 1 - v[i], m - v[i]}, i});
	}
	vvint fp(n, vint(m, -1));
	for(int i = 0; i < k; ++i) {
		sort(u.begin(), u.end());
		for(int j = 0; j < n; ++j) {
			int y = 0;
			if(j < n / 2) {
				y = u[j].first.second++;
			} else {
				y = u[j].first.first--;
			}
			fp[u[j].second][y] = i;
		}
	}
	allocate_tickets(fp);
	return dr;
}

#ifdef wambule
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << find_maximum(2, {{0, 2, 5}, {1, 1, 3}}) << endl << endl;
	cout << find_maximum(1, {{5, 9}, {1, 4}, {3, 6}, {2, 7}}) << endl << endl;
	return 0;
}
#endif
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 26 ms 3328 KB Output is correct
6 Correct 632 ms 53320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 26 ms 2668 KB Output is correct
6 Correct 655 ms 57068 KB Output is correct
7 Correct 694 ms 57196 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 23 ms 2284 KB Output is correct
14 Correct 23 ms 2284 KB Output is correct
15 Correct 735 ms 57892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 34 ms 3308 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1132 KB Output is correct
8 Correct 869 ms 59616 KB Output is correct
9 Correct 871 ms 71148 KB Output is correct
10 Correct 942 ms 61420 KB Output is correct
11 Correct 945 ms 59580 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
13 Correct 26 ms 3308 KB Output is correct
14 Correct 28 ms 3308 KB Output is correct
15 Correct 30 ms 3308 KB Output is correct
16 Correct 34 ms 3308 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 28 ms 2668 KB Output is correct
21 Correct 31 ms 3180 KB Output is correct
22 Correct 33 ms 2796 KB Output is correct
23 Correct 33 ms 3308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 26 ms 3328 KB Output is correct
12 Correct 632 ms 53320 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 26 ms 2668 KB Output is correct
18 Correct 655 ms 57068 KB Output is correct
19 Correct 694 ms 57196 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 23 ms 2284 KB Output is correct
26 Correct 23 ms 2284 KB Output is correct
27 Correct 735 ms 57892 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 34 ms 3308 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 7 ms 1132 KB Output is correct
35 Correct 869 ms 59616 KB Output is correct
36 Correct 871 ms 71148 KB Output is correct
37 Correct 942 ms 61420 KB Output is correct
38 Correct 945 ms 59580 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 3 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 492 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 2 ms 492 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 3 ms 492 KB Output is correct
50 Correct 4 ms 492 KB Output is correct
51 Correct 26 ms 3308 KB Output is correct
52 Correct 28 ms 3308 KB Output is correct
53 Correct 30 ms 3308 KB Output is correct
54 Correct 34 ms 3308 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 28 ms 2668 KB Output is correct
59 Correct 31 ms 3180 KB Output is correct
60 Correct 33 ms 2796 KB Output is correct
61 Correct 33 ms 3308 KB Output is correct
62 Correct 73 ms 8428 KB Output is correct
63 Correct 75 ms 8568 KB Output is correct
64 Correct 93 ms 8684 KB Output is correct
65 Correct 340 ms 33360 KB Output is correct
66 Correct 395 ms 33732 KB Output is correct
67 Correct 7 ms 1132 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 652 ms 63280 KB Output is correct
70 Correct 757 ms 57068 KB Output is correct
71 Correct 880 ms 70900 KB Output is correct
72 Correct 803 ms 60736 KB Output is correct
73 Correct 941 ms 59016 KB Output is correct
74 Correct 690 ms 59372 KB Output is correct
75 Correct 786 ms 70828 KB Output is correct