匈牙利T两个点是什么情况

P3355 骑士共存问题

@[CEFqwq](/user/482610) 偶数建图少 T 一个。 理论上,$16nm^2$ 应该是过不去的。
by WhisperingWillow @ 2024-06-22 18:37:05


@[CEFqwq](/user/482610) 随机顺序搜,跑起来飞快。
by FFTotoro @ 2024-06-22 18:38:49


即随机顺序枚举需要增广的结点,就是这个地方给他 `shuffle` 一下: ```cpp for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++){ if (mp[i][j] == '1') continue; ... } ```
by FFTotoro @ 2024-06-22 18:39:52


[我当时倒着枚举,过了](https://www.luogu.com.cn/record/148910023)
by FFTotoro @ 2024-06-22 18:41:30


我不到啊,[我匈牙利过了](https://www.luogu.com.cn/record/172035082)
by qwertim @ 2024-09-01 10:24:06


考古,%%%
by LaDeX @ 2024-10-05 10:55:43


|