oj.uz

Submission #591674

# Submission time Handle Problem Language Result Execution time Memory
591674 2022-07-07T18:15:10 Z Soumya1 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 628 ms 55996 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<int> ptr(n);
	priority_queue<pair<int, int>> pq;
	for (int i = 0; i < n; i++) pq.push({-x[i][0] - x[i][m - k], i});
	long long ret = 0;
	int taken = 0;
	while (taken < n * k / 2) {
		auto [val, i] = pq.top();
		pq.pop();
		ptr[i]++;
		if (ptr[i] < k) pq.push({-x[i][ptr[i]] - x[i][m - k + ptr[i]], i});
		taken++;
	}
	int cur = 0;
	vector<int> ending(n);
	vector<vector<int>> ans(n, vector<int> (m, -1));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < ptr[i]; j++) {
			ret -= x[i][j];
			ans[i][j] = cur++;
			if (cur == k) cur = 0;
		}
		ending[i] = cur;
	}
	for (int i = 0; i < n; i++) {
		cur = ending[i];
		for (int j = 0; j < k - ptr[i]; j++) {
			ret += x[i][m - j - 1];
			ans[i][m - j - 1] = cur++;
			if (cur == k) cur = 0;
		}
	}
	allocate_tickets(ans);
	return ret;
}

Subtask #1
11.0 / 11.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 1 ms 232 KB Output is correct
5 Correct 1 ms 340 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 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 21 ms 3228 KB Output is correct
6 Correct 543 ms 53232 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 2548 KB Output is correct
6 Correct 431 ms 54076 KB Output is correct
7 Correct 449 ms 54376 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 16 ms 2196 KB Output is correct
14 Correct 18 ms 2160 KB Output is correct
15 Correct 456 ms 55060 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 24 ms 3212 KB Output is correct
6 Correct 5 ms 804 KB Output is correct
7 Correct 5 ms 912 KB Output is correct
8 Correct 628 ms 55732 KB Output is correct
9 Correct 536 ms 52004 KB Output is correct
10 Correct 576 ms 52008 KB Output is correct
11 Correct 563 ms 55704 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 468 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 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 300 KB Output is correct
9 Correct 2 ms 440 KB Output is correct
10 Correct 2 ms 500 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 420 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 468 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 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 300 KB Output is correct
9 Correct 2 ms 440 KB Output is correct
10 Correct 2 ms 500 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 420 KB Output is correct
13 Correct 20 ms 3148 KB Output is correct
14 Correct 21 ms 3172 KB Output is correct
15 Correct 21 ms 3156 KB Output is correct
16 Correct 23 ms 3276 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 440 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 21 ms 2628 KB Output is correct
21 Correct 21 ms 3192 KB Output is correct
22 Correct 21 ms 2664 KB Output is correct
23 Correct 24 ms 3088 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 488 KB Output is correct
11 Correct 21 ms 3228 KB Output is correct
12 Correct 543 ms 53232 KB Output is correct
13 Correct 0 ms 296 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 20 ms 2548 KB Output is correct
18 Correct 431 ms 54076 KB Output is correct
19 Correct 449 ms 54376 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 16 ms 2196 KB Output is correct
26 Correct 18 ms 2160 KB Output is correct
27 Correct 456 ms 55060 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 496 KB Output is correct
32 Correct 24 ms 3212 KB Output is correct
33 Correct 5 ms 804 KB Output is correct
34 Correct 5 ms 912 KB Output is correct
35 Correct 628 ms 55732 KB Output is correct
36 Correct 536 ms 52004 KB Output is correct
37 Correct 576 ms 52008 KB Output is correct
38 Correct 563 ms 55704 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 492 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 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 300 KB Output is correct
47 Correct 2 ms 440 KB Output is correct
48 Correct 2 ms 500 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 420 KB Output is correct
51 Correct 20 ms 3148 KB Output is correct
52 Correct 21 ms 3172 KB Output is correct
53 Correct 21 ms 3156 KB Output is correct
54 Correct 23 ms 3276 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 440 KB Output is correct
57 Correct 1 ms 312 KB Output is correct
58 Correct 21 ms 2628 KB Output is correct
59 Correct 21 ms 3192 KB Output is correct
60 Correct 21 ms 2664 KB Output is correct
61 Correct 24 ms 3088 KB Output is correct
62 Correct 55 ms 7548 KB Output is correct
63 Correct 55 ms 7628 KB Output is correct
64 Correct 64 ms 7820 KB Output is correct
65 Correct 228 ms 25576 KB Output is correct
66 Correct 245 ms 26108 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 4 ms 696 KB Output is correct
69 Correct 459 ms 53328 KB Output is correct
70 Correct 507 ms 54248 KB Output is correct
71 Correct 569 ms 55996 KB Output is correct
72 Correct 495 ms 54220 KB Output is correct
73 Correct 549 ms 53912 KB Output is correct
74 Correct 443 ms 52688 KB Output is correct
75 Correct 521 ms 52704 KB Output is correct