oj.uz

Submission #342120

# Submission time Handle Problem Language Result Execution time Memory
342120 2021-01-01T11:54:17 Z SeDunion Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1105 ms 114608 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n, vector<int>(m, -1));
	vector<int> all(n);
	vector<int> np(n), pp(n, m);
	vector<pair<int,int>> now;
	ll Sum = 0;
	vector<pair<ll,int>> q;
	for (int i = 0 ; i < n ; ++ i) {
		for (int j = 0 ; j < k ; ++ j) {
			Sum -= x[i][j];
			q.push_back({x[i][j] + x[i][m - k + j], i});
		}
	}
	sort(q.rbegin(), q.rend());
	for (int rep = 0 ; rep < n * k / 2 ; ++ rep) {
		auto [val, i] = q[rep];
		Sum += val;
		all[i] += 2;
	}
	for (int c = 0 ; c < k ; ++ c) {
		now.clear();
		for (int i = 0 ; i < n ; ++ i) now.push_back({all[i], i});
		sort(now.begin(), now.end());
		for (int j = 0 ; j < n / 2 ; ++ j) {
			int i = now[j].second;
			answer[i][np[i]++] = c;
			all[i]++;
		}
		for (int j = n / 2 ; j < n ; ++ j) {
			int i = now[j].second;
			answer[i][--pp[i]] = c;
			all[i]--;
		}
	}
	allocate_tickets(answer);
	return Sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 29 ms 2540 KB Output is correct
6 Correct 667 ms 51564 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 29 ms 2912 KB Output is correct
6 Correct 763 ms 62480 KB Output is correct
7 Correct 729 ms 68240 KB Output is correct
8 Correct 4 ms 876 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 8 ms 1004 KB Output is correct
13 Correct 25 ms 2784 KB Output is correct
14 Correct 24 ms 2916 KB Output is correct
15 Correct 770 ms 77376 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 704 KB Output is correct
5 Correct 40 ms 4448 KB Output is correct
6 Correct 6 ms 1004 KB Output is correct
7 Correct 11 ms 1260 KB Output is correct
8 Correct 1060 ms 114608 KB Output is correct
9 Correct 990 ms 111536 KB Output is correct
10 Correct 993 ms 111384 KB Output is correct
11 Correct 1105 ms 114608 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 728 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 4 ms 848 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 728 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 4 ms 848 KB Output is correct
13 Correct 28 ms 3308 KB Output is correct
14 Correct 29 ms 3308 KB Output is correct
15 Correct 34 ms 3680 KB Output is correct
16 Correct 42 ms 4448 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 41 ms 3304 KB Output is correct
21 Correct 36 ms 3808 KB Output is correct
22 Correct 39 ms 3840 KB Output is correct
23 Correct 48 ms 4372 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 29 ms 2540 KB Output is correct
12 Correct 667 ms 51564 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 29 ms 2912 KB Output is correct
18 Correct 763 ms 62480 KB Output is correct
19 Correct 729 ms 68240 KB Output is correct
20 Correct 4 ms 876 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 8 ms 1004 KB Output is correct
25 Correct 25 ms 2784 KB Output is correct
26 Correct 24 ms 2916 KB Output is correct
27 Correct 770 ms 77376 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 704 KB Output is correct
32 Correct 40 ms 4448 KB Output is correct
33 Correct 6 ms 1004 KB Output is correct
34 Correct 11 ms 1260 KB Output is correct
35 Correct 1060 ms 114608 KB Output is correct
36 Correct 990 ms 111536 KB Output is correct
37 Correct 993 ms 111384 KB Output is correct
38 Correct 1105 ms 114608 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 3 ms 620 KB Output is correct
44 Correct 3 ms 728 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 4 ms 620 KB Output is correct
50 Correct 4 ms 848 KB Output is correct
51 Correct 28 ms 3308 KB Output is correct
52 Correct 29 ms 3308 KB Output is correct
53 Correct 34 ms 3680 KB Output is correct
54 Correct 42 ms 4448 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 41 ms 3304 KB Output is correct
59 Correct 36 ms 3808 KB Output is correct
60 Correct 39 ms 3840 KB Output is correct
61 Correct 48 ms 4372 KB Output is correct
62 Correct 77 ms 8496 KB Output is correct
63 Correct 82 ms 8556 KB Output is correct
64 Correct 115 ms 11688 KB Output is correct
65 Correct 384 ms 37728 KB Output is correct
66 Correct 456 ms 45448 KB Output is correct
67 Correct 9 ms 1292 KB Output is correct
68 Correct 8 ms 1004 KB Output is correct
69 Correct 687 ms 73212 KB Output is correct
70 Correct 869 ms 84112 KB Output is correct
71 Correct 1048 ms 114576 KB Output is correct
72 Correct 953 ms 100240 KB Output is correct
73 Correct 990 ms 96272 KB Output is correct
74 Correct 789 ms 70324 KB Output is correct
75 Correct 847 ms 82448 KB Output is correct