/tmp/solutions/build/unionfind-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |int pa[200000];
7| |
8| 297k|def find(int u) -> int {
9| 297k| int w = pa[u], v;
10| 297k| if (w < 0) return u;
^210k
------------------
| Branch (10:7): [True: 70.74%, False: 29.26%]
------------------
11| 108k| while (pa[w] >= 0) w = pa[w];
^87.0k ^21.3k
------------------
| Branch (11:10): [True: 19.70%, False: 80.30%]
------------------
12| 108k| while (pa[u] != w) v = u, u = pa[u], pa[v] = w;
^21.3k
------------------
| Branch (12:10): [True: 19.70%, False: 80.30%]
------------------
13| 87.0k| return w;
14| 297k|};
15| |
16| |} // namespace
17| |
18| 1|int main() {
19| 1| rd rd;
20| 1| wt wt;
21| 1| int n = rd.uh();
22| 1| int q = rd.uh();
23| 1| std::memset(pa, -1, 4 * n);
24| 148k| while (q--) {
------------------
| Branch (24:10): [True: 100.00%, False: 0.00%]
------------------
25| 148k| let t = rd.u1();
26| 148k| let u = find(rd.uh());
27| 148k| let v = find(rd.uh());
28| 148k| if (t == 0 && u != v) {
^74.1k
------------------
| Branch (28:9): [True: 49.84%, False: 50.16%]
| Branch (28:19): [True: 99.63%, False: 0.37%]
------------------
29| 73.8k| if (pa[u] < pa[v])
------------------
| Branch (29:11): [True: 26.03%, False: 73.97%]
------------------
30| 19.2k| pa[v] = u;
31| 54.6k| else if (pa[v] < pa[u])
------------------
| Branch (31:16): [True: 34.94%, False: 65.06%]
------------------
32| 19.0k| pa[u] = v;
33| 35.5k| else
34| 35.5k| pa[u] = v, --pa[v];
35| 73.8k| }
36| 148k| if (t == 1) {
------------------
| Branch (36:9): [True: 50.16%, False: 49.84%]
------------------
37| 74.6k| wt.u1(u == v);
38| 74.6k| }
39| 148k| }
40| 1| return 0;
41| 1|}