oj.uz

Submission #836575

# Submission time Handle Problem Language Result Execution time Memory
836575 2023-08-24T13:01:44 Z penguinman Split the Attractions (IOI19_split) C++17
100 / 100
 91 ms 20408 KB 
#include "split.h"
#include <bits/stdc++.h>

#ifndef EVAL
#include "grader.cpp"
#endif

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define mp std::make_pair
#define mtp std::make_tuple

constexpr ll inf = (1ll<<60);

struct union_find{
	ll N;
	vi par, sz;
	union_find(int n): N(n){
		par.resize(N);
        sz.resize(N,1);
		rep(i,0,N) par[i] = i;
	}
	ll root(ll now){
		if(par[now] == now) return now;
		return par[now] = root(par[now]);
	}
	bool same(ll l, ll r){
		return root(l) == root(r);
	}
	void merge(ll l, ll r){
		l = root(l);
		r = root(r);
		if(l == r) return;
		par[l] = r;
        sz[r] += sz[l];
        sz[l] = 0;
	}
    ll size(ll now){
        now = root(now);
        return sz[now];
    }
};

std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q) {
	ll N = n;

	vector<pii> data = {mp(a,1), mp(b,2), mp(c,3)};
	sort(all(data));

	vii edge(N);
	union_find tree(N);
    vi u, v;
	rep(i,0,p.size()){
		if(tree.same(p[i], q[i])){
            u.pb(p[i]);
            v.pb(q[i]);
            continue;
        }
		tree.merge(p[i], q[i]);
		edge[p[i]].pb(q[i]);
		edge[q[i]].pb(p[i]);
	}

	vector<int> ans(N, data[2].second);

	auto modify_all = [&](){
		rep(i,0,2){
			rep(j,0,N){
				if(ans[j] == data[i].second){
					vector<bool> visited(N);
					ll cnt = 0;
					std::function<void(ll)> modify = [&](ll now){
						if(cnt < data[i].first){
							cnt++;
						}
						else{
							ans[now] = data[2].second;
						}
						visited[now] = true;
						for(auto next: edge[now]){
							if(visited[next]) continue;
							if(ans[next] != data[i].second) continue;
							modify(next);
						}
					};
					modify(j);
					break;
				}
			}
		}
		return;
	};

	vi subtree(N);

	std::function<void(ll)> dfs_subtree = [&](ll now){
		subtree[now] = 1;
		for(auto next: edge[now]){
			if(subtree[next]) continue;
			dfs_subtree(next);
			subtree[now] += subtree[next];
		}
	};

	dfs_subtree(0);

	std::function<void(ll, ll)> dfs_coloring = [&](ll now, ll color){
		ans[now] = color;
		for(auto next: edge[now]){
			if(subtree[next] > subtree[now]) continue;
			dfs_coloring(next, color);
		}
	};

	rep(i,0,N){
		if(subtree[i] < data[0].first) continue;
		if(N-subtree[i] < data[1].first) continue;
		ans.assign(N,data[1].second);
		dfs_coloring(i, data[0].second);
		modify_all();
		return ans;
	}

	rep(i,0,N){
		if(subtree[i] < data[1].first) continue;
		if(N-subtree[i] < data[0].first) continue;
		ans.assign(N, data[0].second);
		dfs_coloring(i, data[1].second);
		modify_all();
		return ans;
	}

    rep(i,0,N){
        bool flag = true;
        for(auto next: edge[i]){
            if(subtree[next] > subtree[i]) continue;
            if(subtree[next]*2 > N) flag = false;
        }
        if((N-subtree[i])*2 > N) flag = false;
        if(!flag) continue;
        // centroid
        union_find tree2(N);
        rep(j,0,N){
            for(auto next: edge[j]){
                if(j == i) continue;
                if(next == i) continue;
                tree2.merge(j,next);
            }
        }
        rep(j,0,u.size()){
            if(u[j] == i) continue;
            if(v[j] == i) continue;
            tree2.merge(u[j], v[j]);
            if(tree2.size(u[j]) >= data[0].first && N-tree2.size(u[j]) >= data[1].first){
                //assert(N-tree2.size(u[j]) >= data[1].first);
                rep(k,0,u.size()){
                    edge[u[k]].pb(v[k]);
                    edge[v[k]].pb(u[k]);
                }
                rep(k,0,N){
                    if(tree2.same(u[j], k)) ans[k] = data[0].second;
                    else ans[k] = data[1].second;
                }
                modify_all();
                return ans;
            }
            if(tree2.size(u[j]) >= data[1].first && N-tree2.size(u[j]) >= data[0].first){
                //assert(N-tree2.size(u[j]) >= data[1].first);
                rep(k,0,u.size()){
                    edge[u[k]].pb(v[k]);
                    edge[v[k]].pb(u[k]);
                }
                rep(k,0,N){
                    if(tree2.same(u[j], k)) ans[k] = data[1].second;
                    else ans[k] = data[0].second;
                }
                modify_all();
                return ans;
            }
        }
    }

	ans.assign(N,0);
	return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 55 ms 17476 KB ok, correct split
8 Correct 52 ms 15276 KB ok, correct split
9 Correct 49 ms 14528 KB ok, correct split
10 Correct 54 ms 17524 KB ok, correct split
11 Correct 57 ms 16356 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 58 ms 12212 KB ok, correct split
5 Correct 49 ms 10648 KB ok, correct split
6 Correct 52 ms 17624 KB ok, correct split
7 Correct 64 ms 15044 KB ok, correct split
8 Correct 66 ms 13468 KB ok, correct split
9 Correct 47 ms 10196 KB ok, correct split
10 Correct 35 ms 10816 KB ok, correct split
11 Correct 34 ms 10764 KB ok, correct split
12 Correct 35 ms 10820 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 53 ms 10712 KB ok, correct split
3 Correct 19 ms 4392 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 54 ms 12868 KB ok, correct split
6 Correct 50 ms 12848 KB ok, correct split
7 Correct 53 ms 12220 KB ok, correct split
8 Correct 50 ms 13568 KB ok, correct split
9 Correct 69 ms 12096 KB ok, correct split
10 Correct 17 ms 4308 KB ok, no valid answer
11 Correct 25 ms 6264 KB ok, no valid answer
12 Correct 44 ms 12352 KB ok, no valid answer
13 Correct 51 ms 12164 KB ok, no valid answer
14 Correct 40 ms 12376 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, no valid answer
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 1 ms 212 KB ok, correct split
8 Correct 0 ms 212 KB ok, correct split
9 Correct 2 ms 596 KB ok, correct split
10 Correct 2 ms 596 KB ok, correct split
11 Correct 0 ms 212 KB ok, correct split
12 Correct 2 ms 724 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 0 ms 212 KB ok, correct split
16 Correct 1 ms 212 KB ok, correct split
17 Correct 1 ms 212 KB ok, correct split
18 Correct 0 ms 212 KB ok, correct split
19 Correct 1 ms 340 KB ok, correct split
20 Correct 1 ms 340 KB ok, correct split
21 Correct 1 ms 500 KB ok, correct split
22 Correct 2 ms 468 KB ok, correct split
23 Correct 1 ms 596 KB ok, correct split
24 Correct 1 ms 596 KB ok, correct split
25 Correct 1 ms 596 KB ok, correct split
26 Correct 2 ms 596 KB ok, correct split
27 Correct 2 ms 596 KB ok, correct split
28 Correct 2 ms 596 KB ok, correct split
29 Correct 1 ms 340 KB ok, correct split
30 Correct 2 ms 596 KB ok, correct split
31 Correct 1 ms 340 KB ok, correct split
32 Correct 0 ms 212 KB ok, correct split
33 Correct 1 ms 340 KB ok, correct split
34 Correct 1 ms 468 KB ok, correct split
35 Correct 1 ms 468 KB ok, correct split
36 Correct 1 ms 468 KB ok, correct split
37 Correct 2 ms 724 KB ok, correct split
38 Correct 2 ms 724 KB ok, correct split
39 Correct 2 ms 724 KB ok, correct split
40 Correct 2 ms 724 KB ok, correct split
41 Correct 1 ms 468 KB ok, correct split
42 Correct 1 ms 468 KB ok, correct split
43 Correct 2 ms 596 KB ok, correct split
44 Correct 2 ms 596 KB ok, correct split
45 Correct 2 ms 596 KB ok, correct split
46 Correct 1 ms 596 KB ok, correct split
47 Correct 1 ms 596 KB ok, no valid answer
48 Correct 1 ms 468 KB ok, correct split
49 Correct 1 ms 596 KB ok, correct split
50 Correct 0 ms 212 KB ok, no valid answer
51 Correct 0 ms 212 KB ok, no valid answer
52 Correct 1 ms 468 KB ok, no valid answer
53 Correct 2 ms 596 KB ok, no valid answer
54 Correct 1 ms 596 KB ok, no valid answer
55 Correct 2 ms 596 KB ok, no valid answer
56 Correct 1 ms 596 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 55 ms 17476 KB ok, correct split
8 Correct 52 ms 15276 KB ok, correct split
9 Correct 49 ms 14528 KB ok, correct split
10 Correct 54 ms 17524 KB ok, correct split
11 Correct 57 ms 16356 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 58 ms 12212 KB ok, correct split
16 Correct 49 ms 10648 KB ok, correct split
17 Correct 52 ms 17624 KB ok, correct split
18 Correct 64 ms 15044 KB ok, correct split
19 Correct 66 ms 13468 KB ok, correct split
20 Correct 47 ms 10196 KB ok, correct split
21 Correct 35 ms 10816 KB ok, correct split
22 Correct 34 ms 10764 KB ok, correct split
23 Correct 35 ms 10820 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 53 ms 10712 KB ok, correct split
26 Correct 19 ms 4392 KB ok, correct split
27 Correct 1 ms 212 KB ok, correct split
28 Correct 54 ms 12868 KB ok, correct split
29 Correct 50 ms 12848 KB ok, correct split
30 Correct 53 ms 12220 KB ok, correct split
31 Correct 50 ms 13568 KB ok, correct split
32 Correct 69 ms 12096 KB ok, correct split
33 Correct 17 ms 4308 KB ok, no valid answer
34 Correct 25 ms 6264 KB ok, no valid answer
35 Correct 44 ms 12352 KB ok, no valid answer
36 Correct 51 ms 12164 KB ok, no valid answer
37 Correct 40 ms 12376 KB ok, no valid answer
38 Correct 0 ms 212 KB ok, correct split
39 Correct 0 ms 212 KB ok, no valid answer
40 Correct 0 ms 212 KB ok, correct split
41 Correct 0 ms 212 KB ok, correct split
42 Correct 0 ms 212 KB ok, correct split
43 Correct 0 ms 212 KB ok, correct split
44 Correct 1 ms 212 KB ok, correct split
45 Correct 0 ms 212 KB ok, correct split
46 Correct 2 ms 596 KB ok, correct split
47 Correct 2 ms 596 KB ok, correct split
48 Correct 0 ms 212 KB ok, correct split
49 Correct 2 ms 724 KB ok, correct split
50 Correct 0 ms 212 KB ok, correct split
51 Correct 0 ms 212 KB ok, correct split
52 Correct 0 ms 212 KB ok, correct split
53 Correct 1 ms 212 KB ok, correct split
54 Correct 1 ms 212 KB ok, correct split
55 Correct 0 ms 212 KB ok, correct split
56 Correct 1 ms 340 KB ok, correct split
57 Correct 1 ms 340 KB ok, correct split
58 Correct 1 ms 500 KB ok, correct split
59 Correct 2 ms 468 KB ok, correct split
60 Correct 1 ms 596 KB ok, correct split
61 Correct 1 ms 596 KB ok, correct split
62 Correct 1 ms 596 KB ok, correct split
63 Correct 2 ms 596 KB ok, correct split
64 Correct 2 ms 596 KB ok, correct split
65 Correct 2 ms 596 KB ok, correct split
66 Correct 1 ms 340 KB ok, correct split
67 Correct 2 ms 596 KB ok, correct split
68 Correct 1 ms 340 KB ok, correct split
69 Correct 0 ms 212 KB ok, correct split
70 Correct 1 ms 340 KB ok, correct split
71 Correct 1 ms 468 KB ok, correct split
72 Correct 1 ms 468 KB ok, correct split
73 Correct 1 ms 468 KB ok, correct split
74 Correct 2 ms 724 KB ok, correct split
75 Correct 2 ms 724 KB ok, correct split
76 Correct 2 ms 724 KB ok, correct split
77 Correct 2 ms 724 KB ok, correct split
78 Correct 1 ms 468 KB ok, correct split
79 Correct 1 ms 468 KB ok, correct split
80 Correct 2 ms 596 KB ok, correct split
81 Correct 2 ms 596 KB ok, correct split
82 Correct 2 ms 596 KB ok, correct split
83 Correct 1 ms 596 KB ok, correct split
84 Correct 1 ms 596 KB ok, no valid answer
85 Correct 1 ms 468 KB ok, correct split
86 Correct 1 ms 596 KB ok, correct split
87 Correct 0 ms 212 KB ok, no valid answer
88 Correct 0 ms 212 KB ok, no valid answer
89 Correct 1 ms 468 KB ok, no valid answer
90 Correct 2 ms 596 KB ok, no valid answer
91 Correct 1 ms 596 KB ok, no valid answer
92 Correct 2 ms 596 KB ok, no valid answer
93 Correct 1 ms 596 KB ok, no valid answer
94 Correct 55 ms 12580 KB ok, correct split
95 Correct 90 ms 16180 KB ok, correct split
96 Correct 84 ms 19900 KB ok, correct split
97 Correct 18 ms 4820 KB ok, correct split
98 Correct 20 ms 5100 KB ok, correct split
99 Correct 27 ms 6776 KB ok, correct split
100 Correct 68 ms 16012 KB ok, correct split
101 Correct 69 ms 14688 KB ok, correct split
102 Correct 81 ms 17644 KB ok, correct split
103 Correct 67 ms 16880 KB ok, correct split
104 Correct 59 ms 16292 KB ok, correct split
105 Correct 33 ms 7368 KB ok, correct split
106 Correct 58 ms 16156 KB ok, correct split
107 Correct 50 ms 11852 KB ok, correct split
108 Correct 50 ms 11820 KB ok, correct split
109 Correct 72 ms 15612 KB ok, correct split
110 Correct 88 ms 20256 KB ok, correct split
111 Correct 89 ms 20408 KB ok, correct split
112 Correct 86 ms 19856 KB ok, correct split
113 Correct 91 ms 19780 KB ok, correct split
114 Correct 9 ms 2492 KB ok, correct split
115 Correct 8 ms 2260 KB ok, correct split
116 Correct 66 ms 16288 KB ok, correct split
117 Correct 64 ms 16144 KB ok, correct split
118 Correct 53 ms 11256 KB ok, correct split
119 Correct 68 ms 12896 KB ok, correct split
120 Correct 56 ms 16040 KB ok, correct split
121 Correct 52 ms 13388 KB ok, no valid answer
122 Correct 51 ms 13352 KB ok, no valid answer
123 Correct 75 ms 17588 KB ok, no valid answer
124 Correct 75 ms 17576 KB ok, no valid answer
125 Correct 49 ms 14728 KB ok, no valid answer
126 Correct 34 ms 12376 KB ok, no valid answer
127 Correct 70 ms 15464 KB ok, no valid answer