| rank | solved | A | B | C | D | E | F | G | H | I | J | K |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 37 | 8 | O | O | ! | ! | O | O | O | O | O | O | . |
A
Solved by XLor (01:06:12).
枚举长度，每个点的贡献分为前后缀的阶梯和中间相同。
B
Solved by miaojie (00:50:47, +1).
C
UnSolved by miaojie (-1).
D
UnSolved by XLor (-7).
E
Solved by ytriayggg (03:09:21, +1).
注意到答案不会特别长，区间 DP 即可。
F
Solved by XLor (01:13:06, +2).
边权是 $2^i$，因此如果前面的边已经使得两个点相连，那么后面的边一定没用，也就是按顺序扣出一堆生成树即可。
G
Solved by ytriayggg (00:55:39).
H
Solved by ytriayggg (01:53:00).
I
Solved by miaojie (00:20:16).
判断 $b \bmod x$ 是否为 $1$。
J
Solved by XLor (02:12:30, +3).
拆位算贡献，使用基尔霍夫矩阵数生成树。