题意:输入一个n和m,n为点数,m为边数,接下来m行u, v, w,求1和2不连接的最小花费,并输出割边。
求最小割就是裸的最大流
然后求割边集就是:最后一次不能增广后的残图,割边定义是容量==流量的点 即残图残量为0 的边,将图中的点分为 两部分,一部分为 原点能到达的点, 另一部分是汇点能到达的点,标记不同即是割边两点
链接:uva - 10480
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 2000005;
int n, m;//点数、边数
int sp, tp;//原点、汇点
struct node {
int u, v, next;
int cap;
}mp[maxn];
int pre[maxn], dis[maxn], cur[maxn];//cur为当前弧优化,dis存储分层图中每个点的层数(即到原点的最短距离),pre建邻接表
int cnt = 0;
int vis[maxn];
void init() { //不要忘记初始化
cnt = 0;
memset(pre, -1, sizeof(pre));
}
void add(int u, int v, int w) { //加边
mp[cnt].u = u;
mp[cnt].v = v;
mp[cnt].cap = w;
mp[cnt].next = pre[u];
pre[u] = cnt++;
mp[cnt].u = v;
mp[cnt].v = u;
mp[cnt].cap = w;
mp[cnt].next = pre[v];
pre[v] = cnt++;
}
bool bfs() { //建分层图
memset(dis, -1, sizeof(dis));
queue<int>q;
while(!q.empty())
q.pop();
q.push(sp);
dis[sp] = 0;
int u, v;
while(!q.empty()) {
u = q.front();
q.pop();
for(int i = pre[u]; i != -1; i = mp[i].next) {
v = mp[i].v;
if(dis[v] == -1 && mp[i].cap > 0) {
dis[v] = dis[u] + 1;
q.push(v);
if(v == tp)
break;
}
}
}
return dis[tp] != -1;
}
int dfs(int u, int cap) {//寻找增广路
if(u == tp || cap == 0)
return cap;
int res = 0, f;
for(int &i = cur[u]; i != -1; i = mp[i].next) {//
int v = mp[i].v;
if(dis[v] == dis[u] + 1 && (f = dfs(v, min(cap - res, mp[i].cap))) > 0) {
mp[i].cap -= f;
mp[i ^ 1].cap += f;
res += f;
if(res == cap)
return cap;
}
}
if(!res)
dis[u] = -1;
return res;
}
int dinic() {
int ans = 0;
while(bfs()) {
for(int i = 0; i <= n + 1; i++)
cur[i] = pre[i];
ans += dfs(sp, inf);
}
return ans;
}
void bbfs (int s, int k) {
queue<int > que;
que.push(s);
vis[s] = k;
while(!que.empty()) {
int u = que.front();
que.pop();
for(int i = pre[u]; i != -1; i = mp[i].next) {
int v = mp[i].v;
if(mp[i].cap > 0 && !vis[v]) {
vis[v] = k;
que.push(v);
}
}
}
return;
}
int main ()
{
while(~scanf("%d %d", &n, &m) && n && m) {
init();
sp = 1;
tp = 2;
int u, v, w;
while(m--) {
scanf("%d %d %d", &u, &v, &w);
add(u, v, w);
}
int res = dinic();
//printf("%d\n", res);
memset(vis, 0, sizeof(vis));
bbfs(sp, 1);
bbfs(tp, 2);
for(int i = 0; i < cnt; i++) {
if(mp[i].cap == 0 && vis[mp[i].u] != vis[mp[i].v]) {
printf("%d %d\n", mp[i].u, mp[i].v);
}
}
printf("\n");
}
return 0;
}