-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHLD in Nodes.sublime-snippet
130 lines (127 loc) · 2.55 KB
/
HLD in Nodes.sublime-snippet
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
<snippet>
<content><![CDATA[
class HeavyLight
{
public:
bool lazy = false;
vector<int>parent, depth, heavy, order, root;
segtree ST;
int unite(int a, int b)
{
return a ^ b;
}
int dfs(int curr, int par, int d, vector<vector<int>>&adj)
{
depth[curr] = d;
parent[curr] = par;
int size = 1;
pair<int, int>maxsz = {0, 0};
for (auto it : adj[curr])
{
if (it != par)
{ int sz = dfs(it, curr, d + 1, adj);
size += sz;
maxsz = max(maxsz, make_pair(sz, it));
}
}
if (maxsz.first * 2 > size)
heavy[curr] = maxsz.second;
return size;
}
void dfs(int curr, int par, bool isheavy, int &cnt, vector<vector<int>>&adj)
{
order[curr] = cnt;
cnt++;
if (isheavy)
{
root[curr] = root[parent[curr]];
}
else
{
root[curr] = curr;
}
if (heavy[curr] != -1)
{
dfs(heavy[curr], curr, true, cnt, adj);
}
for (auto it : adj[curr])
{
if (it != par && it != heavy[curr])
{
dfs(it, curr, false, cnt, adj);
}
}
}
template<typename T>
void init(vector<vector<int>>&adj, vector<T>&value)
{
int N = value.size();
order .resize(N);
root .resize(N);
parent.resize(N);
depth .resize(N);
heavy .resize(N, -1);
dfs(0, -1, 0, adj);
int cnt = 0;
dfs(0, -1, false, cnt, adj);
vector<int>A(N);
for (int i = 0; i < N; i++)
{
A[order[i]] = value[i];
}
ST = segtree(A);
}
template<typename T>
HeavyLight(vector<vector<int>>&adj, vector<T>&value)
{
init(adj, value);
}
void processPaths(int l, int r, vector<pair<int, int>>&v)
{
while (l != r && l != -1 && r != -1)
{
if (depth[root[r]] > depth[root[l]])swap(l, r);
if (root[l] == root[r])
{
if (depth[r] > depth[l])
swap(l, r);
v.push_back({order[r], order[l]});
return;
}
v.push_back({order[root[l]], order[l]});
l = parent[root[l]];
}
v.push_back({order[l],order[l]});
}
int get(int l, int r)
{
vector<pair<int, int>>v;
processPaths(l, r, v);
int ans = ST.get(v[0].first, v[0].second).val;
for (int i = 1; i < v.size(); i++) {
ans = unite(ans, ST.get(v[i].first, v[i].second).val);
}
return ans;
}
template<typename M>
void upd(int i, M num)
{
ST.upd(order[i], num);
}
template<typename M>
void upd(int l,int r, M num)
{
vector<pair<int, int>>v;
processPaths(l, r, v);
for(auto it:v)
{
ST.upd(it.first,it.second,num);
}
}
};
]]></content>
<!-- Optional: Set a tabTrigger to define how to trigger the snippet -->
<tabTrigger>HLD on Nodes</tabTrigger>
<!-- Optional: Set a scope to limit where the snippet will trigger -->
<!-- <scope>source.python</scope> -->
</snippet>