Submission #399614

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
399614	2021-05-06T10:00:43 Z	ZikXewen	Fun Tour (APIO20_fun)	C++17	100 / 100	334 ms	21032 KB

#include "fun.h"
#include <bits/stdc++.h>
#define _s(x) (grp[x].size())
#define _b(x) (grp[x].back())
#define i2 ((i + 1) % 3)
#define i3 ((i + 2) % 3)
using namespace std;
typedef pair<int, int> ii;
vector<int> createFunTour(int N, int Q) {
	int cen = 0;
	for(int i = 1, mnsz = N; i < N; ++i) {
		int tem = attractionsBehind(0, i); // N - 1
		if((tem << 1) >= N and tem < mnsz) cen = i, mnsz = tem;
	}
	vector<int> adj, dis(N), ans;
	for(int i = 0; i < N; ++i) if(i != cen and (dis[i] = hoursRequired(cen, i)) == 1) adj.emplace_back(i); // N - 1
	vector<int> grp[3];
	for(int i = 0; i < N; ++i) if(i != cen) {
		if(hoursRequired(adj[0], i) == dis[i] - 1) grp[0].emplace_back(i); // N
		else if(hoursRequired(adj[1], i) == dis[i] - 1) grp[1].emplace_back(i); // N
		else grp[2].emplace_back(i);
	}
	for(auto &i: grp) sort(i.begin(), i.end(), [&](int u, int v){return dis[u] < dis[v];});
	// cout << _s(0) << ' ' << _s(1) << ' ' << _s(2);
	--N;
	auto push = [&](int u){ans.emplace_back(_b(u)); grp[u].pop_back(); --N;};
	for(int ls = -1, mx = 0; _s(0) and _s(1) and _s(2);){
		for(int i = 0; i < 3; ++i) if(_s(i) << 1 >= N) {
			if(i2 == ls){
				if(dis[_b(i3)] > mx) push(i3);
				else push(i);
			} else if(i3 == ls){
				if(dis[_b(i2)] > mx) push(i2);
				else push(i);
			}
			for(auto j: grp[i3]) grp[i2].emplace_back(j);
			vector<int>().swap(grp[i3]);
			sort(grp[i2].begin(), grp[i2].end(), [&](int u, int v){return dis[u] < dis[v];});
			ls = -2;
			break;
		} if(ls == -2) break;
		mx = 0;
		for(int i = 0; i < 3; ++i) if(i != ls) mx = max(mx, dis[_b(i)]);
		for(int i = 0; i < 3; ++i) if(i != ls and mx == dis[_b(i)]) 
			{push(ls = i); break;}
	}
	if(!_s(0)) grp[0].swap(grp[2]);
	if(!_s(1)) grp[1].swap(grp[2]);
	if(_s(0) < _s(1)) grp[0].swap(grp[1]);
	for(int i = 0, _N = N; i < _N; ++i) push(i & 1);
	ans.emplace_back(cen);
	// for(int i: ans) cout << i << ' ';
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:28:44: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |   for(int i = 0; i < 3; ++i) if(_s(i) << 1 >= N) {
      |                                            ^

Subtask #1
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	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	292 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	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 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	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	292 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	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 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	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	296 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	296 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct

Subtask #3
21.0 / 21.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	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 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	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	137 ms	16176 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	460 KB	Output is correct
21	Correct	4 ms	716 KB	Output is correct
22	Correct	8 ms	1228 KB	Output is correct
23	Correct	13 ms	2228 KB	Output is correct
24	Correct	18 ms	3020 KB	Output is correct
25	Correct	74 ms	9268 KB	Output is correct

Subtask #4
19.0 / 19.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	1 ms	204 KB	Output is correct
5	Correct	1 ms	292 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	11 ms	1764 KB	Output is correct
15	Correct	141 ms	16020 KB	Output is correct
16	Correct	147 ms	15916 KB	Output is correct
17	Correct	26 ms	3908 KB	Output is correct
18	Correct	62 ms	7384 KB	Output is correct
19	Correct	111 ms	12560 KB	Output is correct
20	Correct	5 ms	844 KB	Output is correct

Subtask #5
34.0 / 34.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	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	292 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	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 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	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	296 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	296 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	137 ms	16176 KB	Output is correct
45	Correct	2 ms	332 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	4 ms	716 KB	Output is correct
48	Correct	8 ms	1228 KB	Output is correct
49	Correct	13 ms	2228 KB	Output is correct
50	Correct	18 ms	3020 KB	Output is correct
51	Correct	74 ms	9268 KB	Output is correct
52	Correct	2 ms	332 KB	Output is correct
53	Correct	11 ms	1764 KB	Output is correct
54	Correct	141 ms	16020 KB	Output is correct
55	Correct	147 ms	15916 KB	Output is correct
56	Correct	26 ms	3908 KB	Output is correct
57	Correct	62 ms	7384 KB	Output is correct
58	Correct	111 ms	12560 KB	Output is correct
59	Correct	5 ms	844 KB	Output is correct
60	Correct	192 ms	16064 KB	Output is correct
61	Correct	214 ms	18492 KB	Output is correct
62	Correct	179 ms	16148 KB	Output is correct
63	Correct	203 ms	20036 KB	Output is correct
64	Correct	215 ms	20100 KB	Output is correct
65	Correct	198 ms	16312 KB	Output is correct
66	Correct	236 ms	18468 KB	Output is correct
67	Correct	202 ms	20156 KB	Output is correct
68	Correct	213 ms	19212 KB	Output is correct
69	Correct	277 ms	20796 KB	Output is correct
70	Correct	188 ms	16224 KB	Output is correct
71	Correct	198 ms	20028 KB	Output is correct
72	Correct	252 ms	18676 KB	Output is correct
73	Correct	252 ms	19260 KB	Output is correct
74	Correct	334 ms	20912 KB	Output is correct
75	Correct	204 ms	16328 KB	Output is correct
76	Correct	237 ms	20088 KB	Output is correct
77	Correct	259 ms	20076 KB	Output is correct
78	Correct	259 ms	19452 KB	Output is correct
79	Correct	274 ms	20620 KB	Output is correct
80	Correct	302 ms	21032 KB	Output is correct
81	Correct	202 ms	16056 KB	Output is correct
82	Correct	216 ms	16220 KB	Output is correct
83	Correct	216 ms	16316 KB	Output is correct
84	Correct	73 ms	6968 KB	Output is correct

Submission #399614

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
34.0 / 34.0