oj.uz

Submission #417561

# Submission time Handle Problem Language Result Execution time Memory
417561 2021-06-04T00:15:30 Z ja_kingy Carnival Tickets (IOI20_tickets) C++14
100 / 100
 950 ms 67808 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> pii;

long long find_maximum(int k, vector<vector<int>> x) {
	long long res = 0;
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans(n, vector<int>(m, -1));
	vector<pii> csts;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < k; ++j) {
			res += x[i][m-1-j];
		}
		for (int j = 0; j < k; ++j) {
			csts.push_back({x[i][j]+x[i][m-k+j],i});
		}
	}
	vector<int> lcnt(n), hcnt(n, k);
	sort(csts.begin(), csts.end());
	for (int i = 0; i < n*k/2; ++i) {
		res -= csts[i].first;
		lcnt[csts[i].second]++;
		hcnt[csts[i].second]--;
	}
	for (int i = 0; i < k; ++i) {
		vector<int> vs(n);
		iota(vs.begin(), vs.end(), 0);
		sort(vs.begin(), vs.end(), [&](int a, int b) {return lcnt[a] > lcnt[b];});
		for (int j = 0; j < n/2; ++j) {
			lcnt[vs[j]]--;
			ans[vs[j]][lcnt[vs[j]]] = i;
		}
		for (int j = n/2; j < n; ++j) {
			hcnt[vs[j]]--;
			ans[vs[j]][m-1-hcnt[vs[j]]] = i;
		}
	}
	allocate_tickets(ans);
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 688 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 34 ms 3140 KB Output is correct
6 Correct 623 ms 53904 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 2 ms 416 KB Output is correct
5 Correct 24 ms 2556 KB Output is correct
6 Correct 606 ms 57732 KB Output is correct
7 Correct 647 ms 60692 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 872 KB Output is correct
13 Correct 22 ms 2260 KB Output is correct
14 Correct 22 ms 2336 KB Output is correct
15 Correct 660 ms 63044 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 264 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 36 ms 3608 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 7 ms 1100 KB Output is correct
8 Correct 933 ms 64800 KB Output is correct
9 Correct 911 ms 60484 KB Output is correct
10 Correct 863 ms 60464 KB Output is correct
11 Correct 950 ms 64668 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 588 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 26 ms 3240 KB Output is correct
14 Correct 27 ms 3184 KB Output is correct
15 Correct 36 ms 3244 KB Output is correct
16 Correct 36 ms 3612 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 29 ms 2764 KB Output is correct
21 Correct 32 ms 3232 KB Output is correct
22 Correct 33 ms 2936 KB Output is correct
23 Correct 35 ms 3484 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 688 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 34 ms 3140 KB Output is correct
12 Correct 623 ms 53904 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 2 ms 416 KB Output is correct
17 Correct 24 ms 2556 KB Output is correct
18 Correct 606 ms 57732 KB Output is correct
19 Correct 647 ms 60692 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 7 ms 872 KB Output is correct
25 Correct 22 ms 2260 KB Output is correct
26 Correct 22 ms 2336 KB Output is correct
27 Correct 660 ms 63044 KB Output is correct
28 Correct 1 ms 264 KB Output is correct
29 Correct 1 ms 292 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 36 ms 3608 KB Output is correct
33 Correct 6 ms 844 KB Output is correct
34 Correct 7 ms 1100 KB Output is correct
35 Correct 933 ms 64800 KB Output is correct
36 Correct 911 ms 60484 KB Output is correct
37 Correct 863 ms 60464 KB Output is correct
38 Correct 950 ms 64668 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 432 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 26 ms 3240 KB Output is correct
52 Correct 27 ms 3184 KB Output is correct
53 Correct 36 ms 3244 KB Output is correct
54 Correct 36 ms 3612 KB Output is correct
55 Correct 1 ms 300 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 29 ms 2764 KB Output is correct
59 Correct 32 ms 3232 KB Output is correct
60 Correct 33 ms 2936 KB Output is correct
61 Correct 35 ms 3484 KB Output is correct
62 Correct 79 ms 8388 KB Output is correct
63 Correct 72 ms 8356 KB Output is correct
64 Correct 98 ms 9572 KB Output is correct
65 Correct 337 ms 32952 KB Output is correct
66 Correct 399 ms 36864 KB Output is correct
67 Correct 7 ms 1100 KB Output is correct
68 Correct 6 ms 812 KB Output is correct
69 Correct 661 ms 54156 KB Output is correct
70 Correct 771 ms 56220 KB Output is correct
71 Correct 923 ms 64864 KB Output is correct
72 Correct 826 ms 67808 KB Output is correct
73 Correct 901 ms 61436 KB Output is correct
74 Correct 689 ms 60764 KB Output is correct
75 Correct 762 ms 54640 KB Output is correct