【BZOJ】4405: [wc2016]挑战NPC

传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=4405

隔壁UOJ有完整版……这个不需要匹配方案貌似也可以tuttle矩阵？

#include<stdio.h>
#include<algorithm>
#include<cstring>
#define co(a,b) f[gf(a)]=gf(b)
#define Push(a,b) push(a,b),push(b,a)
#define N 610
 
using namespace std;
 
struct edge{int v,n;}e[N*N];
 
int mat[N],f[N],ne[N],V[N],Q[N],ma[N],s[N],tot,ans,l,r,n,m,t,T,E;
inline void push(const int &u,const int &v){e[++tot]=(edge){v,s[u]};s[u]=tot;}
 
int gf(const int &x){return x==f[x]?x:f[x]=gf(f[x]);};
 
inline int lca(int x,int y)
{
    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;
    Q[1]=st;ma[st]=1;
    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;
        }
    }
}
 
inline void prepare()
{
    tot=ans=t=0;
    memset(mat,0,sizeof(mat));
    memset(s,0,sizeof(s));
}
 
int main()
{
    scanf("%d",&T);
    while (T--)
    {
        prepare();
        scanf("%d%d%d",&n,&m,&E);
        for (int u,v;E--;)
        {
            scanf("%d%d",&u,&v);
            Push(u,n+v*3-2);
            Push(u,n+v*3-1);
            Push(u,n+v*3);
        }
        for (int i=1;i<=m;i++) Push(n+i*3-1,n+i*3);
        for (int i=1;i<=n+m*3;i++) if (!mat[i]) find(i,n+m*3);
        for (int i=1;i<=n+m*3;i++) if (mat[i]) ans++;
        printf("%d\n",ans/2-n);
    }
}