标签:des style blog http color java os strong
2 4 1 2 1 3 1 4 2 3 2 4 3 4 4 1 2 1 3 1 4 2 3 2 4 3 4
2 2
主要是bool数组真的很省时间!!
#include"stdio.h"
#include"string.h"
#include"queue"
#include"vector"
using namespace std;
#define N 5005
#define M 30005
int lx[N],ly[N];
bool mark[N];
vector<int>g[N];
int find(int k)
{
int i,v;
for(i=0;i<g[k].size();i++)
{
v=g[k][i];
if(!mark[v])
{
mark[v]=1;
if(ly[v]==-1||find(ly[v]))
{
ly[v]=k;lx[k]=v;
return 1;
}
}
}
return 0;
}
int main()
{
int i,u,v,n,T;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=0;i<=n;i++)
g[i].clear();
for(i=0;i<n*3/2;i++)
{
scanf("%d%d",&u,&v);
g[u].push_back(v);
g[v].push_back(u);
}
memset(lx,-1,sizeof(lx));
memset(ly,-1,sizeof(ly));
int ans=0;
for(i=1;i<=n;i++)
{
if(lx[i]!=-1)
continue;
//memset(mark,0,(n+2)*sizeof(int));
memset(mark,0,sizeof(mark));
ans+=find(i);
}
printf("%d\n",ans/2);
}
return 0;
}
hdu 1845 Jimmy’s Assignment (二分图),布布扣,bubuko.com
hdu 1845 Jimmy’s Assignment (二分图)
标签:des style blog http color java os strong
原文地址:http://blog.csdn.net/u011721440/article/details/38341599