/tmp/solutions/build/dynamic_tree_vertex_set_path_composite-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |constexpr int N = 200001;
7| |constexpr u32 P = 998244353;
8| |
9| |struct Affine {
10| | u32 a, b, c;
11| 3.61k| auto operator+(const Affine &t) const -> Affine {
12| 3.61k| u32 x = (u64(a) * t.a) % P;
13| 3.61k| u32 y = (u64(a) * t.b + b) % P;
14| 3.61k| u32 z = (u64(t.a) * c + t.c) % P;
15| 3.61k| return {x, y, z};
16| 3.61k| }
17| 146| auto operator+(const u32 &t) const -> u32 { return (u64(a) * t + b) % P; }
18| |};
19| |struct Node {
20| | u32 a;
21| | u32 b;
22| | Affine aff;
23| | int p;
24| | int ch[2];
25| | i8 rev;
26| | i8 k;
27| |} node[N];
28| |
29| 2.20k|def reverse(int x) -> void {
30| 2.20k| node[x].rev ^= 1;
31| 2.20k| std::swap(node[x].aff.b, node[x].aff.c);
32| 2.20k|}
33| |
34| 2.99k|def pushdown(int x) -> void {
35| 2.99k| if (node[x].rev) {
------------------
| Branch (35:7): [True: 32.67%, False: 67.33%]
------------------
36| 979| std::swap(node[x].ch[0], node[x].ch[1]);
37| 979| node[node[x].ch[0]].k = 0;
38| 979| node[node[x].ch[1]].k = 1;
39| 979| reverse(node[x].ch[0]);
40| 979| reverse(node[x].ch[1]);
41| 979| node[x].rev = 0;
42| 979| }
43| 2.99k|}
44| |
45| 1.80k|def maintain(int x) -> void {
46| 1.80k| node[x].aff = node[node[x].ch[0]].aff +
47| 1.80k| Affine{node[x].a, node[x].b, node[x].b} +
48| 1.80k| node[node[x].ch[1]].aff;
49| 1.80k|}
50| |
51| 1.80k|def rotateup(int x) -> void {
52| 1.80k| int p = node[x].p;
53| 1.80k| int g = node[p].p;
54| 1.80k| int k = node[x].k;
55| 1.80k| int t = node[p].k;
56| 1.80k| node[node[x].ch[k ^ 1]].p = p;
57| 1.80k| node[node[x].ch[k ^ 1]].k = k;
58| 1.80k| node[p].ch[k] = node[x].ch[k ^ 1];
59| 1.80k| node[p].p = x;
60| 1.80k| node[p].k = k ^ 1;
61| 1.80k| node[x].ch[k ^ 1] = p;
62| 1.80k| node[x].p = g;
63| 1.80k| node[x].k = t;
64| 1.80k| if (t != -1) {
------------------
| Branch (64:7): [True: 21.07%, False: 78.93%]
------------------
65| 381| node[g].ch[t] = x;
66| 381| }
67| 1.80k| maintain(p);
68| 1.80k|}
69| |
70| 2.69k|def is_root(int x) -> bool { return node[x].k == -1; }
71| |
72| 1.27k|def splay(int x) -> void {
73| 1.27k| pushdown(x);
74| 1.98k| while (!is_root(x)) {
------------------
| Branch (74:10): [True: 35.87%, False: 64.13%]
------------------
75| 711| if (int p = node[x].p; is_root(p)) {
------------------
| Branch (75:28): [True: 57.24%, False: 42.76%]
------------------
76| 407| pushdown(p);
77| 407| pushdown(x);
78| 407| rotateup(x);
79| 407| } else {
80| 304| int g = node[p].p;
81| 304| pushdown(g);
82| 304| pushdown(p);
83| 304| pushdown(x);
84| 304| if (node[x].k == node[p].k) {
------------------
| Branch (84:11): [True: 35.20%, False: 64.80%]
------------------
85| 107| rotateup(p);
86| 107| rotateup(x);
87| 197| } else {
88| 197| rotateup(x);
89| 197| rotateup(x);
90| 197| }
91| 304| }
92| 711| }
93| 1.27k|}
94| |
95| 401|def access(int x) -> void {
96| 401| splay(x);
97| 401| node[node[x].ch[1]].k = -1;
98| 401| node[x].ch[1] = 0;
99| 1.19k| while (int p = node[x].p) {
------------------
| Branch (99:14): [True: 66.42%, False: 33.58%]
------------------
100| 793| splay(p);
101| 793| node[node[p].ch[1]].k = -1;
102| 793| node[p].ch[1] = x;
103| 793| node[x].k = 1;
104| 793| rotateup(x);
105| 793| }
106| 401|}
107| |
108| |int head[N];
109| |struct {
110| | int to;
111| | int next;
112| |} edge[N * 2];
113| |
114| 198|def build(int u, int p) -> void {
115| 592| for (int e = head[u]; e; e = edge[e].next) {
^394
------------------
| Branch (115:25): [True: 66.55%, False: 33.45%]
------------------
116| 394| int v = edge[e].to;
117| 394| if (v != p) {
------------------
| Branch (117:9): [True: 50.00%, False: 50.00%]
------------------
118| 197| build(v, u);
119| 197| node[v + 1].p = u + 1;
120| 197| }
121| 394| }
122| 198|}
123| |
124| |} // namespace
125| |
126| 1|int main() {
127| 1| node[0].aff.a = 1;
128| 1| rd rd;
129| 1| wt wt;
130| 1| int n = rd.uh();
131| 1| int q = rd.uh();
132| 1|#ifdef LOCAL
133| 1| std::memset(head, 0, 4 * n);
134| 1|#endif
135| 199| for (int i = 1; i <= n; ++i) {
^198
------------------
| Branch (135:19): [True: 99.50%, False: 0.50%]
------------------
136| 198| node[i] = {.k = -1};
137| 198| u32 a = node[i].a = rd.uw();
138| 198| u32 b = node[i].b = rd.uw();
139| 198| node[i].aff = {a, b, b};
140| 198| }
141| 198| for (int i = 1; i != n; ++i) {
^197
------------------
| Branch (141:19): [True: 99.49%, False: 0.51%]
------------------
142| 197| int u = rd.uh();
143| 197| int v = rd.uh();
144| 197| edge[i * 2 | 0] = {v, head[u]}, head[u] = i * 2 | 0;
145| 197| edge[i * 2 | 1] = {u, head[v]}, head[v] = i * 2 | 1;
146| 197| }
147| 1| build(0, 0);
148| 236| while (q--) {
------------------
| Branch (148:10): [True: 99.58%, False: 0.42%]
------------------
149| 235| let t = rd.u1();
150| 235| if (t == 0) {
------------------
| Branch (150:9): [True: 36.17%, False: 63.83%]
------------------
151| 85| int u = rd.uh() + 1;
152| 85| int v = rd.uh() + 1;
153| 85| access(u);
154| 85| reverse(u);
155| 85| access(v);
156| 85| node[node[v].ch[0]].p = 0;
157| 85| node[node[v].ch[0]].k = -1;
158| 85| node[v].ch[0] = 0;
159| 85| int w = rd.uh() + 1;
160| 85| int x = rd.uh() + 1;
161| 85| access(w);
162| 85| reverse(w);
163| 85| node[w].p = x;
164| 85| }
165| 235| if (t == 1) {
------------------
| Branch (165:9): [True: 32.77%, False: 67.23%]
------------------
166| 77| int u = rd.uh() + 1;
167| 77| node[u].a = rd.uw();
168| 77| node[u].b = rd.uw();
169| 77| splay(u);
170| 77| }
171| 235| if (t == 2) {
------------------
| Branch (171:9): [True: 31.06%, False: 68.94%]
------------------
172| 73| int u = rd.uh() + 1;
173| 73| int v = rd.uh() + 1;
174| 73| u32 x = rd.uw();
175| 73| access(v);
176| 73| reverse(v);
177| 73| access(u);
178| 73| x = Affine{node[u].a, node[u].b, node[u].b} + x;
179| 73| x = node[node[u].ch[0]].aff + x;
180| 73| wt.ud(x);
181| 73| }
182| 235| }
183| 1| return 0;
184| 1|}