| rank | solved | A | B | C | D | E | F | G | H | I | J | K |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 62 | 7 | O | Ø | O | O | . | . | . | . | O | O | O |
A
Solved by XLor.
关键点直径除二上取整。
B
UpSolved by Forsaken and Henry.
线性基求交。
C
Solved by Henry, Forsaken and XLor.
南昌网络赛原题，有点卡常。
正解是建笛卡尔树，时空复杂度均为 $O(n)$。
D
Solved by Henry.
构造题。
E
UnSolved by Henry.
I
Solved by Henry and XLor.
对原串和反串建 sam，得到本质不同子串数，加上本质不同回文串数，除二即为答案。
考虑每个本质不同子串，在正串和反串各出现一次，除了本质不同回文串。
J
Solved by Henry.
分层最短路。
K
Solved by Forsaken.
签到。