Submission #292516

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
292516	2020-09-07T07:52:33 Z	amoo_safar	Fun Tour (APIO20_fun)	C++17	100 / 100	348 ms	24052 KB

#include "fun.h"

#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;

typedef pair<int, int> pii;

const int N = 1e5 + 10;

int sub[N];
int dep[N], com[N];
vector<int> R[N], G;

int Sum(){
	int res = 0;
	for(auto x : G)
		res += R[x].size();
	return res;
}
int Max(){
	int res = 0;
	for(auto x : G)
		res = max(res, (int)R[x].size());
	return res;
}


bool Check(vector<int> An){
	for(int i = 0; i + 2 < (int) An.size(); i++){
		if(dep[An[i]] < dep[An[i + 2]]) return false;
	}
	for(int i = 0; i + 1 < (int) An.size(); i++){
		if(com[An[i]] == com[An[i + 1]]) return false;
	}
	return true;
}

vector<int> createFunTour(int n, int Q) {
	assert(Q == 400000);
	int rt = 0;
	for(int i = 0; i < n; i++)
		sub[i] = attractionsBehind(rt, i);
	
	int cen = 0;
	for(int i = 0; i < n; i++){
		if(sub[i] + sub[i] >= n && sub[i] < sub[cen]) cen = i;
	}
	
	//cerr << "centroid : " << cen << '\n';

	for(int i = 0; i < n; i++)
		dep[i] = hoursRequired(cen, i);
	//vector<int> G;
	for(int i = 0; i < n; i++){
		if(dep[i] == 1) G.pb(i);
	}
	for(int i = 0; i < n; i++){
		if(i == cen) continue;
		int par = G.back();
		for(auto x : G){
			if(x == par) continue;
			if(hoursRequired(x, i) == dep[i] - 1){
				par = x;
				break;
			}
		}

		R[par].pb(i);
		com[i] = par;
		//cerr << i << " -> " << par << '\n';
	}

	sort(all(G), [&](int u, int v){
		return R[u].size() > R[v].size();
	});

	vector<int> A, B, C, P;
	
	for(auto x : G){
		sort(all(R[x]), [&](int i, int j){
			return dep[i] < dep[j];
		});
		//for(auto y : R[x]) C.pb(y);
	}


	while(Max()*2 < Sum()){
		int la = (P.empty() ? -1 : com[P.back()]);
		
		int cand = -1;;
		for(auto x : G){
			if(x == la) continue;
			if(R[x].empty()) continue;
			if(cand == -1) cand = x;
			else {
				if(dep[R[x].back()] > dep[R[cand].back()])
					cand = x;
			}
		}
		assert(cand != -1);
		P.pb(R[cand].back());
		R[cand].pop_back();
	}

	sort(all(G), [&](int u, int v){
		return R[u].size() > R[v].size();
	});
	for(auto x : G){
		
		sort(all(R[x]), [&](int i, int j){
			return dep[i] > dep[j];
		});
		
		for(auto y : R[x]) C.pb(y);
	}

	int sz = C.size();

	for(int i = 0; i < (sz + 1) / 2; i++) A.pb(C[i]);
	for(int i = (sz + 1) / 2; i < sz; i++) B.pb(C[i]);
	
	sort(all(B), [&](int i, int j){
		return dep[i] > dep[j];
	});

	if(sz % 2 == 0){
		for(int i = 0; i < sz/2; i++){
			P.pb(A[i]);
			P.pb(B[i]);
		}
		if(!Check(P)){
			for(int i = 0; i < sz; i++) P.pop_back();	
			for(int i = 0; i < sz/2; i++){
				P.pb(B[i]);
				P.pb(A[i]);
			}
		}
	} else {
		for(int i = 0; i < sz/2; i++){
			P.pb(A[i]);
			P.pb(B[i]);
		}
		P.pb(A.back());
	}
	assert((Check(P) == true));

	P.pb(cen);

	/*
	cerr << "ans : ";
	for(auto x : P) cerr << x << ' ';
	cerr << '\n';
	cerr << '\n';
	*/
	assert(((int) P.size() == n));
	return P;
	
}
/*
7 400000
0 1
0 5
0 6
1 2
1 4
2 3

*/

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2816 KB	Output is correct
2	Correct	2 ms	2688 KB	Output is correct
3	Correct	2 ms	2688 KB	Output is correct
4	Correct	2 ms	2688 KB	Output is correct
5	Correct	2 ms	2688 KB	Output is correct
6	Correct	2 ms	2688 KB	Output is correct
7	Correct	2 ms	2688 KB	Output is correct
8	Correct	2 ms	2688 KB	Output is correct
9	Correct	2 ms	2688 KB	Output is correct
10	Correct	2 ms	2688 KB	Output is correct
11	Correct	2 ms	2688 KB	Output is correct
12	Correct	2 ms	2688 KB	Output is correct
13	Correct	3 ms	2688 KB	Output is correct
14	Correct	2 ms	2688 KB	Output is correct
15	Correct	2 ms	2688 KB	Output is correct
16	Correct	2 ms	2688 KB	Output is correct
17	Correct	2 ms	2688 KB	Output is correct
18	Correct	2 ms	2688 KB	Output is correct
19	Correct	2 ms	2688 KB	Output is correct
20	Correct	3 ms	2688 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2816 KB	Output is correct
2	Correct	2 ms	2688 KB	Output is correct
3	Correct	2 ms	2688 KB	Output is correct
4	Correct	2 ms	2688 KB	Output is correct
5	Correct	2 ms	2688 KB	Output is correct
6	Correct	2 ms	2688 KB	Output is correct
7	Correct	2 ms	2688 KB	Output is correct
8	Correct	2 ms	2688 KB	Output is correct
9	Correct	2 ms	2688 KB	Output is correct
10	Correct	2 ms	2688 KB	Output is correct
11	Correct	2 ms	2688 KB	Output is correct
12	Correct	2 ms	2688 KB	Output is correct
13	Correct	3 ms	2688 KB	Output is correct
14	Correct	2 ms	2688 KB	Output is correct
15	Correct	2 ms	2688 KB	Output is correct
16	Correct	2 ms	2688 KB	Output is correct
17	Correct	2 ms	2688 KB	Output is correct
18	Correct	2 ms	2688 KB	Output is correct
19	Correct	2 ms	2688 KB	Output is correct
20	Correct	3 ms	2688 KB	Output is correct
21	Correct	2 ms	2688 KB	Output is correct
22	Correct	2 ms	2688 KB	Output is correct
23	Correct	2 ms	2688 KB	Output is correct
24	Correct	2 ms	2688 KB	Output is correct
25	Correct	2 ms	2688 KB	Output is correct
26	Correct	2 ms	2688 KB	Output is correct
27	Correct	2 ms	2688 KB	Output is correct
28	Correct	2 ms	2688 KB	Output is correct
29	Correct	2 ms	2688 KB	Output is correct
30	Correct	2 ms	2688 KB	Output is correct
31	Correct	2 ms	2688 KB	Output is correct
32	Correct	2 ms	2688 KB	Output is correct
33	Correct	2 ms	2688 KB	Output is correct
34	Correct	2 ms	2816 KB	Output is correct
35	Correct	3 ms	2688 KB	Output is correct
36	Correct	2 ms	2688 KB	Output is correct
37	Correct	2 ms	2688 KB	Output is correct
38	Correct	2 ms	2688 KB	Output is correct
39	Correct	2 ms	2688 KB	Output is correct
40	Correct	2 ms	2688 KB	Output is correct
41	Correct	2 ms	2688 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2688 KB	Output is correct
2	Correct	2 ms	2688 KB	Output is correct
3	Correct	2 ms	2688 KB	Output is correct
4	Correct	2 ms	2688 KB	Output is correct
5	Correct	2 ms	2688 KB	Output is correct
6	Correct	2 ms	2688 KB	Output is correct
7	Correct	2 ms	2688 KB	Output is correct
8	Correct	2 ms	2688 KB	Output is correct
9	Correct	2 ms	2688 KB	Output is correct
10	Correct	2 ms	2688 KB	Output is correct
11	Correct	2 ms	2688 KB	Output is correct
12	Correct	2 ms	2688 KB	Output is correct
13	Correct	2 ms	2688 KB	Output is correct
14	Correct	2 ms	2688 KB	Output is correct
15	Correct	2 ms	2688 KB	Output is correct
16	Correct	2 ms	2688 KB	Output is correct
17	Correct	2 ms	2688 KB	Output is correct
18	Correct	144 ms	18160 KB	Output is correct
19	Correct	3 ms	2816 KB	Output is correct
20	Correct	4 ms	2944 KB	Output is correct
21	Correct	5 ms	3072 KB	Output is correct
22	Correct	9 ms	3712 KB	Output is correct
23	Correct	16 ms	4736 KB	Output is correct
24	Correct	20 ms	5376 KB	Output is correct
25	Correct	84 ms	11584 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2688 KB	Output is correct
2	Correct	2 ms	2688 KB	Output is correct
3	Correct	2 ms	2688 KB	Output is correct
4	Correct	2 ms	2688 KB	Output is correct
5	Correct	2 ms	2688 KB	Output is correct
6	Correct	3 ms	2688 KB	Output is correct
7	Correct	2 ms	2688 KB	Output is correct
8	Correct	2 ms	2688 KB	Output is correct
9	Correct	2 ms	2688 KB	Output is correct
10	Correct	2 ms	2688 KB	Output is correct
11	Correct	2 ms	2688 KB	Output is correct
12	Correct	2 ms	2688 KB	Output is correct
13	Correct	3 ms	2816 KB	Output is correct
14	Correct	14 ms	4224 KB	Output is correct
15	Correct	159 ms	18288 KB	Output is correct
16	Correct	165 ms	18036 KB	Output is correct
17	Correct	31 ms	6392 KB	Output is correct
18	Correct	70 ms	9676 KB	Output is correct
19	Correct	124 ms	14792 KB	Output is correct
20	Correct	7 ms	3328 KB	Output is correct

Subtask #5
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2816 KB	Output is correct
2	Correct	2 ms	2688 KB	Output is correct
3	Correct	2 ms	2688 KB	Output is correct
4	Correct	2 ms	2688 KB	Output is correct
5	Correct	2 ms	2688 KB	Output is correct
6	Correct	2 ms	2688 KB	Output is correct
7	Correct	2 ms	2688 KB	Output is correct
8	Correct	2 ms	2688 KB	Output is correct
9	Correct	2 ms	2688 KB	Output is correct
10	Correct	2 ms	2688 KB	Output is correct
11	Correct	2 ms	2688 KB	Output is correct
12	Correct	2 ms	2688 KB	Output is correct
13	Correct	3 ms	2688 KB	Output is correct
14	Correct	2 ms	2688 KB	Output is correct
15	Correct	2 ms	2688 KB	Output is correct
16	Correct	2 ms	2688 KB	Output is correct
17	Correct	2 ms	2688 KB	Output is correct
18	Correct	2 ms	2688 KB	Output is correct
19	Correct	2 ms	2688 KB	Output is correct
20	Correct	3 ms	2688 KB	Output is correct
21	Correct	2 ms	2688 KB	Output is correct
22	Correct	2 ms	2688 KB	Output is correct
23	Correct	2 ms	2688 KB	Output is correct
24	Correct	2 ms	2688 KB	Output is correct
25	Correct	2 ms	2688 KB	Output is correct
26	Correct	2 ms	2688 KB	Output is correct
27	Correct	2 ms	2688 KB	Output is correct
28	Correct	2 ms	2688 KB	Output is correct
29	Correct	2 ms	2688 KB	Output is correct
30	Correct	2 ms	2688 KB	Output is correct
31	Correct	2 ms	2688 KB	Output is correct
32	Correct	2 ms	2688 KB	Output is correct
33	Correct	2 ms	2688 KB	Output is correct
34	Correct	2 ms	2816 KB	Output is correct
35	Correct	3 ms	2688 KB	Output is correct
36	Correct	2 ms	2688 KB	Output is correct
37	Correct	2 ms	2688 KB	Output is correct
38	Correct	2 ms	2688 KB	Output is correct
39	Correct	2 ms	2688 KB	Output is correct
40	Correct	2 ms	2688 KB	Output is correct
41	Correct	2 ms	2688 KB	Output is correct
42	Correct	2 ms	2688 KB	Output is correct
43	Correct	2 ms	2688 KB	Output is correct
44	Correct	144 ms	18160 KB	Output is correct
45	Correct	3 ms	2816 KB	Output is correct
46	Correct	4 ms	2944 KB	Output is correct
47	Correct	5 ms	3072 KB	Output is correct
48	Correct	9 ms	3712 KB	Output is correct
49	Correct	16 ms	4736 KB	Output is correct
50	Correct	20 ms	5376 KB	Output is correct
51	Correct	84 ms	11584 KB	Output is correct
52	Correct	3 ms	2816 KB	Output is correct
53	Correct	14 ms	4224 KB	Output is correct
54	Correct	159 ms	18288 KB	Output is correct
55	Correct	165 ms	18036 KB	Output is correct
56	Correct	31 ms	6392 KB	Output is correct
57	Correct	70 ms	9676 KB	Output is correct
58	Correct	124 ms	14792 KB	Output is correct
59	Correct	7 ms	3328 KB	Output is correct
60	Correct	201 ms	19104 KB	Output is correct
61	Correct	274 ms	21616 KB	Output is correct
62	Correct	214 ms	19184 KB	Output is correct
63	Correct	240 ms	23152 KB	Output is correct
64	Correct	253 ms	23032 KB	Output is correct
65	Correct	249 ms	19056 KB	Output is correct
66	Correct	278 ms	21464 KB	Output is correct
67	Correct	250 ms	23028 KB	Output is correct
68	Correct	274 ms	22424 KB	Output is correct
69	Correct	344 ms	23792 KB	Output is correct
70	Correct	207 ms	18288 KB	Output is correct
71	Correct	242 ms	22128 KB	Output is correct
72	Correct	288 ms	21876 KB	Output is correct
73	Correct	262 ms	22256 KB	Output is correct
74	Correct	348 ms	23024 KB	Output is correct
75	Correct	233 ms	19060 KB	Output is correct
76	Correct	242 ms	23024 KB	Output is correct
77	Correct	269 ms	23152 KB	Output is correct
78	Correct	275 ms	22256 KB	Output is correct
79	Correct	313 ms	23792 KB	Output is correct
80	Correct	331 ms	24052 KB	Output is correct
81	Correct	221 ms	18288 KB	Output is correct
82	Correct	228 ms	18288 KB	Output is correct
83	Correct	253 ms	18676 KB	Output is correct
84	Correct	82 ms	9296 KB	Output is correct

Submission #292516

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