zoj 2587（Unique Attack）

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1587

题意描述：求一个无向图的最小割，并判断最小割是否唯一！

解决方法： 先用最大流算法求出最小割，然后分别从源点和汇点开始遍历，若遍历到的节点总数等于图中点的个数，那么则唯一，否则不唯一（具体证明不详）

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int inf=0x3f3f3f3f;
const int E = 10050*4;
const int N = 850;
struct node
{
	int x, y, c,nxt;
}edge[E];

int e,head[N];
int dep[N],que[N],cur[N];
bool tag[N];
int num, num1;
void addedge(int u,int v,int c)
{
	edge[e].x=u;
	edge[e].y=v;
	edge[e].nxt=head[u];
	edge[e].c=c;
	head[u]=e++;

	edge[e].x=v;
	edge[e].y=u;
	edge[e].nxt=head[v];
	edge[e].c=0;
	head[v]=e++;
}

int maxflow(int s,int t)
{
	int i,j,k,front,rear,top,min,res=0;
	while(1)
	{
		memset(dep,-1,sizeof(dep));
		front=0;
		rear=0;
		que[rear++]=s;
		dep[s]=0;
		while(front!=rear)
		{
			i=que[front++];
			for(j=head[i];j!=-1;j=edge[j].nxt)
				if(edge[j].c&&dep[edge[j].y]==-1)
				{
					dep[edge[j].y]=dep[i]+1;
					que[rear++]=edge[j].y;
				
				}
		}
		if(dep[t]==-1)
			break;
		memcpy(cur,head,sizeof(head)); 
		for(i=s,top=0;;)
		{
			if(i==t)
			{
				min=inf;
				for(k=0;k<top;k++)
					if(min>edge[que[k]].c)
					{
						min=edge[que[k]].c;
						front=k;
					}
				for(k=0;k<top;k++)
				{
					edge[que[k]].c-=min;
					edge[que[k]^1].c+=min;
				}
				res+=min;
				i=edge[que[top=front]].x;
				
			}
			for(j=cur[i];cur[i]!=-1;j=cur[i]=edge[cur[i]].nxt)
				if(dep[edge[j].y]==dep[i]+1&&edge[j].c)
					break;
			if(cur[i]!=-1)
			{
				que[top++]=cur[i];
				i=edge[cur[i]].y;
			}
			else
			{
				if(top==0)
					break;
				dep[i]=-1;
				i=edge[que[--top]].x;
			}
		}
	}
	return res;
}

void dfs(int u)
{
	tag[u]=1;
	num++;
	for(int i=head[u];i!=-1;i=edge[i].nxt)
	{
		int y = edge[i].y;
		if(edge[i].c&&tag[y]==0)
			dfs(y);
	}
}

void dfs1(int u)
{
	tag[u]=1;
	num1++;
	for(int i = head[u]; i!=-1;i=edge[i].nxt)
	{   
		int y = edge[i].y;
		if(edge[i^1].c&&tag[y]==0)
			dfs1(y);
	}
}
int main ()
{
	int n, m,S,T;
	int i,x,y,c;
	while(scanf("%d%d%d%d",&n,&m,&S,&T)!=EOF)
	{
		if(n==0&&m==0&&S==0&&T==0)
			break;
		memset(head,-1,sizeof(head));
		e = 0;
		for(i=0;i<m;i++)
		{
			scanf("%d%d%d",&x,&y,&c);
			addedge(x,y,c);
			addedge(y,x,c);
		}
	    maxflow(S,T);
		memset(tag,0,sizeof(tag));
		num=0;
		dfs(S);
		memset(tag,0,sizeof(tag));
		num1=0;
		dfs1(T);
		if(num1+num == n)
			printf("UNIQUE\n");
		else printf("AMBIGUOUS\n");
	}
	return 0;
}