oj.uz

Submission #346354

# Submission time Handle Problem Language Result Execution time Memory
346354 2021-01-09T12:45:49 Z dennisstar Carnival Tickets (IOI20_tickets) C++17
100 / 100
 943 ms 76268 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using ll = long long;

ll find_maximum(int K, vector<vector<int>> X) {
	int N = X.size(), M=X[0].size();

	ll R=0;
	vector<int> T(N), l(N), r(N);
	priority_queue<pair<int, int>> pq;
	for (int i=0; i<N; i++) {
		pq.emplace(X[i][M-1]+X[i][K-1], i);
		for (int j=0; j<K; j++) R-=X[i][j];
	}

	for (int i=0; i<K*N/2; i++) {
		int j=pq.top().second;
		R+=pq.top().first;
		pq.pop();
		T[j]++;
		if (T[j]<K)
			pq.emplace(X[j][M-1-T[j]]+X[j][K-1-T[j]], j);
	}
	
	vector<vector<int>> A;
	while (pq.size()) pq.pop();
	for (int i=0; i<N; i++)
		A.emplace_back(vector<int>(M, -1)),
		pq.emplace(T[i], i);

	for (int i=0; i<K; i++) {
		vector<int> chk(N);
		for (int j=0; j<N/2; j++) chk[pq.top().second]=1, pq.pop();
		for (int j=0; j<N; j++) {
			if (chk[j]) {
				l[j]++;
				A[j][M-l[j]]=i;
				pq.emplace(T[j]-l[j], j);
			}
			else A[j][r[j]]=i, r[j]++;
		}
	}

	allocate_tickets(A);
	return R;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 2412 KB Output is correct
6 Correct 637 ms 51456 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 29 ms 2668 KB Output is correct
6 Correct 666 ms 56940 KB Output is correct
7 Correct 698 ms 57272 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 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 8 ms 876 KB Output is correct
13 Correct 24 ms 2284 KB Output is correct
14 Correct 24 ms 2284 KB Output is correct
15 Correct 759 ms 57964 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 3 ms 492 KB Output is correct
5 Correct 36 ms 3436 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1132 KB Output is correct
8 Correct 915 ms 76148 KB Output is correct
9 Correct 862 ms 71532 KB Output is correct
10 Correct 877 ms 71352 KB Output is correct
11 Correct 943 ms 76248 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 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 3 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 3 ms 492 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 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 3 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 3 ms 492 KB Output is correct
13 Correct 27 ms 3308 KB Output is correct
14 Correct 38 ms 3308 KB Output is correct
15 Correct 33 ms 3436 KB Output is correct
16 Correct 35 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 32 ms 3180 KB Output is correct
22 Correct 31 ms 2668 KB Output is correct
23 Correct 34 ms 3308 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 0 ms 364 KB Output is correct
3 Correct 0 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 0 ms 364 KB Output is correct
8 Correct 0 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 2412 KB Output is correct
12 Correct 637 ms 51456 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 29 ms 2668 KB Output is correct
18 Correct 666 ms 56940 KB Output is correct
19 Correct 698 ms 57272 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 384 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 8 ms 876 KB Output is correct
25 Correct 24 ms 2284 KB Output is correct
26 Correct 24 ms 2284 KB Output is correct
27 Correct 759 ms 57964 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 36 ms 3436 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 7 ms 1132 KB Output is correct
35 Correct 915 ms 76148 KB Output is correct
36 Correct 862 ms 71532 KB Output is correct
37 Correct 877 ms 71352 KB Output is correct
38 Correct 943 ms 76248 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 3 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 3 ms 492 KB Output is correct
51 Correct 27 ms 3308 KB Output is correct
52 Correct 38 ms 3308 KB Output is correct
53 Correct 33 ms 3436 KB Output is correct
54 Correct 35 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 32 ms 3180 KB Output is correct
60 Correct 31 ms 2668 KB Output is correct
61 Correct 34 ms 3308 KB Output is correct
62 Correct 71 ms 8428 KB Output is correct
63 Correct 74 ms 8556 KB Output is correct
64 Correct 97 ms 8684 KB Output is correct
65 Correct 343 ms 33260 KB Output is correct
66 Correct 395 ms 33772 KB Output is correct
67 Correct 7 ms 1132 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 669 ms 73312 KB Output is correct
70 Correct 784 ms 74476 KB Output is correct
71 Correct 907 ms 76268 KB Output is correct
72 Correct 783 ms 60780 KB Output is correct
73 Correct 871 ms 73580 KB Output is correct
74 Correct 674 ms 59324 KB Output is correct
75 Correct 772 ms 72096 KB Output is correct