/tmp/solutions/build/unionfind-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |int pa[200000];
7| |
8| 391k|def find(int u) -> int {
9| 391k| int w = pa[u], v;
10| 391k| if (w < 0) return u;
^217k
------------------
| Branch (10:7): [True: 55.69%, False: 44.31%]
------------------
11| 229k| while (pa[w] >= 0) w = pa[w];
^173k ^56.3k
------------------
| Branch (11:10): [True: 24.53%, False: 75.47%]
------------------
12| 229k| while (pa[u] != w) v = u, u = pa[u], pa[v] = w;
^56.3k
------------------
| Branch (12:10): [True: 24.53%, False: 75.47%]
------------------
13| 173k| return w;
14| 391k|};
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| 195k| while (q--) {
------------------
| Branch (24:10): [True: 100.00%, False: 0.00%]
------------------
25| 195k| let t = rd.u1();
26| 195k| let u = find(rd.uh());
27| 195k| let v = find(rd.uh());
28| 195k| if (t == 0 && u != v) {
^97.6k
------------------
| Branch (28:9): [True: 49.92%, False: 50.08%]
| Branch (28:19): [True: 87.77%, False: 12.23%]
------------------
29| 85.6k| if (pa[u] < pa[v])
------------------
| Branch (29:11): [True: 31.02%, False: 68.98%]
------------------
30| 26.5k| pa[v] = u;
31| 59.1k| else if (pa[v] < pa[u])
------------------
| Branch (31:16): [True: 45.12%, False: 54.88%]
------------------
32| 26.6k| pa[u] = v;
33| 32.4k| else
34| 32.4k| pa[u] = v, --pa[v];
35| 85.6k| }
36| 195k| if (t == 1) {
------------------
| Branch (36:9): [True: 50.08%, False: 49.92%]
------------------
37| 97.9k| wt.u1(u == v);
38| 97.9k| }
39| 195k| }
40| 1| return 0;
41| 1|}