oj.uz

Submission #543541

# Submission time Handle Problem Language Result Execution time Memory
543541 2022-03-30T21:12:28 Z sliviu Carnival Tickets (IOI20_tickets) C++17
100 / 100
 692 ms 59552 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 ans = 0;
	vector<int> pos(n, k - 1);
	vector<vector<int>> sol(n, vector<int>(m, -1));
	priority_queue<pair<int, int>> PQ;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < k; ++j)
			ans -= x[i][j];
		PQ.emplace(x[i][k - 1] + x[i][m - 1], i);
	}
	for (int i = 0; i < n * k / 2; ++i) {
		auto [s, j] = PQ.top();
		PQ.pop();
		ans += s;
		if (--pos[j] >= 0)
			PQ.emplace(x[j][pos[j]] + x[j][m - k + pos[j]], j);
	}
	for (int i = 0, l = 0, r = k - 1; i < n; ++i) {
		for (int j = 0; j <= pos[i]; ++j)
			sol[i][j] = l, l = (l + 1) % k;
		for (int j = m - 1; j > m - k + pos[i]; --j)
			sol[i][j] = r, r = (r - 1 + k) % k;
	}
	allocate_tickets(sol);
	return ans;
}

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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 2 ms 344 KB Output is correct
5 Correct 22 ms 2388 KB Output is correct
6 Correct 536 ms 51396 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 18 ms 2552 KB Output is correct
6 Correct 475 ms 56716 KB Output is correct
7 Correct 448 ms 57076 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 7 ms 852 KB Output is correct
13 Correct 15 ms 2168 KB Output is correct
14 Correct 16 ms 2096 KB Output is correct
15 Correct 471 ms 57740 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 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 29 ms 3292 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 5 ms 1012 KB Output is correct
8 Correct 692 ms 56372 KB Output is correct
9 Correct 652 ms 52464 KB Output is correct
10 Correct 662 ms 52492 KB Output is correct
11 Correct 681 ms 56348 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 2 ms 404 KB Output is correct
12 Correct 2 ms 436 KB Output is correct
13 Correct 22 ms 3120 KB Output is correct
14 Correct 22 ms 3256 KB Output is correct
15 Correct 24 ms 3224 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 22 ms 2644 KB Output is correct
21 Correct 24 ms 3096 KB Output is correct
22 Correct 24 ms 2620 KB Output is correct
23 Correct 26 ms 3148 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 22 ms 2388 KB Output is correct
12 Correct 536 ms 51396 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 296 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 18 ms 2552 KB Output is correct
18 Correct 475 ms 56716 KB Output is correct
19 Correct 448 ms 57076 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 296 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 7 ms 852 KB Output is correct
25 Correct 15 ms 2168 KB Output is correct
26 Correct 16 ms 2096 KB Output is correct
27 Correct 471 ms 57740 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 212 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 29 ms 3292 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 1012 KB Output is correct
35 Correct 692 ms 56372 KB Output is correct
36 Correct 652 ms 52464 KB Output is correct
37 Correct 662 ms 52492 KB Output is correct
38 Correct 681 ms 56348 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 440 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 304 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 3 ms 468 KB Output is correct
49 Correct 2 ms 404 KB Output is correct
50 Correct 2 ms 436 KB Output is correct
51 Correct 22 ms 3120 KB Output is correct
52 Correct 22 ms 3256 KB Output is correct
53 Correct 24 ms 3224 KB Output is correct
54 Correct 27 ms 3268 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 22 ms 2644 KB Output is correct
59 Correct 24 ms 3096 KB Output is correct
60 Correct 24 ms 2620 KB Output is correct
61 Correct 26 ms 3148 KB Output is correct
62 Correct 65 ms 8352 KB Output is correct
63 Correct 60 ms 8396 KB Output is correct
64 Correct 76 ms 8564 KB Output is correct
65 Correct 264 ms 31080 KB Output is correct
66 Correct 293 ms 31732 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 5 ms 748 KB Output is correct
69 Correct 573 ms 53636 KB Output is correct
70 Correct 625 ms 54632 KB Output is correct
71 Correct 689 ms 56320 KB Output is correct
72 Correct 553 ms 59552 KB Output is correct
73 Correct 655 ms 54404 KB Output is correct
74 Correct 484 ms 58112 KB Output is correct
75 Correct 599 ms 52912 KB Output is correct