oj.uz

Submission #591621

# Submission time Handle Problem Language Result Execution time Memory
591621 2022-07-07T17:06:31 Z Soumya1 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 766 ms 83976 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++) {
		for (int j = 0; j < k; j++) {
			pq.push({-x[i][j] - x[i][m - k + j], i});
		}
	}
	long long ret = 0;
	int taken = 0;
	while (taken < n * k / 2) {
		auto [val, i] = pq.top();
		pq.pop();
		ptr[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 1 ms 212 KB Output is correct
2 Correct 1 ms 292 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 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 1 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 3156 KB Output is correct
6 Correct 490 ms 73076 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 18 ms 2644 KB Output is correct
6 Correct 435 ms 57760 KB Output is correct
7 Correct 530 ms 60672 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 16 ms 2368 KB Output is correct
14 Correct 16 ms 2344 KB Output is correct
15 Correct 510 ms 63048 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 468 KB Output is correct
5 Correct 27 ms 3648 KB Output is correct
6 Correct 7 ms 828 KB Output is correct
7 Correct 6 ms 1092 KB Output is correct
8 Correct 766 ms 63980 KB Output is correct
9 Correct 704 ms 59904 KB Output is correct
10 Correct 687 ms 59700 KB Output is correct
11 Correct 757 ms 63996 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 436 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 448 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 444 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 436 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 448 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 444 KB Output is correct
13 Correct 20 ms 3236 KB Output is correct
14 Correct 20 ms 3160 KB Output is correct
15 Correct 29 ms 3292 KB Output is correct
16 Correct 38 ms 3624 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 21 ms 2860 KB Output is correct
21 Correct 23 ms 3276 KB Output is correct
22 Correct 24 ms 3016 KB Output is correct
23 Correct 28 ms 3464 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 292 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 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 1 ms 212 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 20 ms 3156 KB Output is correct
12 Correct 490 ms 73076 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 444 KB Output is correct
17 Correct 18 ms 2644 KB Output is correct
18 Correct 435 ms 57760 KB Output is correct
19 Correct 530 ms 60672 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 0 ms 312 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 16 ms 2368 KB Output is correct
26 Correct 16 ms 2344 KB Output is correct
27 Correct 510 ms 63048 KB Output is correct
28 Correct 1 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 3 ms 468 KB Output is correct
32 Correct 27 ms 3648 KB Output is correct
33 Correct 7 ms 828 KB Output is correct
34 Correct 6 ms 1092 KB Output is correct
35 Correct 766 ms 63980 KB Output is correct
36 Correct 704 ms 59904 KB Output is correct
37 Correct 687 ms 59700 KB Output is correct
38 Correct 757 ms 63996 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 436 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 496 KB Output is correct
43 Correct 2 ms 536 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 1 ms 312 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 448 KB Output is correct
48 Correct 3 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 444 KB Output is correct
51 Correct 20 ms 3236 KB Output is correct
52 Correct 20 ms 3160 KB Output is correct
53 Correct 29 ms 3292 KB Output is correct
54 Correct 38 ms 3624 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 21 ms 2860 KB Output is correct
59 Correct 23 ms 3276 KB Output is correct
60 Correct 24 ms 3016 KB Output is correct
61 Correct 28 ms 3464 KB Output is correct
62 Correct 50 ms 8352 KB Output is correct
63 Correct 52 ms 8392 KB Output is correct
64 Correct 77 ms 9644 KB Output is correct
65 Correct 248 ms 33572 KB Output is correct
66 Correct 347 ms 37488 KB Output is correct
67 Correct 5 ms 1088 KB Output is correct
68 Correct 5 ms 852 KB Output is correct
69 Correct 524 ms 73056 KB Output is correct
70 Correct 611 ms 75112 KB Output is correct
71 Correct 746 ms 83976 KB Output is correct
72 Correct 668 ms 67840 KB Output is correct
73 Correct 658 ms 80092 KB Output is correct
74 Correct 537 ms 60804 KB Output is correct
75 Correct 607 ms 73288 KB Output is correct