Description
给定二分图求最大匹配和匹配方案
Analysis
一开始我是想要匈牙利的
AJ:”网络流是重要的算法!匈牙利什么的都不用写了可以直接网络流!”
没有办法呀o(︶︿︶)o 唉
Code
/*
ID:wjp13241
PROG:
LANG:C++
*/
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define dfo(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,x,e) for(int i=ls[x];i;i=e[i].next)
#define fil(x,t) memset(x,t,sizeof(x))
#define FILEIN(s) freopen(s,"r",stdin)
#define FILEOUT(s) freopen(s,"w",stdout)
#define STP system("pause")
#define min(x,y) x<y?x:y
#define max(x,y) x>y?x:y
#define MP(x,y) make_pair(x,y)
#define PuB(v,x) v.push_back(x)
#define PoB(v) v.pop_back()
#define ld long double
#define ll long long
#define db double
#define INF 0x3f3f3f3f
#define LIM 100000000
#define EPS 1e-4
#define N 10201
#define E N*20+1
#define L 21
using namespace std;
struct edge{int y,w,rev,next;}e[E];
int vis[N],ls[N],maxE=0;
inline int read(){
int x=0,v=1;char ch=getchar();
while (ch>'9'||ch<'0'){if(ch=='-')v=-1;ch=getchar();}
while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return x*v;
}
int add(int x,int y,int w)
{
e[++maxE]=(edge){y,w,maxE+1,ls[x]},ls[x]=maxE;
e[++maxE]=(edge){x,0,maxE-1,ls[y]},ls[y]=maxE;
}
int find(int now,int ed,int n,int mn)
{
vis[now]=1;
if (now==n)
return mn;
for (int i=ls[now];i;i=e[i].next)
if (!vis[e[i].y]&&e[i].w>0)
{
int d=find(e[i].y,ed,n,min(mn,e[i].w));
if (d>0)
{
e[i].w-=d;
e[e[i].rev].w+=d;
return d;
}
}
return 0;
}
int main()
{
ios::sync_with_stdio(false);
int m=read(),n=read();
int x=read(),y=read();
while (x>0&&y>0)
{
add(x,y,1);
x=read();y=read();
}
fo(i,1,m)
add(0,i,1);
fo(i,m+1,m+n)
add(i,m+n+1,1);
int mxFlow=0;
while (int d=find(0,m+n+1,m+n+1,INF))
{
fil(vis,0);
mxFlow+=d;
}
if (mxFlow)
cout<<mxFlow<<endl;
else
cout<<"No Solution!"<<endl;
return 0;
}