oj.uz

Submission #824740

# Submission time Handle Problem Language Result Execution time Memory
824740 2023-08-14T09:19:22 Z thimote75 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 686 ms 76196 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;

using idata = vector<int>;
using igrid = vector<idata>;

using di = pair<int, int>;
using vd = vector<di>;

int find_maximum(signed K, vector<vector<signed>> x) {
	int N = x.size(); int M = x[0].size(); int H = N >> 1;

	int result = 0;
	for (int i = 0; i < N; i ++)
		for (int k = 1; k <= K; k ++)
			result += x[i][M - k];

	priority_queue<di> deltas;
	idata R(N, M - K);
	for (int i = 0; i < N; i ++)
		deltas.push({ - x[i][0] - x[i][M - K], i });
	
	for (int i = 0; i < H * K; i ++) {
		di curr = deltas.top(); deltas.pop();

		int j = curr.second;
		result += curr.first;
		R[j] ++;
		if (R[j] == M) continue ;

		int al = R[j] - (M - K);
		deltas.push({ - x[j][al] - x[j][R[j]], j });
	}

	vector<vector<signed>> allocations(N, vector<signed>(M, -1));

	idata L(N, 0);
	for (int k = 0; k < K; k ++) {
		vd RV;
		for (int i = 0; i < N; i ++)
			RV.push_back({ R[i], i });

		sort(RV.rbegin(), RV.rend());

		for (int i = 0; i < H; i ++) {
			int e = RV[i].second;
			allocations[e][L[e]] = k;
			L[e] ++;
		}

		for (int i = H; i < N; i ++) {
			int e = RV[i].second;
			allocations[e][R[e]] = k;
			R[e] ++;
		}
	}

	allocate_tickets(allocations);

	return result;
}

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 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 376 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 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 468 KB Output is correct
5 Correct 25 ms 3136 KB Output is correct
6 Correct 465 ms 51400 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 296 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 16 ms 2576 KB Output is correct
6 Correct 422 ms 56804 KB Output is correct
7 Correct 448 ms 57164 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 820 KB Output is correct
13 Correct 15 ms 2196 KB Output is correct
14 Correct 15 ms 2120 KB Output is correct
15 Correct 463 ms 57768 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 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 22 ms 3276 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 686 ms 75996 KB Output is correct
9 Correct 552 ms 70964 KB Output is correct
10 Correct 558 ms 71028 KB Output is correct
11 Correct 589 ms 76196 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 2 ms 436 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 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 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 436 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 17 ms 3156 KB Output is correct
14 Correct 16 ms 3216 KB Output is correct
15 Correct 19 ms 3188 KB Output is correct
16 Correct 25 ms 3244 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 2672 KB Output is correct
21 Correct 22 ms 3156 KB Output is correct
22 Correct 20 ms 2604 KB Output is correct
23 Correct 22 ms 3116 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 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 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 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 25 ms 3136 KB Output is correct
12 Correct 465 ms 51400 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 296 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 16 ms 2576 KB Output is correct
18 Correct 422 ms 56804 KB Output is correct
19 Correct 448 ms 57164 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 820 KB Output is correct
25 Correct 15 ms 2196 KB Output is correct
26 Correct 15 ms 2120 KB Output is correct
27 Correct 463 ms 57768 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 296 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 444 KB Output is correct
32 Correct 22 ms 3276 KB Output is correct
33 Correct 4 ms 852 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 686 ms 75996 KB Output is correct
36 Correct 552 ms 70964 KB Output is correct
37 Correct 558 ms 71028 KB Output is correct
38 Correct 589 ms 76196 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 436 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 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 17 ms 3156 KB Output is correct
52 Correct 16 ms 3216 KB Output is correct
53 Correct 19 ms 3188 KB Output is correct
54 Correct 25 ms 3244 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 2672 KB Output is correct
59 Correct 22 ms 3156 KB Output is correct
60 Correct 20 ms 2604 KB Output is correct
61 Correct 22 ms 3116 KB Output is correct
62 Correct 44 ms 8336 KB Output is correct
63 Correct 44 ms 8392 KB Output is correct
64 Correct 67 ms 8620 KB Output is correct
65 Correct 239 ms 33108 KB Output is correct
66 Correct 253 ms 33548 KB Output is correct
67 Correct 7 ms 980 KB Output is correct
68 Correct 4 ms 724 KB Output is correct
69 Correct 389 ms 73044 KB Output is correct
70 Correct 510 ms 74092 KB Output is correct
71 Correct 632 ms 76016 KB Output is correct
72 Correct 518 ms 60548 KB Output is correct
73 Correct 561 ms 73392 KB Output is correct
74 Correct 437 ms 59080 KB Output is correct
75 Correct 486 ms 71812 KB Output is correct