oj.uz

Submission #365181

# Submission time Handle Problem Language Result Execution time Memory
365181 2021-02-11T06:55:23 Z dolphingarlic Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1034 ms 94952 KB 
#include "tickets.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> le(n), gr(n);
	vector<int> lcnt(n, k), gcnt(n);
	priority_queue<pair<int, int>> pq;
	ll val = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			le[i].push_back(x[i][j]);
			val -= x[i][j];
		}
		pq.push({x[i][m - 1] + x[i][k - 1], i});
	}
	for (int _ = 0; _ < n * k / 2; _++) {
		val += pq.top().first;
		int i = pq.top().second;
		pq.pop();
		le[i].pop_back();
		gr[i].push_back(x[i][m - gcnt[i] - 1]);
		lcnt[i]--, gcnt[i]++;
		if (lcnt[i]) pq.push({x[i][m - gcnt[i] - 1] + x[i][lcnt[i] - 1], i});
	}


	vector<vector<int>> alloc(n, vector<int>(m, -1));
	while (pq.size()) pq.pop();
	for (int i = 0; i < n; i++) pq.push({gcnt[i], i});
	for (int i = 0; i < k; i++) {
		vector<bool> used(n);
		for (int j = 0; j < n / 2; j++) {
			int idx = pq.top().second;
			pq.pop();
			alloc[idx][m - gcnt[idx] + gr[idx].size() - 1] = i;
			gr[idx].pop_back();
			used[idx] = true;
		}
		for (int j = 0; j < n; j++) {
			if (!used[j]) {
				alloc[j][le[j].size() - 1] = i;
				le[j].pop_back();
			} else pq.push({gr[j].size(), j});
		}
	}

	allocate_tickets(alloc);
	return val;
}

Subtask #1
11.0 / 11.0

# 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 876 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 2540 KB Output is correct
6 Correct 648 ms 51748 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 27 ms 3052 KB Output is correct
6 Correct 703 ms 66156 KB Output is correct
7 Correct 727 ms 67436 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 11 ms 1004 KB Output is correct
13 Correct 24 ms 2816 KB Output is correct
14 Correct 30 ms 2668 KB Output is correct
15 Correct 782 ms 75884 KB Output is correct

Subtask #4
14.0 / 14.0

# 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 4 ms 748 KB Output is correct
5 Correct 37 ms 4332 KB Output is correct
6 Correct 6 ms 1004 KB Output is correct
7 Correct 8 ms 1260 KB Output is correct
8 Correct 982 ms 94924 KB Output is correct
9 Correct 939 ms 88896 KB Output is correct
10 Correct 911 ms 87584 KB Output is correct
11 Correct 991 ms 93972 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 4 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 4 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 27 ms 3308 KB Output is correct
14 Correct 27 ms 3308 KB Output is correct
15 Correct 32 ms 3820 KB Output is correct
16 Correct 37 ms 4332 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 30 ms 3180 KB Output is correct
21 Correct 37 ms 3692 KB Output is correct
22 Correct 33 ms 3692 KB Output is correct
23 Correct 45 ms 4076 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 876 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 3 ms 492 KB Output is correct
11 Correct 34 ms 2540 KB Output is correct
12 Correct 648 ms 51748 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 27 ms 3052 KB Output is correct
18 Correct 703 ms 66156 KB Output is correct
19 Correct 727 ms 67436 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 11 ms 1004 KB Output is correct
25 Correct 24 ms 2816 KB Output is correct
26 Correct 30 ms 2668 KB Output is correct
27 Correct 782 ms 75884 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 4 ms 748 KB Output is correct
32 Correct 37 ms 4332 KB Output is correct
33 Correct 6 ms 1004 KB Output is correct
34 Correct 8 ms 1260 KB Output is correct
35 Correct 982 ms 94924 KB Output is correct
36 Correct 939 ms 88896 KB Output is correct
37 Correct 911 ms 87584 KB Output is correct
38 Correct 991 ms 93972 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 4 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 492 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 27 ms 3308 KB Output is correct
52 Correct 27 ms 3308 KB Output is correct
53 Correct 32 ms 3820 KB Output is correct
54 Correct 37 ms 4332 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 30 ms 3180 KB Output is correct
59 Correct 37 ms 3692 KB Output is correct
60 Correct 33 ms 3692 KB Output is correct
61 Correct 45 ms 4076 KB Output is correct
62 Correct 74 ms 8556 KB Output is correct
63 Correct 75 ms 8556 KB Output is correct
64 Correct 131 ms 10476 KB Output is correct
65 Correct 378 ms 36716 KB Output is correct
66 Correct 423 ms 40684 KB Output is correct
67 Correct 8 ms 1260 KB Output is correct
68 Correct 9 ms 1004 KB Output is correct
69 Correct 648 ms 73448 KB Output is correct
70 Correct 841 ms 83820 KB Output is correct
71 Correct 1034 ms 94952 KB Output is correct
72 Correct 850 ms 78292 KB Output is correct
73 Correct 943 ms 90604 KB Output is correct
74 Correct 737 ms 68204 KB Output is correct
75 Correct 836 ms 80616 KB Output is correct