BZOJ2893: 征服王

  1 #include<cstdio>
  2 
  3 #include<cstdlib>
  4 
  5 #include<cmath>
  6 
  7 #include<cstring>
  8 
  9 #include<algorithm>
 10 
 11 #include<iostream>
 12 
 13 #include<vector>
 14 
 15 #include<map>
 16 
 17 #include<set>
 18 
 19 #include<queue>
 20 
 21 #include<string>
 22 
 23 #define inf 1000000000
 24 
 25 #define maxn 100000+5
 26 
 27 #define maxm 100000+5
 28 
 29 #define eps 1e-10
 30 
 31 #define ll long long
 32 
 33 #define pa pair<int,int>
 34 
 35 #define for0(i,n) for(int i=0;i<=(n);i++)
 36 
 37 #define for1(i,n) for(int i=1;i<=(n);i++)
 38 
 39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
 40 
 41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
 42 
 43 #define for4(i,x) for(int i=head[x],y;i;i=e[i].next)
 44 
 45 #define mod 1000000007
 46 
 47 using namespace std;
 48 
 49 inline int read()
 50 
 51 {
 52 
 53     int x=0,f=1;char ch=getchar();
 54 
 55     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
 56 
 57     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
 58 
 59     return x*f;
 60 
 61 }
 62 int  n,m,s,t,ss,tt,T,a[maxn],b[maxn],maxflow,tot=1,head[maxn],cur[maxn],h[maxn],in[maxn];
 63 queue<int>q;
 64 struct edge{int go,next,v;}e[maxm];
 65 inline void add(int x,int y,int v)
 66 {
 67     e[++tot]=(edge){y,head[x],v};head[x]=tot;
 68     e[++tot]=(edge){x,head[y],0};head[y]=tot;
 69 }
 70 inline void ins(int x,int y)
 71 {
 72     e[++tot]=(edge){y,head[x],0};head[x]=tot;
 73 }
 74 inline void insert(int x,int y,int l,int r)
 75 {
 76     in[y]+=l;in[x]-=l;add(x,y,r-l);
 77 }
 78 void build()
 79 {
 80     for0(i,tt)if(in[i]>0)add(ss,i,in[i]);else if(in[i]<0)add(i,tt,-in[i]);
 81 }
 82 bool bfs()
 83 {
 84     for(int i=0;i<=tt;i++)h[i]=-1;
 85     q.push(s);h[s]=0;
 86     while(!q.empty())
 87     {
 88         int x=q.front();q.pop();
 89         for(int i=head[x];i;i=e[i].next)
 90          if(e[i].v&&h[e[i].go]==-1)
 91          {
 92             h[e[i].go]=h[x]+1;q.push(e[i].go);
 93          }
 94     }
 95     return h[t]!=-1;
 96 }
 97 int dfs(int x,int f)
 98 {
 99     if(x==t) return f;
100     int tmp,used=0;
101     for(int i=cur[x];i;i=e[i].next)
102      if(e[i].v&&h[e[i].go]==h[x]+1)
103     {
104         tmp=dfs(e[i].go,min(e[i].v,f-used));
105         e[i].v-=tmp;if(e[i].v)cur[x]=i;
106         e[i^1].v+=tmp;used+=tmp;
107         if(used==f)return f;       
108     }
109     if(!used) h[x]=-1;
110     return used;
111 }
112 void dinic()
113 {
114     maxflow=0;
115     while(bfs())
116     {
117         for (int i=0;i<=tt;i++)cur[i]=head[i];maxflow+=dfs(s,inf);
118     }
119 }
120 int ti,u[maxn],v[maxn],low[maxn],dfn[maxn],cnt,scc[maxn],top,sta[maxn];
121 int minflow()
122 {
123     s=ss;t=tt;
124     dinic();
125     if(maxflow!=cnt)return -1;
126     int ans=e[tot].v;
127     e[tot].v=e[tot^1].v=0;
128     s=cnt+cnt+1;t=0;
129     dinic();
130     return ans-maxflow;
131 }
132 inline void tarjan(int x)
133 {
134     sta[++top]=x;low[x]=dfn[x]=++ti;
135     for4(i,x)if(!dfn[y=e[i].go])
136     {
137         tarjan(y);
138         low[x]=min(low[x],low[y]);
139     }else if(!scc[y])low[x]=min(low[x],dfn[y]);
140     if(low[x]==dfn[x])
141     {
142         cnt++;
143         for(int y=0;y!=x;)scc[y=sta[top--]]=cnt;
144     }
145 }
146 
147 int main()
148 
149 {
150 
151     freopen("input.txt","r",stdin);
152 
153     freopen("output.txt","w",stdout);
154 
155     T=read();
156     while(T--)
157     {
158         memset(head,0,sizeof(head));tot=1;cnt=0;
159         memset(in,0,sizeof(in));
160         memset(low,0,sizeof(low));
161         memset(dfn,0,sizeof(dfn));
162         memset(scc,0,sizeof(scc));
163         n=read();m=read();a[0]=read();b[0]=read();
164         for1(i,a[0])a[i]=read();
165         for1(i,b[0])b[i]=read();
166         for1(i,m){u[i]=read();v[i]=read();ins(u[i],v[i]);}
167         for1(i,n)if(!dfn[i])tarjan(i);
168         s=0;t=cnt+cnt+1;ss=t+1;tt=t+2;
169         memset(head,0,sizeof(head));tot=1;
170         for1(i,cnt)insert(i,i+cnt,1,inf);
171         for1(i,a[0])insert(s,scc[a[i]],0,inf);
172         for1(i,b[0])insert(scc[b[i]]+cnt,t,0,inf);
173         for1(i,m)if(scc[u[i]]!=scc[v[i]])insert(scc[u[i]]+cnt,scc[v[i]],0,inf);
174         build();
175         insert(t,s,0,inf);
176         int x=minflow();
177         if(x==-1)printf("no solution\n");else printf("%d\n",x);
178     }
179 
180     return 0;
181 
182 }