省流：leo又双叒叕被卡常了

In English:On 14:50,After 47 minutes' thinking,writting and debuging,leo submit his code as soon as he passed the example test.But,he found that his code got 95 pts in the real test,and the task he didn't pass returned 'Time Limit Exceeded' A~G~A~I~N......(Apparently,leo ensures that the time complexity is correct.)

又要卡常了.......

代码在这里

话说回来，我的常数理论上来说不大啊

关于昨天的T2,我 $O(n^3 \times log n)$ T了

提交前美好的幻想

• 显然，对于 $n\le 300$ 而言，$O(n^3\times\log(n))$ 只要两秒。

• 只要随便来个 $\frac{}{2}$ 常数就能过题啊！

提交后骨感的现实

• woc 30pts是个什么唐诗东西？？？

• 我自带 inf 倍常数是吧.....

救救孩子......

随手捞一把，快沉了

As an $O(n)$ code,this one is worse than most $O(n log n)$ code, even becoming the worst solution and being killed by 10 times the best solution.As it ran so slowly,I wasn't sure if I could pass it.Can someone tell me why and help me reduce the constant???

我的常数最多只有当 $2 \nmid n$ 时再次计算的2......

但是将最优解10倍杀了......

有人可以帮我解释一下原因||卡常吗？？？

code