题意:给一个n个点,m条边的无向图,有些不法分子要从S点T点,现在要抓住所有的不法分子阻止他们去T,那么就要控制某一些城市等待他们,控制每个城市花费不同,问最少花费是多少。
题解:最大流
看题目,是求最小割,那么最大流的值就等于最小割的容量。
由于只给出了点,我们将点的花费拆成边,即a->b
拆成a->a+n->b->b+n
,由于双向边,注意一下连的时候的顺序以及终点,具体见代码。
这里用的sap。
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
/*
* SAP 邻接矩阵形式
* 点的编号从 0 开始
* 增加个 flow 数组,保留原矩阵 maze, 可用于多次使用最大流
*/
const int MAXN = 1100;
int maze[MAXN][MAXN];
int gap[MAXN], dis[MAXN], pre[MAXN], cur[MAXN];
int flow[MAXN][MAXN];//存最大流的流量
int sap(int start, int end, int nodenum) {
memset(cur, 0, sizeof(cur));
memset(dis, 0, sizeof(dis));
memset(gap, 0, sizeof(gap));
memset(flow, 0, sizeof(flow));
int u = pre[start] = start, maxflow = 0, aug = -1;
gap[0] = nodenum;
while (dis[start] < nodenum) {
loop:
for (int v = cur[u]; v < nodenum; v++)
if (maze[u][v] - flow[u][v] && dis[u] == dis[v] + 1) {
if (aug == -1 || aug > maze[u][v] - flow[u][v]) aug = maze[u][v] - flow[u][v];
pre[v] = u;
u = cur[u] = v;
if (v == end) {
maxflow += aug;
for (u = pre[u]; v != start; v = u, u = pre[u]) {
flow[u][v] += aug;
flow[v][u] -= aug;
}
aug = -1;
}
goto loop;
}
int mindis = nodenum - 1;
for (int v = 0; v < nodenum; v++)
if (maze[u][v] - flow[u][v] && mindis > dis[v]) {
cur[u] = v;
mindis = dis[v];
}
if ((--gap[dis[u]]) == 0) break;
gap[dis[u] = mindis + 1]++;
u = pre[u];
}
return maxflow;
}
int n, m, s, t, co, u, v;
int main() {
while (~scanf("%d%d", &n, &m)) {
memset(maze, 0, sizeof(maze));
scanf("%d%d", &s, &t); s--; t--;
for (int i = 0; i < n; i++) {
scanf("%d", &co);
maze[i][i + n] = co;
maze[i + n][i] = co;
}
for (int i = 1; i <= m; i++) {
scanf("%d%d", &u, &v); u--; v--;
maze[u + n][v] = inf;
maze[v + n][u] = inf; //注意这边的连线
}
printf("%d\n", sap(s, t + n, 2 * n)); //注意终点
}
return 0;
}