和你们讲个故事:有个人刚学会带花树,然后他找不到题。把挑战NPC来来回回写烂了,最后实在忍不住对他能找到的所有二分图匹配下手了……
#include<stdio.h>
#include<algorithm>
#define co(a,b) f[gf(a)]=gf(b)
#define N 1005
using namespace std;
int f[N],s[N],V[N],ne[N],mat[N],ma[N],Q[N],n1,n2,m,ans,tot,l,r;
struct edge{int v,n;}e[N*N<<1];
inline void push(const int &u,const int &v){e[++tot]=(edge){v,s[u]};s[u]=tot;}
int gf(int x){return f[x]==x?x:f[x]=gf(f[x]);}
inline int lca(int x,int y)
{
static int t=0;
for (t++;;swap(x,y)) if (x)
{
x=gf(x);
if (V[x]==t) return x;
V[x]=t;
x=ne[mat[x]];
}
}
inline void g(int a,int p)
{
while (a!=p)
{
int b=mat[a],c=ne[b];
if (gf(c)!=p) ne[c]=b;
if (ma[b]==2) ma[Q[++r]=b]=1;
co(a,b);co(b,c);a=c;
}
}
inline void find(const int &st,const int &n)
{
for (int i=1;i<=n;i++) f[i]=i,ne[i]=ma[i]=V[i]=0;
ma[st]=1;Q[1]=st;
for (l=r=1;l<=r;l++)
{
int u=Q[l];
for (int i=s[u];i;i=e[i].n)
{
int v=e[i].v;
if (mat[u]==v || gf(u)==gf(v) || ma[v]==2) continue;
if (ma[v]==1)
{
int tmp=lca(u,v);
if (gf(u)!=tmp) ne[u]=v;
if (gf(v)!=tmp) ne[v]=u;
g(u,tmp);g(v,tmp);
}
else if (!mat[v])
{
ne[v]=u;
for (int k=v,x,y;k;k=y) y=mat[x=ne[k]],mat[x]=k,mat[k]=x;
return;
}
else ne[v]=u,ma[v]=2,ma[Q[++r]=mat[v]]=1;
}
}
}
int main()
{
scanf("%d%d%d",&n1,&n2,&m);
for (int u,v;m--;)
{
scanf("%d%d",&u,&v);
push(u,n1+v),push(n1+v,u);
}
for (int i=1;i<=n1;i++) if (!mat[i]) find(i,n1+n2);
for (int i=1;i<=n1;i++) if (mat[i]) ans++;
printf("%d\n",ans);
for (int i=1;i<=n1;i++) printf("%d ",mat[i]?mat[i]-n1:0);
}