oj.uz

Submission #837767

# Submission time Handle Problem Language Result Execution time Memory
837767 2023-08-25T16:10:40 Z Kerim Carnival Tickets (IOI20_tickets) C++17
100 / 100
 574 ms 75884 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
 
long long find_maximum(int k, vector<vector<int>> a) {
	int n = a.size();
	int m = a[0].size();
	vector <vector <int>> ans(n, vector <int> (m, -1));
	vector<int> l(n), r(n);
	priority_queue<pair<int,int>>q;
	ll S = 0;
	for (int i = 0; i < n; i++){
		r[i] = m - k;
		for (int j = m-k; j < m; j++)
			S += a[i][j];
		q.push({-a[i][0]-a[i][r[i]], i});
	}
	for (int j = 0; j < (n*k)/2; j++){
		auto [val, i] = q.top();
		q.pop();
		S += val;
		//turn red from a[i][r[i]] to green a[i][l[i]]
		l[i] += 1; r[i] += 1;
		if (r[i] < m)
			q.push({-a[i][l[i]]-a[i][r[i]], i});
	}
	vector<int> ind(n);
	for (int i = 0; i < n; i++)
		ind[i] = i;
	for (int p = 0; p < k; p++){
		sort(ind.begin(), ind.end(), [&](int x, int y){
			return (l[x] > l[y]);
		});
		for (int i = 0; i < n/2; i++)
			ans[ind[i]][--l[ind[i]]] = p;
		for (int i = n/2; i < n; i++)
			ans[ind[i]][r[ind[i]]++] = p;
	}
	allocate_tickets(ans);
	return S;
}

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 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 300 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 1 ms 300 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 468 KB Output is correct
5 Correct 17 ms 2504 KB Output is correct
6 Correct 390 ms 51480 KB Output is correct

Subtask #3
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 2 ms 340 KB Output is correct
5 Correct 15 ms 2464 KB Output is correct
6 Correct 369 ms 56712 KB Output is correct
7 Correct 443 ms 57036 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 824 KB Output is correct
13 Correct 13 ms 2152 KB Output is correct
14 Correct 13 ms 2196 KB Output is correct
15 Correct 398 ms 57748 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 0 ms 212 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 28 ms 2540 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 4 ms 912 KB Output is correct
8 Correct 519 ms 54484 KB Output is correct
9 Correct 488 ms 50796 KB Output is correct
10 Correct 574 ms 50832 KB Output is correct
11 Correct 537 ms 54472 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 3 ms 508 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 500 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 1 ms 212 KB Output is correct
2 Correct 3 ms 508 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 500 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 16 ms 3156 KB Output is correct
14 Correct 17 ms 3228 KB Output is correct
15 Correct 18 ms 3232 KB Output is correct
16 Correct 19 ms 3232 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 3 ms 432 KB Output is correct
19 Correct 1 ms 428 KB Output is correct
20 Correct 16 ms 2644 KB Output is correct
21 Correct 26 ms 3108 KB Output is correct
22 Correct 25 ms 2624 KB Output is correct
23 Correct 19 ms 3128 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 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 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 17 ms 2504 KB Output is correct
12 Correct 390 ms 51480 KB Output is correct
13 Correct 0 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 340 KB Output is correct
17 Correct 15 ms 2464 KB Output is correct
18 Correct 369 ms 56712 KB Output is correct
19 Correct 443 ms 57036 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 4 ms 824 KB Output is correct
25 Correct 13 ms 2152 KB Output is correct
26 Correct 13 ms 2196 KB Output is correct
27 Correct 398 ms 57748 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 496 KB Output is correct
32 Correct 28 ms 2540 KB Output is correct
33 Correct 3 ms 724 KB Output is correct
34 Correct 4 ms 912 KB Output is correct
35 Correct 519 ms 54484 KB Output is correct
36 Correct 488 ms 50796 KB Output is correct
37 Correct 574 ms 50832 KB Output is correct
38 Correct 537 ms 54472 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 3 ms 508 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 2 ms 496 KB Output is correct
43 Correct 2 ms 500 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 16 ms 3156 KB Output is correct
52 Correct 17 ms 3228 KB Output is correct
53 Correct 18 ms 3232 KB Output is correct
54 Correct 19 ms 3232 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 3 ms 432 KB Output is correct
57 Correct 1 ms 428 KB Output is correct
58 Correct 16 ms 2644 KB Output is correct
59 Correct 26 ms 3108 KB Output is correct
60 Correct 25 ms 2624 KB Output is correct
61 Correct 19 ms 3128 KB Output is correct
62 Correct 45 ms 8332 KB Output is correct
63 Correct 48 ms 8432 KB Output is correct
64 Correct 56 ms 8604 KB Output is correct
65 Correct 202 ms 33068 KB Output is correct
66 Correct 229 ms 33628 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 3 ms 748 KB Output is correct
69 Correct 395 ms 73200 KB Output is correct
70 Correct 461 ms 74116 KB Output is correct
71 Correct 521 ms 75884 KB Output is correct
72 Correct 442 ms 60664 KB Output is correct
73 Correct 487 ms 73232 KB Output is correct
74 Correct 400 ms 58972 KB Output is correct
75 Correct 443 ms 71756 KB Output is correct