Submission #589398

# Submission time Handle Problem Language Result Execution time Memory
589398 2022-07-04T14:49:23 Z Lucpp Carnival Tickets (IOI20_tickets) C++17
100 / 100
722 ms 104260 KB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = (int)x.size();
	int m = (int)x[0].size();
	ll sum = 0;
	priority_queue<pair<ll, int>> pq;
	vector<int> taken(n, 0);
	vector<vector<pair<int, int>>> y(n, vector<pair<int, int>>(m));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++) y[i][j] = {x[i][j], j};
		sort(x[i].begin(), x[i].end());
		sort(y[i].begin(), y[i].end());
		for(int j = 0; j < k; j++) sum -= x[i][j];
		pq.emplace(x[i][m-1]+x[i][k-1], i);
	}
	for(int i = 0; i < n*k/2; i++){
		auto [v, j] = pq.top(); pq.pop();
		sum += v;
		taken[j]++;
		if(taken[j] < k){
			pq.emplace(x[j][m-1-taken[j]]+x[j][k-1-taken[j]], j);
		}
	}
	vector<vector<int>> ans(n, vector<int>(m, -1));
	vector<stack<int>> b(n), s(n);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < k-taken[i]; j++) s[i].push(y[i][j].second);
		for(int j = m-taken[i]; j < m; j++) b[i].push(y[i][j].second);
	}
	for(int r = 0; r < k; r++) {
		int t = 0;
		for(int i = 0; i < n; i++){
			if(b[i].empty()) ans[i][s[i].top()] = r;
			if(s[i].empty()) ans[i][b[i].top()] = r, t++;
		}
		for(int i = 0; i < n; i++){
			if(b[i].empty()) s[i].pop();
			else if(s[i].empty()) b[i].pop();
			else{
				if(t < n/2){
					ans[i][b[i].top()] = r;
					b[i].pop();
					t++;
				}
				else{
					ans[i][s[i].top()] = r;
					s[i].pop();
				}
			}
		}
	}
	allocate_tickets(ans);
	return sum;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 1 ms 808 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 568 KB Output is correct
5 Correct 22 ms 4308 KB Output is correct
6 Correct 525 ms 73604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 20 ms 3668 KB Output is correct
6 Correct 508 ms 80460 KB Output is correct
7 Correct 538 ms 82124 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1132 KB Output is correct
13 Correct 22 ms 3464 KB Output is correct
14 Correct 17 ms 2900 KB Output is correct
15 Correct 554 ms 84272 KB Output is correct
# 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 3 ms 572 KB Output is correct
5 Correct 26 ms 4328 KB Output is correct
6 Correct 4 ms 948 KB Output is correct
7 Correct 7 ms 3156 KB Output is correct
8 Correct 722 ms 104260 KB Output is correct
9 Correct 660 ms 96376 KB Output is correct
10 Correct 670 ms 96292 KB Output is correct
11 Correct 706 ms 103212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 564 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 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 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 564 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 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 596 KB Output is correct
13 Correct 22 ms 4264 KB Output is correct
14 Correct 23 ms 4252 KB Output is correct
15 Correct 25 ms 4292 KB Output is correct
16 Correct 26 ms 4428 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 23 ms 3668 KB Output is correct
21 Correct 26 ms 4192 KB Output is correct
22 Correct 25 ms 3720 KB Output is correct
23 Correct 25 ms 4196 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 1 ms 808 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 22 ms 4308 KB Output is correct
12 Correct 525 ms 73604 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 2 ms 564 KB Output is correct
17 Correct 20 ms 3668 KB Output is correct
18 Correct 508 ms 80460 KB Output is correct
19 Correct 538 ms 82124 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 0 ms 296 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 1132 KB Output is correct
25 Correct 22 ms 3464 KB Output is correct
26 Correct 17 ms 2900 KB Output is correct
27 Correct 554 ms 84272 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 212 KB Output is correct
31 Correct 3 ms 572 KB Output is correct
32 Correct 26 ms 4328 KB Output is correct
33 Correct 4 ms 948 KB Output is correct
34 Correct 7 ms 3156 KB Output is correct
35 Correct 722 ms 104260 KB Output is correct
36 Correct 660 ms 96376 KB Output is correct
37 Correct 670 ms 96292 KB Output is correct
38 Correct 706 ms 103212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 3 ms 564 KB Output is correct
44 Correct 2 ms 568 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 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 596 KB Output is correct
51 Correct 22 ms 4264 KB Output is correct
52 Correct 23 ms 4252 KB Output is correct
53 Correct 25 ms 4292 KB Output is correct
54 Correct 26 ms 4428 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 980 KB Output is correct
57 Correct 2 ms 852 KB Output is correct
58 Correct 23 ms 3668 KB Output is correct
59 Correct 26 ms 4192 KB Output is correct
60 Correct 25 ms 3720 KB Output is correct
61 Correct 25 ms 4196 KB Output is correct
62 Correct 60 ms 11064 KB Output is correct
63 Correct 58 ms 11020 KB Output is correct
64 Correct 74 ms 11256 KB Output is correct
65 Correct 260 ms 42344 KB Output is correct
66 Correct 312 ms 42792 KB Output is correct
67 Correct 6 ms 3224 KB Output is correct
68 Correct 6 ms 980 KB Output is correct
69 Correct 536 ms 92980 KB Output is correct
70 Correct 598 ms 93880 KB Output is correct
71 Correct 693 ms 104188 KB Output is correct
72 Correct 615 ms 86220 KB Output is correct
73 Correct 680 ms 98852 KB Output is correct
74 Correct 541 ms 78920 KB Output is correct
75 Correct 589 ms 91828 KB Output is correct