题意:
给出无向图的边和边权,问分割成两部分的最小代价。
思路:
解法1:最小割等于最大流,固定一个节点,枚举其他节点,计算将这两个节点分割的最小代价,取最小值即可。
解法2:全局最小割问题,用StoerWagner算法,复杂度O(n^3),效率更高。
解法1代码:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#define pb push_back
#define X first
#define Y second
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pii pair<int,int>
#define qclear(a) while(!a.empty())a.pop();
#define lowbit(x) (x&-x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define mst(a,b) memset(a,b,sizeof(a))
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define cout1(x) cout<<x<<endl
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const ll INFF=0x3f3f3f3f3f3f3f3f;
const ll mod=998244353;
const double eps=1e-5;
const int maxn=205;
const int maxm=20005;
int maze[maxn][maxn];
int gap[maxn], dis[maxn], pre[maxn], cur[maxn];
int flow[maxn][maxn];
int sap(int start,int ed,int nodenum) {
memset(cur, 0, sizeof(cur));
memset(dis, 0, sizeof(dis));
memset(gap, 0, sizeof(gap));
memset(flow, 0, sizeof(flow));
int u = pre[start] = start, maxflow=0, aug = -1;
gap[0] = nodenum;
while (dis[start] < nodenum) {
loop:
for (int v = cur[u]; v < nodenum; v++)
if (maze[u][v]-flow[u][v] && dis[u] == dis[v] + 1) {
if (aug == -1 || aug > maze[u][v]-flow[u][v])
aug = maze[u][v]-flow[u][v];
pre[v] = u;
u = cur[u] = v;
if (v == ed) {
maxflow += aug;
for (u = pre[u]; v != start; v = u, u = pre[u]) {
flow[u][v] += aug;
flow[v][u] -= aug;
}
aug = -1;
}
goto loop;
}
int mindis = nodenum - 1;
for (int v = 0; v < nodenum; v++)
if (maze[u][v]-flow[u][v] && mindis > dis[v]) {
cur[u] = v;
mindis = dis[v];
}
if ((--gap[dis[u]]) == 0)
break;
gap[dis[u] = mindis + 1]++;
u = pre[u];
}
return maxflow;
}
int n,m;
void solve() {
while(~sdd(n,m)) {
mst(maze,0);
for(int i=0; i<m; i++) {
int u,v,w;
sddd(u,v,w);
maze[u][v]+=w;
maze[v][u]=maze[u][v];
}
int ans=INF;
for(int i=1; i<n; i++) {
ans=min(ans,sap(0,i,n));
}
printf("%d\n",ans);
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}