题目链接
题意:求一个最大的二分匹配,网络流最大流,自己造一个源点一个汇点,源点0到1~m流为1,m+1~n到汇点n+1流为1,然后就是题目给出的也是流为1,图就是这样的,套dinic一个板子,但是题意要输出路径方案,就是遍历一边所有的边,因为一开始的流都是1,跑完的话用到的边的流就为0了,所以只需要再次判断一下边的流为0,输出即可
AC代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define myself i,l,r
#define lson i<<1
#define rson i<<1|1
#define Lson i<<1,l,mid
#define Rson i<<1|1,mid+1,r
#define half (l+r)/2
#define inff 0x3f3f3f3f
#define lowbit(x) x&(-x)
#define PI 3.14159265358979323846
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define min3(x,y,z) min(min(x,y),min(y,z))
#define pii make_pair
#define pr pair<int,int>
const int dir[4][2]={0,1,0,-1,1,0,-1,0};
typedef long long ll;
const ll inFF=9223372036854775807;
typedef unsigned long long ull;
using namespace std;
const int maxm=10005;
const int maxn=105;
int cur[maxn],d[maxn];
int head[maxn],sign;
int n,m;
struct node
{
int to,p,val;
}edge[maxm<<1];
void init()
{
sign=0;
memset(head,-1,sizeof(head));
}
void add(int u,int v,int val)
{
edge[sign]=node{v,head[u],val};
head[u]=sign++;
}
int bfs(int st,int ed)
{
memset(d,0,sizeof(d));
d[st]=1;
queue<int >q;
q.push(st);
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=head[u];~i;i=edge[i].p)
{
int v=edge[i].to;
if(!d[v]&&edge[i].val)
{
d[v]=d[u]+1;
q.push(v);
}
}
}
if(d[ed]==0) return false;
return true;
}
int dfs(int u,int ed,int low)
{
if(u==ed) return low;
int temp=low,a;
for(int &i=cur[u];~i;i=edge[i].p)
{
int v=edge[i].to;
if(d[v]==d[u]+1&&edge[i].val)
{
if(a=dfs(v,ed,min(low,edge[i].val)))
{
edge[i].val-=a;
edge[i^1].val+=a;
temp-=a;
if(temp==0) break;
}
}
}
return low-temp;
}
int main()
{
int x,y;
while(cin>>m>>n)
{
init();
while(scanf("%d %d",&x,&y)&&(x!=-1||y!=-1))
add(x,y,1),add(y,x,0);
for(int i=1;i<=m;i++)
add(0,i,1),add(i,0,0);
for(int i=m+1;i<=n;i++)
add(i,n+1,1),add(n+1,i,0);
int ans=0;
while(bfs(0,n+1))
{
for(int i=0;i<=n+1;i++)
cur[i]=head[i];
ans+=dfs(0,n+1,inff);
}
if(ans==0) puts("No Solution!");
else{
printf("%d\n",ans);
for(int u=1;u<=m;u++)
{
for(int i=head[u];~i;i=edge[i].p)
{
int v=edge[i].to;
if(v>=m+1&&v<=n&&edge[i].val==0)
printf("%d %d\n",u,v);
}
}
}
}
return 0;
}