oj.uz

Submission #983472

# Submission time Handle Problem Language Result Execution time Memory
983472 2024-05-15T14:03:20 Z CSQ31 Fun Tour (APIO20_fun) C++17
100 / 100
 233 ms 29652 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)(a.size())
#define fi first
#define se second
typedef long long int ll;
typedef pair<int,int> pii;
//1)root at 0
//2)find centroid, centroid is the node with smallest subtree size that is also >= n/2
const int MAXN = 111111;
int dist[4][MAXN];
vector<int> createFunTour(int n, int q) {
	if(n==2)return {0,1};
	//hoursRequired(0, N - 1);
	//attractionsBehind(0, N - 1);
	//extract centroid
	vector<int>sub(n,0);
	sub[0] = n;
	int cen = 0;
	for(int i=1;i<n;i++){
		sub[i] = attractionsBehind(0,i);
		if(2*sub[i] >= n && sub[i] < sub[cen])cen = i;
	}

	//extract children
	vector<int>ch;
	vector<int>subtree[3];
	for(int i=0;i<n;i++){
		if(i==cen)continue;
		dist[3][i] = hoursRequired(cen,i);
		if(dist[3][i] == 1)ch.pb(i);
	}

	assert(sz(ch)>=2 && sz(ch)<=3);
	//get children subtrees
	vector<bool>vis(n,0);
	vis[cen] = 1;
	for(int i=0;i<2;i++){
		for(int v=0;v<n;v++){
			if(v==cen)continue;
			dist[i][v] = hoursRequired(ch[i],v);
			if(dist[3][v] == dist[i][v] + 1){
				subtree[i].pb(v);
				vis[v] = 1;
			}
		}
	}
	for(int v=0;v<n;v++){
		if(!vis[v])subtree[2].pb(v);
	}

	set<pii,greater<pii>>s[3];
	for(int x:subtree[0])s[0].insert({dist[3][x],x});
	for(int x:subtree[1])s[1].insert({dist[3][x],x});
	for(int x:subtree[2])s[2].insert({dist[3][x],x});

	vector<int>ans;
	function<bool(int)>check = [&](int i){ //check if j and k can be merged tgt
		int j = (i+1)%3;
		int k = (j+1)%3;
		return sz(s[i]) == sz(s[j]) +  sz(s[k]);
	};
	function<void(int)>merge = [&](int i){ //merge j and k
		//merge j and k into one
		int j = (i+1)%3;
		int k = (j+1)%3;
		set<pii,greater<pii>>tmp = s[j];
		for(auto x : s[k])tmp.insert(x);
		s[0] = s[i];
		s[1] = tmp;
		s[2].clear();
	};
	vector<int>debug;
	function<void(int)>add = [&](int i){
		ans.pb(s[i].begin()->se);
		debug.pb(s[i].begin()->fi);
		s[i].erase(s[i].begin());
	};
	//cout<<sz(s[0])<<" "<<sz(s[1])<<" "<<sz(s[2])<<'\n';
	/*
	cout<<cen<<'\n';
	for(int x:ch)cout<<x<<" ";
	cout<<'\n';
	cout<<"s0"<<'\n';
	for(auto x:s[0])cout<<x.fi<<" ";
	cout<<'\n';
	cout<<"s1"<<'\n';
	for(auto x:s[1])cout<<x.fi<<" ";
	cout<<'\n';
	cout<<"s2"<<'\n';
	for(auto x:s[2])cout<<x.fi<<" ";
	cout<<'\n';
	*/



	if(!s[2].empty()){ 
		if(sz(s[0]) >= sz(s[1]) + sz(s[2])){
			merge(0);
			goto jump;
		}
		else if(sz(s[1]) >= sz(s[0]) + sz(s[2])){
			merge(1);
			goto jump;

		}
		else if(sz(s[2]) >= sz(s[0]) + sz(s[1])){
			merge(2);
			goto jump;
		}

		int i = 0;
		if(s[1].begin()->fi > s[i].begin()->fi)i = 1;
		if(s[2].begin()->fi > s[i].begin()->fi)i = 2;

		//reduce to two sub if possible
		while(true){
			assert(sz(s[0]) < sz(s[1]) + sz(s[2]));
			assert(sz(s[1]) < sz(s[0]) + sz(s[2]));
			assert(sz(s[2]) < sz(s[0]) + sz(s[1]));
			add(i);
			int j = (i+1)%3;
			int k = (j+1)%3;
			if(check(j)){
				//cout<<sz(s[0])<<" "<<sz(s[1])<<" "<<sz(s[2])<<'\n';
				if(!s[k].empty() && s[k].begin()->fi > debug.back())add(k);
				merge(j);
				goto jump;
			}
			if(check(k)){
				//cout<<i<<" "<<j<<" "<<k<<'\n';
				//cout<<s[i].begin()->fi<<" "<<s[j].begin()->fi<<" "<<s[k].begin()->fi<<'\n';
				//cout<<sz(s[0])<<" "<<sz(s[1])<<" "<<sz(s[2])<<'\n';
				if(!s[j].empty() && s[j].begin()->fi > debug.back())add(j);
				merge(k);
				goto jump;
			}
			assert(!s[j].empty() && !s[k].empty());
			i = j;
			if(s[j].begin()->fi < s[k].begin()->fi)i = k;
		}
	}
	jump:
	int cur = 0;
	while(!s[cur].empty()){
		//cout<<cur<<" "<<s[cur].begin()->fi<<'\n';
		add(cur);
		cur^=1;
	}
	cur^=1;
	assert(sz(s[cur]) <= 1);
	while(!s[cur].empty())add(cur);
	ans.pb(cen);

	// for(int i=0;i+1<n;i++){
	// 	cout<<debug[i]<<'\n';
	// 	if(i && debug[i-1] + debug[i] < debug[i] + debug[i+1]){
	// 		cout<<debug[i+1]<<'\n';
	// 		break;
	// 	}

	// }
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 108 ms 19924 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 5 ms 1540 KB Output is correct
23 Correct 10 ms 2908 KB Output is correct
24 Correct 14 ms 3676 KB Output is correct
25 Correct 61 ms 11788 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 8 ms 2396 KB Output is correct
15 Correct 112 ms 21120 KB Output is correct
16 Correct 120 ms 21200 KB Output is correct
17 Correct 20 ms 5212 KB Output is correct
18 Correct 49 ms 9884 KB Output is correct
19 Correct 84 ms 16676 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 108 ms 19924 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 2 ms 700 KB Output is correct
47 Correct 3 ms 860 KB Output is correct
48 Correct 5 ms 1540 KB Output is correct
49 Correct 10 ms 2908 KB Output is correct
50 Correct 14 ms 3676 KB Output is correct
51 Correct 61 ms 11788 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 8 ms 2396 KB Output is correct
54 Correct 112 ms 21120 KB Output is correct
55 Correct 120 ms 21200 KB Output is correct
56 Correct 20 ms 5212 KB Output is correct
57 Correct 49 ms 9884 KB Output is correct
58 Correct 84 ms 16676 KB Output is correct
59 Correct 4 ms 1112 KB Output is correct
60 Correct 146 ms 21336 KB Output is correct
61 Correct 167 ms 23612 KB Output is correct
62 Correct 137 ms 21192 KB Output is correct
63 Correct 165 ms 25244 KB Output is correct
64 Correct 158 ms 24984 KB Output is correct
65 Correct 167 ms 24692 KB Output is correct
66 Correct 190 ms 27044 KB Output is correct
67 Correct 177 ms 28460 KB Output is correct
68 Correct 191 ms 27700 KB Output is correct
69 Correct 233 ms 29128 KB Output is correct
70 Correct 128 ms 21272 KB Output is correct
71 Correct 155 ms 25352 KB Output is correct
72 Correct 173 ms 24824 KB Output is correct
73 Correct 177 ms 27908 KB Output is correct
74 Correct 203 ms 27220 KB Output is correct
75 Correct 148 ms 25032 KB Output is correct
76 Correct 178 ms 26344 KB Output is correct
77 Correct 172 ms 29652 KB Output is correct
78 Correct 164 ms 28064 KB Output is correct
79 Correct 203 ms 27028 KB Output is correct
80 Correct 201 ms 27080 KB Output is correct
81 Correct 135 ms 22288 KB Output is correct
82 Correct 150 ms 22548 KB Output is correct
83 Correct 157 ms 22320 KB Output is correct
84 Correct 61 ms 9640 KB Output is correct