CF Round 906 (Div. 1)

CF Round 906 (Div. 1)

C. Doremy's Drying Plan (√2000 / *2600)

Easy ver.

可以得出只有被覆盖 1 / 2 次的才能被消除。

覆盖一次枚举线段，覆盖两次枚举点。

Hard ver.

D. Game of Stacks (*3000)

E. Doremy's Swapping Trees (*3500)

F. Doremy's Average Tree (*3500)

本栏目推荐文章
• CF414B - Mashmokh and ACM
• NSSCTF Round#16 Basic WriteUp
• CF-613-D
• CF1201C - Maximum Median
• CF1876D Lexichromatography
• AT_cf17_final_j 题解
• CF1900E 题解
• CF1896E 题解
• CF713D 题解
• CF1900E 题解

Round 906 Div CFround 906 div cf codeforces round 906 div round日志906 cf div2 906 div cf codeforces cf-div round 870 round 916 div cf round 881 div cf party 906c cf codeforces round 906 a-e codeforces round 1889 906