/tmp/solutions/build/vertex_set_path_composite-slow.cpp:
1| |#include <common.h>
2| |#include <toy/bit.h>
3| |prelude;
4| |
5| |namespace {
6| |
7| |constexpr int N = 2e5;
8| |constexpr int P = 998244353;
9| |
10| |struct Node {
11| | u32 a, b, c;
12| 1.38M| auto operator+(const Node &t) const -> Node {
13| 1.38M| u32 x = u64(a) * t.a % P;
14| 1.38M| u32 y = (u64(a) * t.b + b) % P;
15| 1.38M| u32 z = (u64(t.a) * c + t.c) % P;
16| 1.38M| return {x, y, z};
17| 1.38M| }
18| |} node[N * 2];
19| 511k|auto operator+(const Node &l, u32 r) -> u32 { return (u64(l.a) * r + l.b) % P; }
20| 530k|auto operator+(u32 l, const Node &r) -> u32 { return (u64(r.a) * l + r.c) % P; }
21| |u32 a[N];
22| |u32 b[N];
23| |int head[N];
24| |int size[N];
25| |int depth[N];
26| |int heavy[N];
27| |int ances[N];
28| |int parent[N];
29| |int node2id[N];
30| |int id;
31| |struct {
32| | int to;
33| | int next;
34| |} edge[N * 2];
35| |
36| 127k|def build_step_1(int u, int p) -> void {
37| 127k| size[u] = 1;
38| 383k| for (int e = head[u]; e; e = edge[e].next) {
^255k
------------------
| Branch (38:25): [True: 66.67%, False: 33.33%]
------------------
39| 255k| int v = edge[e].to;
40| 255k| if (v != p) {
------------------
| Branch (40:9): [True: 50.00%, False: 50.00%]
------------------
41| 127k| build_step_1(v, u);
42| 127k| size[u] += size[v];
43| 127k| if (heavy[u] == 0 || size[v] > size[heavy[u]]) {
^63.9k
------------------
| Branch (43:11): [True: 49.91%, False: 50.09%]
| Branch (43:28): [True: 46.67%, False: 53.33%]
------------------
44| 93.5k| heavy[u] = v;
45| 93.5k| }
46| 127k| }
47| 255k| }
48| 127k|}
49| |
50| 127k|def build_step_2(int u, int w, int p, int d) -> void {
51| 127k| int i = id++;
52| 127k| node2id[u] = i;
53| 127k| node[i] = {a[u], b[u], b[u]};
54| 127k| depth[i] = d;
55| 127k| ances[i] = node2id[w];
56| 127k| parent[i] = node2id[p];
57| 127k| if (int v = heavy[u]; v) {
------------------
| Branch (57:25): [True: 49.91%, False: 50.09%]
------------------
58| 63.7k| build_step_2(v, w, u, d + 1);
59| 63.7k| }
60| 383k| for (int e = head[u]; e; e = edge[e].next) {
^255k
------------------
| Branch (60:25): [True: 66.67%, False: 33.33%]
------------------
61| 255k| int v = edge[e].to;
62| 255k| if (v != p && v != heavy[u]) {
^127k
------------------
| Branch (62:9): [True: 50.00%, False: 50.00%]
| Branch (62:19): [True: 50.09%, False: 49.91%]
------------------
63| 63.9k| build_step_2(v, v, u, d + 1);
64| 63.9k| }
65| 255k| }
66| 127k|}
67| |
68| |} // namespace
69| |
70| 1|int main() {
71| 1| rd rd;
72| 1| wt wt;
73| 1| int n = rd.uh();
74| 1| int q = rd.uh();
75| 1|#ifdef LOCAL
76| 1| id = 0;
77| 1| std::memset(head, 0, 4 * n);
78| 1| std::memset(heavy, 0, 4 * n);
79| 1|#endif
80| 127k| for (int i = 0; i < n; ++i) a[i] = rd.uw(), b[i] = rd.uw();
^127k^127k
------------------
| Branch (80:19): [True: 100.00%, False: 0.00%]
------------------
81| 127k| for (int i = 1; i < n; ++i) {
^127k
------------------
| Branch (81:19): [True: 100.00%, False: 0.00%]
------------------
82| 127k| int u = rd.uh();
83| 127k| int v = rd.uh();
84| 127k| edge[i * 2 | 0] = {v, head[u]}, head[u] = i * 2 | 0;
85| 127k| edge[i * 2 | 1] = {u, head[v]}, head[v] = i * 2 | 1;
86| 127k| }
87| 1| build_step_1(0, 0);
88| 1| build_step_2(0, 0, 0, 0);
89| 1| std::memcpy(node + n, node, sizeof(Node) * n);
90| 127k| for (int i = n - 1; i > 0; --i) node[i] = node[i * 2] + node[i * 2 + 1];
^127k^127k
------------------
| Branch (90:23): [True: 100.00%, False: 0.00%]
------------------
91| 323k| let apply_1 = [&](int l, int r, u32 x) -> u32 {
^1
92| 323k| l += n - 1;
93| 323k| r += n + 1;
94| 323k| int k = log(l ^ r);
95| 323k| int R = r >> k;
96| 575k| for (r = r >> __builtin_ctz(r) ^ 1; r > R; r = r >> __builtin_ctz(r) ^ 1)
^252k
------------------
| Branch (96:41): [True: 43.81%, False: 56.19%]
------------------
97| 252k| x = node[r] + x;
98| 582k| for (int t = ~l & ~(-1 << k), i; t > 0; t -= 1 << i) {
^259k
------------------
| Branch (98:38): [True: 44.50%, False: 55.50%]
------------------
99| 259k| i = log(t);
100| 259k| x = node[l >> i ^ 1] + x;
101| 259k| }
102| 323k| return x;
103| 323k| };
104| 341k| let apply_2 = [&](int l, int r, u32 x) -> u32 {
^1
105| 341k| l += n - 1;
106| 341k| r += n + 1;
107| 341k| int k = log(l ^ r);
108| 341k| int R = r >> k;
109| 604k| for (l = l >> __builtin_ctz(~l) ^ 1; l > R; l = l >> __builtin_ctz(~l) ^ 1)
^262k
------------------
| Branch (109:42): [True: 43.46%, False: 56.54%]
------------------
110| 262k| x = x + node[l];
111| 609k| for (int t = r & ~(-1 << k), i; t > 0; t -= 1 << i) {
^267k
------------------
| Branch (111:37): [True: 43.92%, False: 56.08%]
------------------
112| 267k| i = log(t);
113| 267k| x = x + node[r >> i ^ 1];
114| 267k| }
115| 341k| return x;
116| 341k| };
117| 148k| while (q--) {
------------------
| Branch (117:10): [True: 100.00%, False: 0.00%]
------------------
118| 148k| let t = rd.u1();
119| 148k| if (t == 0) {
------------------
| Branch (119:9): [True: 49.87%, False: 50.13%]
------------------
120| 74.1k| int k = n + node2id[rd.uh()];
121| 74.1k| u32 c = rd.uw();
122| 74.1k| u32 d = rd.uw();
123| 74.1k| node[k] = {c, d, d};
124| 1.33M| for (k /= 2; k > 0; k /= 2) {
^1.25M
------------------
| Branch (124:20): [True: 94.44%, False: 5.56%]
------------------
125| 1.25M| node[k] = node[k * 2] + node[k * 2 + 1];
126| 1.25M| }
127| 74.1k| }
128| 148k| if (t == 1) {
------------------
| Branch (128:9): [True: 50.13%, False: 49.87%]
------------------
129| 74.5k| int u = node2id[rd.uh()];
130| 74.5k| int v = node2id[rd.uh()];
131| 74.5k| u32 x = rd.uw();
132| 74.5k| std::pair<int, int> vec[20];
133| 74.5k| int c = 0;
134| 665k| while (ances[u] != ances[v]) {
------------------
| Branch (134:14): [True: 88.79%, False: 11.21%]
------------------
135| 590k| if (depth[ances[u]] > depth[ances[v]]) {
------------------
| Branch (135:13): [True: 49.94%, False: 50.06%]
------------------
136| 294k| x = apply_1(ances[u], u, x);
137| 294k| u = parent[ances[u]];
138| 295k| } else {
139| 295k| vec[++c] = {ances[v], v};
140| 295k| v = parent[ances[v]];
141| 295k| }
142| 590k| }
143| 74.5k| if (u > v) {
------------------
| Branch (143:11): [True: 38.18%, False: 61.82%]
------------------
144| 28.4k| x = apply_1(v, u, x);
145| 46.1k| } else {
146| 46.1k| x = apply_2(u, v, x);
147| 46.1k| }
148| 370k| for (; c > 0; --c) {
^295k
------------------
| Branch (148:14): [True: 79.85%, False: 20.15%]
------------------
149| 295k| def[l, r] = vec[c];
150| 295k| x = apply_2(l, r, x);
151| 295k| }
152| 74.5k| wt.uw(x);
153| 74.5k| }
154| 148k| }
155| 1| return 0;
156| 1|}