题目
hdu2063
思路
将最大流改成二分图最大匹配,加个源点、汇点,把所有流量调为1即可。
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
int to,next,value;
}edge[100010];
int tot=1;
int head[5010],dis[5010];
int n,m,s,t;
void add_edge(int u,int v,int w){
edge[++tot].to=v;
edge[tot].value=w;
edge[tot].next=head[u];
head[u]=tot;
}
bool bfs(){
for(int i=0;i<=t;i++){
dis[i]=-1;
}
queue<int> q;
dis[s]=0;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
for(int i=head[u];i;i=edge[i].next){
int to=edge[i].to;
if(dis[to]==-1&&edge[i].value>0){
dis[to]=dis[u]+1;
q.push(to);
}
}
}
return dis[t]!=-1;
}
int dfs(int x,int exp){
if(x==t) return exp;
int flow=0;
for(int i=head[x];i;i=edge[i].next){
int to=edge[i].to;
if((dis[to]==dis[x]+1)&&edge[i].value>0){
int tmp=dfs(to,min(exp,edge[i].value));
if(!tmp) continue;
exp-=tmp;
flow+=tmp;
edge[i].value-=tmp;
edge[i^1].value+=tmp;
if(!exp) break;
}
}
if(!flow) dis[x]=-2;
return flow;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int k;
while(cin>>k){
if(k==0) break;
cin>>n>>m;
tot=1;
t=n+n+m+1;
for(int i=0;i<=t;i++) head[i]=0;
s=0;
for(int i=1;i<=k;i++){
int x,y;
cin>>x>>y;
add_edge(x,y+n,1);
add_edge(y+n,x,0);
}
for(int i=1;i<=n;i++){
add_edge(s,i,1);
add_edge(i,s,0);
}
for(int i=1;i<=m;i++){
add_edge(i+n,t,1);
add_edge(t,i+n,0);
}
int ans=0;
while(bfs()){
ans+=dfs(s,INF);
}
cout<<ans<<endl;
}
return 0;
}