二分图最大匹配,但因为是网络流24题,我就用网络流写了cry,不会弄spj,就把数据改了改,把第二问去掉了,代码里注释掉的部分是第二问。
代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<climits>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define N 303
#define M N*N
#define inf 1<<30
using namespace std;
int n,m,s,t;
int head[N],pos,cur[N];
struct edge{int to,next,c;}e[M];
void add(int a,int b,int c)
{pos++;e[pos].to=b,e[pos].c=c,e[pos].next=head[a],head[a]=pos;}
int dis[N];bool vis[N];queue<int>Q;
bool bfs()
{
for(int i=s;i<=t;i++)dis[i]=-1,vis[i]=0;
dis[s]=0,vis[s]=1;Q.push(s);
while(!Q.empty())
{
int u=Q.front();Q.pop();
for(int i=head[u];i!=-1;i=e[i].next)
{
int v=e[i].to;
if(vis[v]||e[i].c<=0)continue;
vis[v]=1;Q.push(v);
dis[v]=dis[u]+1;
}
}return vis[t];
}
int dfs(int u,int a)
{
if(u==t||!a)return a;
int f,flow=0;
for(int &i=cur[u];i!=-1;i=e[i].next)
{
int v=e[i].to;
if(dis[v]==dis[u]+1&&(f=dfs(v,min(e[i].c,a)))>0)
{
e[i].c-=f,e[i^1].c+=f;
flow+=f,a-=f;
if(!a)break;
}
}return flow;
}
void init()
{
pos=-1;
memset(head,-1,sizeof(head));
}
int dinic()
{
int ret=0;
while(bfs())
{
for(int i=s;i<=t;i++)cur[i]=head[i];
ret+=dfs(s,inf);
}return ret;
}
int main()
{
freopen("air.in","r",stdin);
freopen("air.out","w",stdout);
scanf("%d%d",&n,&m);init();
int x=0,y=0;s=0,t=n+m+1;
while(scanf("%d%d",&x,&y)!=EOF&&x!=-1&&y!=-1)
add(x,y+n,1),add(y+n,x,0);
for(int i=1;i<=n;i++)add(s,i,1),add(i,s,0);
for(int i=1;i<=m;i++)add(i+n,t,1),add(t,i+n,0);
printf("%d\n",dinic());
/* for(int u=1;u<=n;u++)
{
for(int j=head[u];j!=-1;j=e[j].next)
{
int v=e[j].to;
if(e[j].c>0)continue;
if(v>=n&&v<=n+m)
{
printf("%d %d\n",u,v-n);
break;
}
}
}
*/
}