2893: 征服王 tarjan+最小流

首先tarjan缩点，然后裸的最小流。
好像是个挺麻烦的费用流。。然而我写的最小流居然跑到了rank1。。

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<vector>
using namespace std;

const int N=1100;
const int M=50005;
const int INF=1000000007;

int n,m,A,B,S,T,SS,TT,scc,cnt,tot,top,sum,ans;
int dfn[N],stack[N],low[N],belong[N],st[N],en[N];
bool inset[N],vis[N<<1];
int head[N<<1],cur[N<<1],dis[N<<1];
int next[M],list[M],key[M];

vector<int> a[N];

inline int read()
{
    int a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='0') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}

inline void insert(int x,int y,int z)
{
    next[++cnt]=head[x];
    head[x]=cnt;
    list[cnt]=y;
    key[cnt]=z;
}

inline void tarjan(int x)
{
    dfn[x]=low[x]=++tot;
    stack[++top]=x;
    inset[x]=true;
    for (int i=0;i<a[x].size();i++)
        if (!dfn[a[x][i]])
        {
            tarjan(a[x][i]);
            low[x]=min(low[x],low[a[x][i]]);
        }
        else if (inset[a[x][i]]) low[x]=min(low[x],dfn[a[x][i]]);
    if (low[x]==dfn[x])
    {
        int i=-1; scc++;
        while (i!=x)
        {
            i=stack[top--];
            belong[i]=scc;
            inset[i]=false;
        }
    }
}

inline bool BFS()
{
    queue<int> q;
    memset(dis,-1,sizeof(dis));
    q.push(SS);
    dis[SS]=1;
    while (!q.empty())
    {
        int x=q.front(); q.pop();
        for (int i=head[x];i;i=next[i])
            if (key[i]&&dis[list[i]]==-1)
            {
                dis[list[i]]=dis[x]+1;
                q.push(list[i]);
            }
    }
    return dis[TT]!=-1;
}

int find(int x,int flow)
{
    if (x==TT) return flow;
    int w,used=0;
    for (int i=cur[x];i;i=next[i])
        if (key[i]&&dis[list[i]]==dis[x]+1)
        {
            w=find(list[i],min(key[i],flow-used));
            key[i]-=w; key[i^1]+=w; used+=w;
            if (key[i]) cur[x]=i;
            if (used==flow) return used;
        }
    if (!used) dis[x]=-1;
    return used;
}

inline int dinic()
{
    int tmp=0;
    while (BFS()) 
    {
        for (int i=0;i<=TT;i++) cur[i]=head[i];
        tmp+=find(SS,INF);
    }
    return tmp;
}

int main()
{
    int testcase=read();
    while (testcase--)
    {
        n=read(); m=read(); A=read(); B=read(); tot=0; top=0; scc=0; cnt=1;
        for (int i=1;i<=n;i++) a[i].clear();
        memset(dfn,0,sizeof(dfn));
        memset(head,0,sizeof(head));
        for (int i=1;i<=A;i++) st[i]=read();
        for (int i=1;i<=B;i++) en[i]=read();
        for (int i=1;i<=m;i++)
        {
            int u=read(),v=read();
            a[u].push_back(v);
        }
        for (int i=1;i<=n;i++)
            if (!dfn[i]) tarjan(i);
        S=0; T=scc<<1|1; SS=T+1; TT=SS+1;
        for (int i=1;i<=A;i++) 
            insert(S,belong[st[i]],INF),insert(belong[st[i]],S,0);
        for (int i=1;i<=B;i++)
            insert(belong[en[i]]+scc,T,INF),insert(T,belong[en[i]]+scc,0);
        for (int i=1;i<=scc;i++) 
            insert(i,i+scc,INF),insert(i+scc,i,0);
        for (int i=1;i<=n;i++) 
            for (int j=0;j<a[i].size();j++)
                if (belong[i]!=belong[a[i][j]])
                    insert(belong[i]+scc,belong[a[i][j]],INF),insert(belong[a[i][j]],belong[i]+scc,0);
        for (int i=1;i<=scc;i++) insert(i,TT,1),insert(TT,i,0);
        for (int i=1;i<=scc;i++) insert(SS,i+scc,1),insert(i+scc,SS,0);
        int total=0;
        total+=dinic(); insert(T,S,INF); insert(S,T,0); total+=dinic();
        if (total!=scc) puts("no solution");
        else printf("%d\n",key[cnt]);
    }
    return 0;
}