rank | solved | A | B | C | D | E | F | G | H | I | J | K | L | M |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5 | 11 | O | O | . | O | . | O | O | O | O | O | O | O | O |
A
Solved by Henry.
并查集。
B
Solved by Henry.
签到。
D
Solved by XLor.
注意到一个结论,可以每次贪心的选取贡献最大的点。线段树维护一下每个点的删除贡献即可。
F
Solved by XLor.
二分答案 + 矩形面积并。
G
Solved by Henry.
对答案取 $\log$,转化成加法后,跑二分图最大权匹配,注意 KM 需要 BFS。
H
Solved by Forsaken.
签到。
I
Solved by XLor.
离线询问 + floyd。
J
Solved by Forsaken.
模拟。
K
Solved by Forsaken.
线性递推,暴力出小的答案。
L
Solved by Forsaken.
M
Solved by XLor.
二分答案。