/tmp/solutions/build/unionfind-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |int pa[200000];
7| |
8| 4.89M|def find(int u) -> int {
9| 4.89M| int w = pa[u], v;
10| 4.89M| if (w < 0) return u;
^2.76M
------------------
| Branch (10:7): [True: 56.53%, False: 43.47%]
------------------
11| 2.43M| while (pa[w] >= 0) w = pa[w];
^2.12M ^311k
------------------
| Branch (11:10): [True: 12.75%, False: 87.25%]
------------------
12| 2.43M| while (pa[u] != w) v = u, u = pa[u], pa[v] = w;
^311k
------------------
| Branch (12:10): [True: 12.75%, False: 87.25%]
------------------
13| 2.12M| return w;
14| 4.89M|};
15| |
16| |} // namespace
17| |
18| 18|int main() {
19| 18| rd rd;
20| 18| wt wt;
21| 18| int n = rd.uh();
22| 18| int q = rd.uh();
23| 18| std::memset(pa, -1, 4 * n);
24| 2.44M| while (q--) {
------------------
| Branch (24:10): [True: 100.00%, False: 0.00%]
------------------
25| 2.44M| let t = rd.u1();
26| 2.44M| let u = find(rd.uh());
27| 2.44M| let v = find(rd.uh());
28| 2.44M| if (t == 0 && u != v) {
^1.49M
------------------
| Branch (28:9): [True: 60.91%, False: 39.09%]
| Branch (28:19): [True: 89.46%, False: 10.54%]
------------------
29| 1.33M| if (pa[u] < pa[v])
------------------
| Branch (29:11): [True: 38.87%, False: 61.13%]
------------------
30| 518k| pa[v] = u;
31| 815k| else if (pa[v] < pa[u])
------------------
| Branch (31:16): [True: 63.61%, False: 36.39%]
------------------
32| 518k| pa[u] = v;
33| 296k| else
34| 296k| pa[u] = v, --pa[v];
35| 1.33M| }
36| 2.44M| if (t == 1) {
------------------
| Branch (36:9): [True: 39.09%, False: 60.91%]
------------------
37| 956k| wt.u1(u == v);
38| 956k| }
39| 2.44M| }
40| 18| return 0;
41| 18|}