HDU-4289 Control（最大流最小割+拆点）

题目链接：HDU-4289 Control

You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD 1 from one city (the source) to another one (the destination). You know their date, source and destination, and they are using the highway network.
　　The highway network consists of bidirectional highways, connecting two distinct city. A vehicle can only enter/exit the highway network at cities only.
　　You may locate some SA (special agents) in some selected cities, so that when the terrorists enter a city under observation (that is, SA is in this city), they would be caught immediately.
　　It is possible to locate SA in all cities, but since controlling a city with SA may cost your department a certain amount of money, which might vary from city to city, and your budget might not be able to bear the full cost of controlling all cities, you must identify a set of cities, that:
　　* all traffic of the terrorists must pass at least one city of the set.
　　* sum of cost of controlling all cities in the set is minimal.
　　You may assume that it is always possible to get from source of the terrorists to their destination.

Input

There are several test cases.
　　The first line of a single test case contains two integer N and M ( 2 <= N <= 200; 1 <= M <= 20000), the number of cities and the number of highways. Cities are numbered from 1 to N.
　　The second line contains two integer S,D ( 1 <= S,D <= N), the number of the source and the number of the destination.
　　The following N lines contains costs. Of these lines the ith one contains exactly one integer, the cost of locating SA in the ith city to put it under observation. You may assume that the cost is positive and not exceeding 10 7.
　　The followingM lines tells you about highway network. Each of these lines contains two integers A and B, indicating a bidirectional highway between A and B.
　　Please process until EOF (End Of File).

Output

For each test case you should output exactly one line, containing one integer, the sum of cost of your selected set.
　　See samples for detailed information.

Sample Input

5 6
5 3
5
2
3
4
12
1 5
5 4
2 3
2 4
4 3
2 1

Sample Output

3

---

题意：

有一含有N个结点M条边的图，每个点都有各自的点权，其中有起点S和终点T，现要删除部分点使得S和T不连通，求删除的最小点权和。

---

分析：

很容易想到求最小割，但是最小割求的是删除的最小边权，那么这里就要用到拆点的技巧。
详见：https://www.cnblogs.com/tweetuzki/p/10422496.html#一总述

注意该题为双向边，所以拆点方法如下（u’ = u+n)

该题中对于一个点u，需要拆为 u -> u+n 和 u+n -> u，其中边权即为点权

而对于边u - v，则需要拆为 u+n -> v 和 v+n -> u，其中边权为INF

此外因为起点和终点也拆成了边，所以 源点s=S，汇点 t = T+n

此外，求最小割时反向边容量一般不会为0（而是等于正向边)，但在这里，因为是将点拆分，且在拆分时就是构建的双向边，所以这里还是需要定反向边容量为0。

---

以下代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<map>
#include<algorithm>
#define LL long long
using namespace std;
const int INF=