91pts WA on #10 with Dinic algo.

P3376 【模板】网络最大流

建议提高一下代码可读性Orz ```cpp LL aug_min = min(G[i].cap, nrf), dlta = augment(v, aug_min, t); G[i].cap -= dlta, G[i ^ 1].cap -= dlta; nrf -= dlta; if (!nrf) break; ``` 改成这样 ```cpp LL aug_min = min(G[i].cap, nrf), dlta = augment(v, aug_min, t); G[i].cap -= dlta, G[i ^ 1].cap += dlta; nrf -= dlta; if (!nrf) break; ```
by strcmp @ 2022-03-05 12:56:35


@[wql463](/user/551861) [AC记录](https://www.luogu.com.cn/record/70617282)
by strcmp @ 2022-03-05 12:59:50


@[wql463](/user/551861) 多谢 ~~反向弧写成减流竟硬是没看出来,WTCL~~ ~~可读性应该是洛谷的锅,实在不行回头发上来的时候打个换行~~
by 2020kanade @ 2022-03-05 16:20:28


|