| rank | solved | A | B | C | D | E | F | G | H | I | J |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 45 | 3 | O | O | Ø | . | O | . | Ø | . | . | . |
A
Solved by XLor (00:06:58).
一定会连接根到某个叶子。
B
Solved by ytriayggg (03:18:12, +9).
C
UpSolved by miaojie (+8).
威佐夫博弈。
E
Solved by XLor (02:45:45, +4).
树边的贡献容易计算。
换边贡献只需要维护一次方和二次方等前缀和，也可以线性计算。
G
UpSolved by XLor (+3).
Treap 维护区间平移。
注意 pushup 的细节。