Luogu P2046. [NOI2010] Altitude
Original link: https://www.shuizilong.com/house/archives/luogu-p2046-noi2010-%E6%B5%B7%E6%8B%94/ https://www.luogu.com.cn/problem/P2046 Simple planar graph minimum cut, the difficulty is to prove that this is the minimum cut. The main focus of the code is one-handed symmetry. = = #include <lastweapon/io> #include <lastweapon/dijkstra> using namespace lastweapon; int n, s, t; int id(int x, int y) { if (x == -1 || y == […]
Luogu P2046. [NOI2010] Altitude Read More »