https://www.luogu.com.cn/article/jnqj1iqn @k,火魂
https://www.luogu.com.cn/article/72sy1zcd @[greenty](/user/24071)
https://www.luogu.com.cn/article/v4jwmj2w @大菜鸡fks
https://www.luogu.com.cn/article/8jkww21h @[aiyougege](/user/39067)
https://www.luogu.com.cn/article/7y6n3bp1 @zzw4257
https://www.luogu.com.cn/article/3xnge1rj @[Nekroz](/user/12472)
https://www.luogu.com.cn/article/j82qo99p @[LightningUZ](/user/106252)
https://www.luogu.com.cn/article/shea3gkg @ziiidan
https://www.luogu.com.cn/article/24s7zuvl @[__stdcall](/user/8212)
by ppip @ 2024-04-17 21:24:41
hack 数据的生成器(一条链):
```py
n,k=2000,2000
print(n,k)
for i in range(2,n+1):
print(i-1,i,1)
```
by ppip @ 2024-04-17 21:26:35
答案呢
by A_zjzj @ 2024-04-17 21:33:17
1333333000
by ppip @ 2024-04-17 21:33:51
@[installb](/user/31440)
by Bingxiu @ 2024-04-17 21:57:23
https://www.luogu.com.cn/article/mv2mqmz8 @[asuldb](/user/35178) 代码也有相同的问题,只需要将上面 hack 中的 K 换成 1就可以卡掉(答案为 `1332333000`)。
by ppip @ 2024-04-17 22:10:07
@[StudyingFather](/user/22030)
by ppip @ 2024-04-17 22:22:34
@[ppip](/user/374433) 洛谷的机子好像跑得飞快。。。。
我把您的 hack 搞到了[这里](/problem/U423848)的 `2.in`,上面部分题解在机房的机子要跑 5s+,但是在洛谷上 1s 内就过了。。。
by 菲斯斯夫斯基 @ 2024-04-18 10:59:09
@[菲斯斯夫斯基](/user/347664) 正常的,但是复杂度确实是 $O(n^3)$
by ppip @ 2024-04-18 10:59:33
@[ppip](/user/374433) 我想既然复杂度错误都能过,不如建议把时间限制降到 700ms 或者 500ms?
by 菲斯斯夫斯基 @ 2024-04-18 11:02:48