oj.uz

Submission #535800

# Submission time Handle Problem Language Result Execution time Memory
535800 2022-03-11T09:53:47 Z KoD Carnival Tickets (IOI20_tickets) C++17
100 / 100
 601 ms 76204 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using std::vector;
using std::array;
using std::pair;
using std::tuple;

using ll = long long;

ll find_maximum(int K, vector<vector<int>> X) {
	const int N = X.size();
	const int M = X[0].size();
	ll score = 0;
	vector<int> small(N, K);
	std::priority_queue<pair<int, int>> heap;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < K; ++j) {
			score -= X[i][j];
		}
		heap.emplace(X[i][M - 1] + X[i][K - 1], i);
	}
	for (int k = 0; k < N * K / 2; ++k) {
		const auto [x, i] = heap.top();
		heap.pop();
		score += x;
		small[i] -= 1;
		if (small[i] > 0) {
			heap.emplace(X[i][M - K + small[i] - 1] + X[i][small[i] - 1], i);
		}
	}
	vector alloc(N, vector(M, -1));
	int a = 0, b = K - 1;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < small[i]; ++j) {
			alloc[i][j] = a;
			a = (a + 1) % K;
		}
		for (int j = 0; j < K - small[i]; ++j) {
			alloc[i][M - j - 1] = b;
			b = (b + K - 1) % K;
		}
	}
	allocate_tickets(alloc);
	return score;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 3240 KB Output is correct
6 Correct 476 ms 73172 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 19 ms 2452 KB Output is correct
6 Correct 443 ms 56764 KB Output is correct
7 Correct 433 ms 57228 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 15 ms 2096 KB Output is correct
14 Correct 15 ms 2132 KB Output is correct
15 Correct 444 ms 57716 KB Output is correct

Subtask #4
14.0 / 14.0

# 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 304 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 23 ms 3276 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 601 ms 76040 KB Output is correct
9 Correct 573 ms 71084 KB Output is correct
10 Correct 554 ms 71088 KB Output is correct
11 Correct 585 ms 76204 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 19 ms 3244 KB Output is correct
14 Correct 20 ms 3216 KB Output is correct
15 Correct 21 ms 3148 KB Output is correct
16 Correct 23 ms 3284 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 2 ms 500 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 22 ms 2588 KB Output is correct
21 Correct 21 ms 3072 KB Output is correct
22 Correct 20 ms 2688 KB Output is correct
23 Correct 22 ms 3124 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 20 ms 3240 KB Output is correct
12 Correct 476 ms 73172 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 444 KB Output is correct
17 Correct 19 ms 2452 KB Output is correct
18 Correct 443 ms 56764 KB Output is correct
19 Correct 433 ms 57228 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 15 ms 2096 KB Output is correct
26 Correct 15 ms 2132 KB Output is correct
27 Correct 444 ms 57716 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 2 ms 440 KB Output is correct
32 Correct 23 ms 3276 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 5 ms 980 KB Output is correct
35 Correct 601 ms 76040 KB Output is correct
36 Correct 573 ms 71084 KB Output is correct
37 Correct 554 ms 71088 KB Output is correct
38 Correct 585 ms 76204 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 440 KB Output is correct
41 Correct 2 ms 444 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 388 KB Output is correct
48 Correct 2 ms 496 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 19 ms 3244 KB Output is correct
52 Correct 20 ms 3216 KB Output is correct
53 Correct 21 ms 3148 KB Output is correct
54 Correct 23 ms 3284 KB Output is correct
55 Correct 1 ms 316 KB Output is correct
56 Correct 2 ms 500 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 22 ms 2588 KB Output is correct
59 Correct 21 ms 3072 KB Output is correct
60 Correct 20 ms 2688 KB Output is correct
61 Correct 22 ms 3124 KB Output is correct
62 Correct 59 ms 8332 KB Output is correct
63 Correct 57 ms 8420 KB Output is correct
64 Correct 66 ms 8588 KB Output is correct
65 Correct 237 ms 33140 KB Output is correct
66 Correct 257 ms 33612 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 4 ms 752 KB Output is correct
69 Correct 479 ms 73288 KB Output is correct
70 Correct 524 ms 74040 KB Output is correct
71 Correct 598 ms 75972 KB Output is correct
72 Correct 482 ms 60544 KB Output is correct
73 Correct 554 ms 73420 KB Output is correct
74 Correct 433 ms 59084 KB Output is correct
75 Correct 509 ms 71856 KB Output is correct