Unique Attack zoj2587 最大流

Description

---

给定n个点m条双向边以及这些边的花费，求破坏A、B两个点的连通性的最小花费是否唯一

Solution

---

怎么说呢，这是一题藏在费用流ppt里面的最大流

最小割是不难想到的，那么这道题求的就是最小割是否唯一了

根据最小割的定理，一个割能把图分成包含起点st的集合S以及包含汇点ed的集合T，那么我们通过dfs残留网络寻找两个集合。通过数量判断如果他们有交集就说明是有不只一个最小割的

Code

---

#include <stdio.h>
#include <string.h>
#include <queue>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define INF 0x3f3f3f3f
#define N 1001
#define E N * 20 + 1
struct edge{int x, y, w, next;}e[E];
int cur[N], ls[N];
inline void addEdge(int &cnt, int x, int y, int w){
    cnt += 1; e[cnt] = (edge){x, y, w, ls[x]}; ls[x] = cnt;
    // cnt += 1; e[cnt] = (edge){y, x, 0, ls[y]}; ls[y] = cnt;
}
using std:: queue;
int dis[N], pre[N];
inline int bfs(int st, int ed, int n){
    queue<int> que;
    que.push(st);
    rep(i, 0, n){
        dis[i] = -1;
    }
    dis[st] = 0;
    while (!que.empty()){
        int now = que.front(); que.pop();
        erg(i, now){
            if (e[i].w > 0 && dis[e[i].y] == -1){
                dis[e[i].y] = dis[now] + 1;
                que.push(e[i].y);
                if (e[i].y == ed){
                    return 1;
                }
            }
        }
    }
    return 0;
}
inline int min(int x, int y){
    return x<y?x:y;
}
inline int find(int now, int ed, int mn){
    if (now == ed || !mn){
        return mn;
    }
    int ret = 0;
    for (int &i = cur[now]; i; i = e[i].next){
        if (e[i].w > 0 && dis[now] + 1 == dis[e[i].y]){
            int d = find(e[i].y, ed, min(e[i].w, mn - ret));
            e[i].w-= d;
            e[i ^ 1].w += d;
            ret += d;
            if (ret == mn){
                break;
            }
        }
    }
    return ret;
}
inline void dinic(int st, int ed, int n){
    while (bfs(st, ed, n)){
        rep(i, 0, n){
            cur[i] = ls[i];
        }
        find(st, ed, INF);
    }
}
int vis1[N], vis2[N], cnt1, cnt2;
inline void dfs1(int now){
    vis1[now] = 1;
    cnt1 += 1;
    erg(i, now){
        if (!vis1[e[i].y] && e[i].w > 0){
            dfs1(e[i].y);
        }
    }
}
inline void dfs2(int now){
    vis2[now] = 1;
    cnt2 += 1;
    erg(i, now){
        if (!vis2[e[i].y] && e[i ^ 1].w > 0){
            dfs2(e[i].y);
        }
    }
}
int main(void){
    int n, m, st, ed;
    while (scanf("%d%d%d%d", &n, &m, &st, &ed) && n && m && st && ed){
        int edgeCnt = 1;
        rep(i, 0, n){
            ls[i] = 0;
        }
        rep(i, 1, m){
            int x, y, w;
            scanf("%d%d%d", &x, &y, &w);
            addEdge(edgeCnt, x, y, w);
            addEdge(edgeCnt, y, x, w);
        }
        dinic(st, ed, n);
        rep(i, 1, n){
            vis1[i] = 0;
            vis2[i] = 0;
        }
        cnt1 = 0;
        cnt2 = 0;
        dfs1(st);
        dfs2(ed);
        if (cnt1 + cnt2 == n){
            puts("UNIQUE");
        }else{
            puts("AMBIGUOUS");
        }
    }
    return 0;
}