Submission #303077

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
303077	2020-09-19T21:03:27 Z	tutis	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1156 ms	75480 KB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	bool vien = true;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (x[i][j] < 0 || x[i][j] > 1)
				vien = false;
	vector<vector<int>> answer(n, vector<int>(m, -1));
	int mxp = n / 2 * k;
	int M[n], P[n];
	if (vien)
	{
		for (int i = 0; i < n; i++)
		{
			P[i] = 0;
			while (P[i] < m && x[i][m - 1 - P[i]] == 1)
				P[i]++;
		}
		for (int i = 0; i < n; i++)
			M[i] = k - P[i];
	}
	else if (k < m)
	{
		long long del[n][k + 1];
		for (int i = 0; i < n; i++)
		{
			long long d = 0;
			for (int c = 0; c < k; c++)
				d -= x[i][c];
			for (int p = 0; p <= k; p++)
			{
				del[i][p] = d;
				d += x[i][k - 1 - p];
				d += x[i][m - 1 - p];
			}
		}
		vector<pair<int, int>>A;
		for (int i = 0; i < n; i++)
		{
			M[i] = P[i] = 0;
			for (int j = 0; j < k; j++)
				A.push_back({del[i][j + 1] - del[i][j], i});
		}
		sort(A.begin(), A.end());
		for (int i = 0; i < (int)A.size() / 2; i++)
		{
			M[A[i].second]++;
		}
		for (int i = (int)A.size() / 2; i < (int)A.size(); i++)
		{
			P[A[i].second]++;
		}
	}
	else
	{
		vector<pair<int, int>>A;
		for (int i = 0; i < n; i++)
		{
			M[i] = P[i] = 0;
			for (int j = 0; j < m; j++)
				A.push_back({x[i][j], i});
		}
		sort(A.begin(), A.end());
		for (int i = 0; i < (int)A.size() / 2; i++)
		{
			M[A[i].second]++;
		}
		for (int i = (int)A.size() / 2; i < (int)A.size(); i++)
		{
			P[A[i].second]++;
		}
	}
	int a[n];
	int b[n];
	for (int i = 0; i < n; i++)
	{
		a[i] = 0;
		b[i] = m - 1;
	}
	long long ret = 0;
	for (int g = 0; g < k; g++)
	{
		pair<int, int>xx[n];
		for (int i = 0; i < n; i++)
			xx[i] = {P[i], i};
		sort(xx, xx + n);
		for (int i = 0; i < n / 2; i++)
		{
			int id = xx[i].second;
			ret -= x[id][a[id]];
			answer[id][a[id]] = g;
			a[id]++;
			M[id]--;
		}
		for (int i = n / 2; i < n; i++)
		{
			int id = xx[i].second;
			ret += x[id][b[id]];
			answer[id][b[id]] = g;
			b[id]--;
			P[id]--;
		}
	}
	allocate_tickets(answer);
	return ret;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:14:6: warning: unused variable 'mxp' [-Wunused-variable]
   14 |  int mxp = n / 2 * k;
      |      ^~~

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	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	2 ms	768 KB	Output is correct

Subtask #2

16.0 / 16.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	3 ms	512 KB	Output is correct
5	Correct	32 ms	2468 KB	Output is correct
6	Correct	742 ms	51576 KB	Output is correct

Subtask #3

14.0 / 14.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	2 ms	512 KB	Output is correct
5	Correct	24 ms	2408 KB	Output is correct
6	Correct	610 ms	52472 KB	Output is correct
7	Correct	641 ms	52856 KB	Output is correct
8	Correct	3 ms	512 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	7 ms	896 KB	Output is correct
13	Correct	24 ms	2048 KB	Output is correct
14	Correct	21 ms	2048 KB	Output is correct
15	Correct	678 ms	53496 KB	Output is correct

Subtask #4

14.0 / 14.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	1 ms	256 KB	Output is correct
4	Correct	3 ms	512 KB	Output is correct
5	Correct	42 ms	2552 KB	Output is correct
6	Correct	7 ms	768 KB	Output is correct
7	Correct	8 ms	904 KB	Output is correct
8	Correct	1101 ms	59976 KB	Output is correct
9	Correct	1078 ms	58216 KB	Output is correct
10	Correct	1076 ms	58184 KB	Output is correct
11	Correct	1156 ms	59972 KB	Output is correct

Subtask #5

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	3 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	3 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	3 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	0 ms	256 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	3 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	3 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	3 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	2388 KB	Output is correct
14	Correct	31 ms	2424 KB	Output is correct
15	Correct	37 ms	2832 KB	Output is correct
16	Correct	42 ms	2552 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	3 ms	512 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	34 ms	2972 KB	Output is correct
21	Correct	38 ms	2860 KB	Output is correct
22	Correct	38 ms	3196 KB	Output is correct
23	Correct	42 ms	3192 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	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	2 ms	768 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	32 ms	2468 KB	Output is correct
12	Correct	742 ms	51576 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	2 ms	512 KB	Output is correct
17	Correct	24 ms	2408 KB	Output is correct
18	Correct	610 ms	52472 KB	Output is correct
19	Correct	641 ms	52856 KB	Output is correct
20	Correct	3 ms	512 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	7 ms	896 KB	Output is correct
25	Correct	24 ms	2048 KB	Output is correct
26	Correct	21 ms	2048 KB	Output is correct
27	Correct	678 ms	53496 KB	Output is correct
28	Correct	0 ms	256 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	42 ms	2552 KB	Output is correct
33	Correct	7 ms	768 KB	Output is correct
34	Correct	8 ms	904 KB	Output is correct
35	Correct	1101 ms	59976 KB	Output is correct
36	Correct	1078 ms	58216 KB	Output is correct
37	Correct	1076 ms	58184 KB	Output is correct
38	Correct	1156 ms	59972 KB	Output is correct
39	Correct	0 ms	256 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	3 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	3 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	3 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	2388 KB	Output is correct
52	Correct	31 ms	2424 KB	Output is correct
53	Correct	37 ms	2832 KB	Output is correct
54	Correct	42 ms	2552 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct
56	Correct	3 ms	512 KB	Output is correct
57	Correct	2 ms	384 KB	Output is correct
58	Correct	34 ms	2972 KB	Output is correct
59	Correct	38 ms	2860 KB	Output is correct
60	Correct	38 ms	3196 KB	Output is correct
61	Correct	42 ms	3192 KB	Output is correct
62	Correct	84 ms	6136 KB	Output is correct
63	Correct	89 ms	6136 KB	Output is correct
64	Correct	117 ms	6200 KB	Output is correct
65	Correct	410 ms	27532 KB	Output is correct
66	Correct	478 ms	24112 KB	Output is correct
67	Correct	9 ms	904 KB	Output is correct
68	Correct	8 ms	768 KB	Output is correct
69	Correct	747 ms	51716 KB	Output is correct
70	Correct	928 ms	61392 KB	Output is correct
71	Correct	1103 ms	59848 KB	Output is correct
72	Correct	1002 ms	75480 KB	Output is correct
73	Correct	1110 ms	68124 KB	Output is correct
74	Correct	816 ms	60292 KB	Output is correct
75	Correct	934 ms	59824 KB	Output is correct