众所周知, 题解做法是 $O(n^3/w)$ 的,跑的又慢又难写,已经被击败了!
现在流行二分, 我们直接二分, 然后把暴力判定套个 bitset, 复杂度 $O(n^3 \log n / w)$, 发现 0.1s 就通过了! 实在是再强没有二分强.
你学会了吗?
rerun's blog
Blogs
GP of IMO D题的高超做法
2021-09-27 20:25:48 By
rerun
Comments
No comments yet.
Post a comment
You can refer to mike by using "@mike", and "mike" will be highlighted. If you want to type the character "@", please use "@@" instead.
You can enter "/kel" to use the emoticon "kel".