```cpp
for(int i=lst[u];i!=0;i=nxt[i]){
```
没有弧优化，没有弧优化的dinic的时间复杂度为O(玄学)
by wtcqwq @ 2022-06-03 13:28:44
另外建议用scanf
by wtcqwq @ 2022-06-03 13:29:11
@[World_Trade_Center](/user/241867) 听别人说不带cur卡常可过啊/kk
~~实际是不会cur~~
by 3a51_ @ 2022-06-03 13:31:35
啊这 但我没带cur反正是没过（（（
by wtcqwq @ 2022-06-03 13:32:50
@[Tothetime_tolife](/user/327444) 弧优化就是顺带着更新一下 lst 就行
by YamadaRyou @ 2022-06-03 13:33:02
那可以先快读快写一下
by wtcqwq @ 2022-06-03 13:33:22
@[cxy2022](/user/203008) 那我去学学看
by 3a51_ @ 2022-06-03 13:33:47
常数问题？（指`cin cout`）
by TheSky233 @ 2022-06-03 13:35:12
@[cxy2022](/user/203008) 加了弧优化WA了/kk
by 3a51_ @ 2022-06-03 13:42:38
@[Tothetime_tolife](/user/327444) 发一下？
by YamadaRyou @ 2022-06-03 13:51:35