URAL 1277 - Cops and Thieves - [无向图点带权的最小点割]

题目链接：https://cn.vjudge.net/problem/URAL-1277

The Galaxy Police (Galaxpol) found out that a notorious gang of thieves has plans for stealing an extremely valuable exhibit from the Earth Planetary Museum — an ancient microprocessor. The police chiefs decided to intercept the criminals on the way from their refuge to the museum. A problem arose while planning the police operation: would it be possible for the Galaxpol staff to control all the possible routes of the criminals?

The galaxy transport system is designed as follows. Each planet has a transport station that is connected to some of the other stations via two-way teleportation channels. Transport stations vary in their sizes, so different numbers of policemen may be required to take control over different stations. In order not to upset the operation, it was decided to leave the planets that are next to the museum or the refuge without any police control.

Help the Galaxpol to place their staff at the stations in order to block all possible routes of the thieves.

Input

The first line of the input contains a single integer 0 < K ≤ 10000 — the number of policemen engaged to control the stations.

The second line has four integers: N, M, S and F delimited with white-space character.

N is the number of stations in the galaxy (the stations are numbered from 1 toN); 2 < N ≤ 100.

M is the number of teleportation channels; 1 < M ≤ 10000.

S is the number of the planet (and the station) where the museum is; 1 ≤ S ≤N.

F is the number of the planet (and the station) where the thieves’ refuge is; 1 ≤ F ≤ N.

The next line contains N integers ( x ₁, …, x_N) separated with white-space character — the number of policemen required to control each of the stations (∑ _i=1 ^N x_i ≤ 10000).

Then M lines follow that describe the teleportation channels. Each of these lines contains a pair of space-delimited integers — the numbers of stations being connected by a channel. The channel system is designed so that it is possible to reach any station from any other one (probably it would require several channel transitions).

Output

Write “YES” if it is possible to block all the possible routes within given limitations, and “NO” otherwise.

Example

input	output
10 5 5 1 5 1 6 6 11 1 1 2 1 3 2 4 3 4 4 5	NO
10 5 5 1 5 1 4 4 11 1 1 2 1 3 2 4 3 4 4 5	YES

至于为什么要这样拆边，假设in(k)==k'，out(k)==k''，即我们要addedge(out(i), in(j), INF)和addedge(out(j), in(i), INF)，

为什么要这样addedge呢？因为我们的最大流算法默认都是有向图，addedge加入的边都是有向边，

这样加入边确保了该点k所有的入弧都是连接到in(k)，出弧都是连接在out(k)；

这使得原本所有流经该点的flow，现在都必须流经edge(in(k), out(k), w)，确保了算法的正确性（不是很清楚的话，可以手动画图拆点拆边试试）。

（原本我想当然的addedge(out(i), in(j), INF)和addedge(in(j), in(i), INF)，果断WA了……）

 #include<cstdio>
 #include<cstring>
 #include<vector>
 #include<queue>
 #define MAX 2*100+5
 #define INF 0x3f3f3f3f
 #define in(x) x
 #define out(x) x+N
 using namespace std;
 int K,N,M,S,F;
 struct Edge{
     int u,v,c,f;
 };
 struct Dinic
 {
     int s,t;
     vector<Edge> E;
     vector<int> G[MAX];
     bool vis[MAX];
     int lev[MAX];
     int cur[MAX];
     void addedge(int from,int to,int cap)
     {
         E.push_back((Edge){from,to,cap,});
         E.push_back((Edge){to,from,,});
         G[from].push_back(E.size()-);
         G[to].push_back(E.size()-);
     }
     bool bfs()
     {
         memset(vis,,sizeof(vis));
         queue<int> q;
         q.push(s);
         lev[s]=;
         vis[s]=;
         while(!q.empty())
         {
             int now=q.front(); q.pop();
             for(int i=,_size=G[now].size();i<_size;i++)
             {
                 Edge edge=E[G[now][i]];
                 int nex=edge.v;
                 if(!vis[nex] && edge.c>edge.f)
                 {
                     lev[nex]=lev[now]+;
                     q.push(nex);
                     vis[nex]=;
                 }
             }
         }
         return vis[t];
     }
     int dfs(int now,int aug)
     {
         if(now==t || aug==) return aug;
         int flow=,f;
         for(int& i=cur[now],_size=G[now].size();i<_size;i++)
         {
             Edge& edge=E[G[now][i]];
             int nex=edge.v;
             if(lev[now]+ == lev[nex] && (f=dfs(nex,min(aug,edge.c-edge.f)))>)
             {
                 edge.f+=f;
                 E[G[now][i]^].f-=f;
                 flow+=f;
                 aug-=f;
                 if(!aug) break;
             }
         }
         return flow;
     }
     int maxflow()
     {
         int flow=;
         while(bfs())
         {
             memset(cur,,sizeof(cur));
             flow+=dfs(s,INF);
         }
         return flow;
     }
 }dinic;
 int main()
 {
     scanf("%d%d%d%d%d",&K,&N,&M,&S,&F);
     for(int i=,x;i<=N;i++)
     {
         scanf("%d",&x);
         dinic.addedge(in(i),out(i),x);
         dinic.addedge(out(i),in(i),x);
     }
     for(int i=,a,b;i<=M;i++)
     {
         scanf("%d%d",&a,&b);
         dinic.addedge(out(a),in(b),INF);
         dinic.addedge(out(b),in(a),INF);
     }
     if(S==F){
         printf("NO\n");
         return ;
     }
     dinic.s=out(S), dinic.t=in(F);
     if(dinic.maxflow()<=K) printf("YES\n");
     else printf("NO\n");
     return ;
 }