Submission #342141

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
342141	2021-01-01T13:02:25 Z	SeDunion	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1082 ms	93328 KB

tickets

#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;
      	all[i]++;
	}
	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	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	2 ms	760 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	1 ms	364 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	27 ms	2412 KB	Output is correct
6	Correct	664 ms	51692 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	1 ms	364 KB	Output is correct
4	Correct	3 ms	492 KB	Output is correct
5	Correct	28 ms	3040 KB	Output is correct
6	Correct	735 ms	64400 KB	Output is correct
7	Correct	749 ms	70032 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	25 ms	2916 KB	Output is correct
15	Correct	775 ms	74768 KB	Output is correct

Subtask #4

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 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	41 ms	4448 KB	Output is correct
6	Correct	7 ms	1004 KB	Output is correct
7	Correct	9 ms	1260 KB	Output is correct
8	Correct	1038 ms	92968 KB	Output is correct
9	Correct	994 ms	91056 KB	Output is correct
10	Correct	993 ms	91064 KB	Output is correct
11	Correct	1082 ms	92728 KB	Output is correct

Subtask #5

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	3 ms	492 KB	Output is correct
3	Correct	4 ms	492 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	620 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	3 ms	620 KB	Output is correct
12	Correct	3 ms	716 KB	Output is correct

Subtask #6

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	3 ms	492 KB	Output is correct
3	Correct	4 ms	492 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	620 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	3 ms	620 KB	Output is correct
12	Correct	3 ms	716 KB	Output is correct
13	Correct	28 ms	3308 KB	Output is correct
14	Correct	28 ms	3308 KB	Output is correct
15	Correct	34 ms	3680 KB	Output is correct
16	Correct	40 ms	4376 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	38 ms	3304 KB	Output is correct
21	Correct	35 ms	3808 KB	Output is correct
22	Correct	37 ms	3944 KB	Output is correct
23	Correct	39 ms	4448 KB	Output is correct

Subtask #7

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	2 ms	760 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	2 ms	492 KB	Output is correct
11	Correct	27 ms	2412 KB	Output is correct
12	Correct	664 ms	51692 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	3 ms	492 KB	Output is correct
17	Correct	28 ms	3040 KB	Output is correct
18	Correct	735 ms	64400 KB	Output is correct
19	Correct	749 ms	70032 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	25 ms	2916 KB	Output is correct
27	Correct	775 ms	74768 KB	Output is correct
28	Correct	1 ms	364 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	41 ms	4448 KB	Output is correct
33	Correct	7 ms	1004 KB	Output is correct
34	Correct	9 ms	1260 KB	Output is correct
35	Correct	1038 ms	92968 KB	Output is correct
36	Correct	994 ms	91056 KB	Output is correct
37	Correct	993 ms	91064 KB	Output is correct
38	Correct	1082 ms	92728 KB	Output is correct
39	Correct	0 ms	364 KB	Output is correct
40	Correct	3 ms	492 KB	Output is correct
41	Correct	4 ms	492 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	620 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	3 ms	620 KB	Output is correct
50	Correct	3 ms	716 KB	Output is correct
51	Correct	28 ms	3308 KB	Output is correct
52	Correct	28 ms	3308 KB	Output is correct
53	Correct	34 ms	3680 KB	Output is correct
54	Correct	40 ms	4376 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	38 ms	3304 KB	Output is correct
59	Correct	35 ms	3808 KB	Output is correct
60	Correct	37 ms	3944 KB	Output is correct
61	Correct	39 ms	4448 KB	Output is correct
62	Correct	75 ms	7660 KB	Output is correct
63	Correct	77 ms	7660 KB	Output is correct
64	Correct	107 ms	10712 KB	Output is correct
65	Correct	368 ms	29516 KB	Output is correct
66	Correct	448 ms	37304 KB	Output is correct
67	Correct	8 ms	1260 KB	Output is correct
68	Correct	7 ms	1004 KB	Output is correct
69	Correct	679 ms	51580 KB	Output is correct
70	Correct	845 ms	62480 KB	Output is correct
71	Correct	1033 ms	92848 KB	Output is correct
72	Correct	981 ms	93328 KB	Output is correct
73	Correct	990 ms	75280 KB	Output is correct
74	Correct	793 ms	63504 KB	Output is correct
75	Correct	853 ms	61456 KB	Output is correct