oj.uz

Submission #289680

# Submission time Handle Problem Language Result Execution time Memory
289680 2020-09-02T22:36:11 Z b00n0rp Fun Tour (APIO20_fun) C++17
100 / 100
 439 ms 23192 KB 
/*
Soln:
https://apio2020.id/assets/problem_discussion.pdf
*/
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif

const int MAXN = 100005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;


int n;

int sz0[MAXN];
int dep[MAXN];
int dist0[MAXN],dist1[MAXN];
int sub[MAXN];
vi subtreeroots;

vi sub0,sub1,sub2;

bool cmp(int x,int y){
	return dep[x] < dep[y];
}

vi createFunTour(int N, int Q){
	n = N;
	if(n == 2) return {0,1};
	sz0[0] = n;
	int cen = 0;
	FOR(i,1,n){
		sz0[i] = attractionsBehind(0,i);
		if(sz0[i]*2 >= n and sz0[i] < sz0[cen]) cen = i;
	}
	REP(i,n){
		if(i == cen) dep[i] = 0;
		else dep[i] = hoursRequired(cen,i);
		if(dep[i] == 1) subtreeroots.pb(i);
	}
	vi ans,ans1;

	REP(i,n){
		dist0[i] = hoursRequired(i,subtreeroots[0]);
		dist1[i] = hoursRequired(i,subtreeroots[1]);
		if(i != cen){
			if(dep[i] == 1+dist0[i]){
				sub0.pb(i);
				sub[i] = 0;
			}
			else if(dep[i] == 1+dist1[i]){
				sub1.pb(i);
				sub[i] = 1;
			}
			else{
				sub2.pb(i);
				sub[i] = 2;
			}
		}
		else sub[i] = -1;
	}
	sort(all(sub0),cmp);
	sort(all(sub1),cmp);
	sort(all(sub2),cmp);
	int last = -1;

	vi part1,part2;

	FORD(i,n-1,1){
		if(SZ(sub0)*2 >= i){
			for(auto x:sub0){
				part1.pb(x);
			}
			for(auto x:sub1){
				part2.pb(x);
			}
			for(auto x:sub2){
				part2.pb(x);
			}
			sort(all(part1),cmp);
			sort(all(part2),cmp);
			break;
		}
		if(SZ(sub1)*2 >= i){
			for(auto x:sub0){
				part2.pb(x);
			}
			for(auto x:sub1){
				part1.pb(x);
			}
			for(auto x:sub2){
				part2.pb(x);
			}
			sort(all(part1),cmp);
			sort(all(part2),cmp);
			break;
		}
		if(SZ(sub2)*2 >= i){
			for(auto x:sub0){
				part2.pb(x);
			}
			for(auto x:sub1){
				part2.pb(x);
			}
			for(auto x:sub2){
				part1.pb(x);
			}
			sort(all(part1),cmp);
			sort(all(part2),cmp);
			break;
		}
		int cur = cen,sb = -1;
		if(SZ(sub0) and last != 0 and dep[sub0.back()] > dep[cur]){
			cur = sub0.back();
			sb = 0;
		}
		if(SZ(sub1) and last != 1 and dep[sub1.back()] > dep[cur]){
			cur = sub1.back();
			sb = 1;
		}
		if(SZ(sub2) and last != 2 and dep[sub2.back()] > dep[cur]){
			cur = sub2.back();
			sb = 2;
		}

		last = sb;
		ans.pb(cur);
		// trace(cur);
		if(sb == 0) sub0.pop_back();
		if(sb == 1) sub1.pop_back();
		if(sb == 2) sub2.pop_back();
	}
	ans1 = ans;
	if(SZ(part1) > SZ(part2)){
		while(SZ(part1)){
			ans.pb(part1.back());
			part1.pop_back();
			if(SZ(part2)){
				ans.pb(part2.back());
				part2.pop_back();
			}
		}
		ans.pb(cen);
		return ans;
	}

	while(SZ(part1)){
		ans.pb(part1.back());
		ans.pb(part2.back());

		ans1.pb(part2.back());
		ans1.pb(part1.back());

		part1.pop_back();
		part2.pop_back();
	}
	ans.pb(cen);
	ans1.pb(cen);

	vi v,vs;

	REP(i,n){
		if(i){
			if(sub[ans[i]] == sub[ans[i-1]]) return ans1;
			v.pb(dep[ans[i]]+dep[ans[i-1]]);
			vs.pb(dep[ans[i]]+dep[ans[i-1]]);
			// trace(ans[i],sub[i],dep[ans[i]]+dep[ans[i-1]]);
		}
	}
	sort(all(vs));
	reverse(all(v));
	if(v == vs){
		return ans;
	}
	else return ans1;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 158 ms 17776 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 8 ms 1536 KB Output is correct
23 Correct 15 ms 2688 KB Output is correct
24 Correct 20 ms 3536 KB Output is correct
25 Correct 89 ms 10508 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 13 ms 2048 KB Output is correct
15 Correct 173 ms 17648 KB Output is correct
16 Correct 176 ms 17652 KB Output is correct
17 Correct 31 ms 4472 KB Output is correct
18 Correct 74 ms 8384 KB Output is correct
19 Correct 136 ms 13896 KB Output is correct
20 Correct 6 ms 1024 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 158 ms 17776 KB Output is correct
45 Correct 1 ms 512 KB Output is correct
46 Correct 3 ms 640 KB Output is correct
47 Correct 5 ms 768 KB Output is correct
48 Correct 8 ms 1536 KB Output is correct
49 Correct 15 ms 2688 KB Output is correct
50 Correct 20 ms 3536 KB Output is correct
51 Correct 89 ms 10508 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 13 ms 2048 KB Output is correct
54 Correct 173 ms 17648 KB Output is correct
55 Correct 176 ms 17652 KB Output is correct
56 Correct 31 ms 4472 KB Output is correct
57 Correct 74 ms 8384 KB Output is correct
58 Correct 136 ms 13896 KB Output is correct
59 Correct 6 ms 1024 KB Output is correct
60 Correct 249 ms 18556 KB Output is correct
61 Correct 305 ms 20840 KB Output is correct
62 Correct 249 ms 17000 KB Output is correct
63 Correct 321 ms 20976 KB Output is correct
64 Correct 317 ms 20976 KB Output is correct
65 Correct 272 ms 18380 KB Output is correct
66 Correct 338 ms 20848 KB Output is correct
67 Correct 318 ms 22260 KB Output is correct
68 Correct 304 ms 21744 KB Output is correct
69 Correct 426 ms 23192 KB Output is correct
70 Correct 234 ms 17828 KB Output is correct
71 Correct 280 ms 21872 KB Output is correct
72 Correct 375 ms 21104 KB Output is correct
73 Correct 283 ms 21616 KB Output is correct
74 Correct 417 ms 22384 KB Output is correct
75 Correct 250 ms 17132 KB Output is correct
76 Correct 317 ms 20976 KB Output is correct
77 Correct 295 ms 20976 KB Output is correct
78 Correct 320 ms 20300 KB Output is correct
79 Correct 354 ms 21600 KB Output is correct
80 Correct 439 ms 21912 KB Output is correct
81 Correct 330 ms 17820 KB Output is correct
82 Correct 303 ms 17956 KB Output is correct
83 Correct 289 ms 18288 KB Output is correct
84 Correct 93 ms 7888 KB Output is correct