分析
就是那个匹配问题,要求输出方案,改了改。
code
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#include<queue>;
using namespace std;
struct arr{
int x,y,w,next;
}edge[1000000];
int ls[100000];
int cur[100000];
int f[1000000];
int sign[100000];
int edge_m;
int ans;
int s,t;
int add(int x,int y,int w)//加边。
{
edge_m++;
edge[edge_m]=(arr){x,y,w,ls[x]},f[edge_m]=w,ls[x]=edge_m,cur[x]=edge_m;
edge_m++;
edge[edge_m]=(arr){y,x,w,ls[y]},f[edge_m]=0,ls[y]=edge_m,cur[y]=edge_m;
}
int dis[100000];
bool bfs()//bfs判断是否继续。
{
memset(dis,-1,sizeof(dis));
queue<int> q;
dis[s]=0;
q.push(s);
do
{
int x=q.front();
q.pop();
for (int i=ls[x];i;i=edge[i].next)
{
if ((f[i])&&(dis[edge[i].y]==-1))
{
dis[edge[i].y]=dis[x]+1;
q.push(edge[i].y);
if (edge[i].y==t) return true;
}
}
}while (!q.empty());
return false;
}
int find(int x,int min_)//找增广路。
{
if (x==t) return min_;
int rec=min_;
for (int i=cur[x];i;i=edge[i].next)
{
if ((f[i]!=0)&&(dis[x]+1==dis[edge[i].y]))
{
int k=find(edge[i].y,min(rec,f[i]));
if (k!=0) sign[x]=edge[i].y;
f[i]-=k;
f[i^1]+=k;
rec-=k;
if (rec==0) return min_;
}
}
if (rec==min_) dis[x]=-1;
return min_-rec;
}
int n1,n2,n3;
int dinic()
{
while (bfs())
{
for (int i=s;i<=t;i++) cur[i]=ls[i];
ans+=find(s,20000000);
}
if (ans==0)
printf("No Solution!");
else
printf("%d\n",ans);
for (int i=1;i<=n1;i++)
if (sign[i]!=0) printf("%d %d\n",i,sign[i]);
}
int main()//主程序。
{
edge_m=1;
scanf("%d%d",&n1,&n2);
n3=n2-n1;
int x,y;
scanf("%d%d",&x,&y);
while (x!=-1)
{
add(x,y,1);
scanf("%d%d",&x,&y);
}
s=0; t=n2+1;
for (int i=1;i<=n1;i++)
add(0,i,1);
for (int i=n1+1;i<=n2;i++)
add(i,t,1);
dinic();
}