oj.uz

Submission #300347

# Submission time Handle Problem Language Result Execution time Memory
300347 2020-09-17T05:44:19 Z jtnydv25 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1311 ms 72212 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<ll>> f(n, vector<ll> (k + 1, 0));
	vector<int> pluses(n);
	vector<int> minuses(n);
	set<pair<ll, int>> benefits;

	ll mx = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < k; j++) f[i][0] -= x[i][j];
		for(int r = 1; r <= k; r++){
			f[i][r] = f[i][r - 1] + x[i][m - r] + x[i][k - r]; // f is concave :)
		}
		benefits.insert({f[i][1] - f[i][0], i});
		minuses[i] = k;
		mx += f[i][0];
	}

	for(int r = 1; r <= (n * k) / 2; r++){
		auto it = *benefits.rbegin();
		benefits.erase(it);
		int i = it.second;
		mx += it.first;
		pluses[i]++;
		minuses[i]--;
		if(pluses[i] != k) benefits.insert({f[i][pluses[i] + 1] - f[i][pluses[i]], i});
	}

	vector<vector<int>> when(n, vector<int>(m, -1));
	for(int r = 0; r < k; r++){
		// choose n / 2 pluses, n / 2 minuses
		vector<int> perm(n, 0);
		iota(perm.begin(), perm.end(), 0);
		vector<int> hasOption(n);
		for(int i = 0; i < n; i++) hasOption[i] = pluses[i] && minuses[i];
		sort(perm.begin(), perm.end(), [&](int i, int j){return hasOption[i] < hasOption[j];});
		int balance = 0;
		for(int i : perm){
			if(balance <= 0){
				if(pluses[i]){
					when[i][m - pluses[i]] = r;
					pluses[i]--;
					balance++;
				} else{
					when[i][--minuses[i]] = r;
					balance--;
				}
				
			} else{
				if(minuses[i]){
					when[i][--minuses[i]] = r;
					balance--;
				} else{
					when[i][m - pluses[i]] = r;
					pluses[i]--;
					balance++;
				}
			}
		}
		assert(balance == 0);
	}
	allocate_tickets(when);
	return mx;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2432 KB Output is correct
6 Correct 781 ms 51552 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 26 ms 2816 KB Output is correct
6 Correct 683 ms 61364 KB Output is correct
7 Correct 790 ms 64644 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 8 ms 984 KB Output is correct
13 Correct 23 ms 2536 KB Output is correct
14 Correct 26 ms 2592 KB Output is correct
15 Correct 715 ms 67588 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 5 ms 488 KB Output is correct
5 Correct 46 ms 3240 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 12 ms 1152 KB Output is correct
8 Correct 1299 ms 72092 KB Output is correct
9 Correct 1168 ms 67180 KB Output is correct
10 Correct 1158 ms 67272 KB Output is correct
11 Correct 1200 ms 72212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 31 ms 2432 KB Output is correct
14 Correct 51 ms 2432 KB Output is correct
15 Correct 37 ms 2808 KB Output is correct
16 Correct 43 ms 3192 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 35 ms 2936 KB Output is correct
21 Correct 41 ms 2808 KB Output is correct
22 Correct 37 ms 3064 KB Output is correct
23 Correct 45 ms 3064 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2432 KB Output is correct
12 Correct 781 ms 51552 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 26 ms 2816 KB Output is correct
18 Correct 683 ms 61364 KB Output is correct
19 Correct 790 ms 64644 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 8 ms 984 KB Output is correct
25 Correct 23 ms 2536 KB Output is correct
26 Correct 26 ms 2592 KB Output is correct
27 Correct 715 ms 67588 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 5 ms 488 KB Output is correct
32 Correct 46 ms 3240 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 12 ms 1152 KB Output is correct
35 Correct 1299 ms 72092 KB Output is correct
36 Correct 1168 ms 67180 KB Output is correct
37 Correct 1158 ms 67272 KB Output is correct
38 Correct 1200 ms 72212 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 4 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 31 ms 2432 KB Output is correct
52 Correct 51 ms 2432 KB Output is correct
53 Correct 37 ms 2808 KB Output is correct
54 Correct 43 ms 3192 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 35 ms 2936 KB Output is correct
59 Correct 41 ms 2808 KB Output is correct
60 Correct 37 ms 3064 KB Output is correct
61 Correct 45 ms 3064 KB Output is correct
62 Correct 86 ms 6136 KB Output is correct
63 Correct 84 ms 6136 KB Output is correct
64 Correct 121 ms 8312 KB Output is correct
65 Correct 412 ms 27512 KB Output is correct
66 Correct 494 ms 31868 KB Output is correct
67 Correct 11 ms 1152 KB Output is correct
68 Correct 9 ms 768 KB Output is correct
69 Correct 801 ms 51704 KB Output is correct
70 Correct 987 ms 61292 KB Output is correct
71 Correct 1311 ms 72068 KB Output is correct
72 Correct 845 ms 68856 KB Output is correct
73 Correct 1080 ms 68356 KB Output is correct
74 Correct 710 ms 60364 KB Output is correct
75 Correct 918 ms 59956 KB Output is correct