题意:
有N个城市,现在城市S出现了一伙歹徒,他们想运送一些炸弹到D城市,不过警方已经得到了线报知道他们的事情,不过警察不知道他们所在的具体位置,所以只能采取封锁城市的办法来阻断暴徒,封锁不同的城市代价不同,问阻断暴徒从S城市到达D城市的最小需要花费的代价。
思路:
城市有代价,将城市拆点,连一条边,容量为代价。不同城市之间的容量为INF。跑最大流。
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
const int INF = 0x3f3f3f3f;
const int maxn = 400+5;
const int maxm = 180000+50;
typedef long long LL;
using namespace std;
int n,m;
// 图
struct Edge{
int v, cap, flow, next;
};
Edge edges[maxm];
int head[maxn], cnt;
int dis[maxn]; // 分层的编号
int cur[maxn]; // 当前弧,重要优化!!!
void init(){
cnt = 0;
memset(head, -1, sizeof(head));
}
void addEdge(int u, int v, int cap){
edges[cnt].v = v; edges[cnt].cap = cap; edges[cnt].flow = 0;
edges[cnt].next = head[u]; head[u] = cnt++;
// 反向弧
edges[cnt].v = u; edges[cnt].cap = 0; edges[cnt].flow = 0;
edges[cnt].next = head[v]; head[v] = cnt++;
}
// 分层
int Q[maxn]; // 模拟队列
bool bfs(int s, int t){
memset(dis, -1, sizeof(dis));
dis[s] = 0;
int front = 0, rear = 0;
Q[rear++] = s;
while(front < rear){
int x = Q[front++];
if(x == t) return true;
for(int i = head[x]; i != -1; i = edges[i].next){
Edge& e = edges[i];
if(dis[e.v] == -1&&e.cap > e.flow){
dis[e.v] = dis[x] + 1;
Q[rear++] = e.v;
}
}
}
return dis[t] != -1;
}
int dfs(int s, int t, int cur_flow){
if(s == t||cur_flow == 0) return cur_flow;
int ans = 0;
for(int& i = cur[s]; i != -1; i = edges[i].next){
int c = i;
Edge e = edges[c];
if(dis[e.v] == dis[s] + 1&&e.cap > e.flow){
int a2 = min(cur_flow, e.cap-e.flow);
int w = dfs(e.v, t, a2);
edges[c].flow += w;
edges[c^1].flow -= w;
cur_flow -= w;
ans += w;
if(cur_flow <= 0) break;
}
}
return ans;
}
// 最大流
int Dinic(int s, int t){
int ans = 0;
while(bfs(s,t)){
memcpy(cur, head, sizeof(head));
ans += dfs(s,t,INF);
}
return ans;
}
int main()
{
freopen("in.txt","r",stdin);
int s,t;
while(scanf("%d%d",&n,&m) == 2){
init();
scanf("%d%d",&s,&t);
for(int i = 1; i <= n; ++i){
int c; scanf("%d",&c);
addEdge(i, i+n, c);
}
for(int i = 0; i < m; ++i){
int a,b; scanf("%d%d",&a,&b);
addEdge(n+a, b, INF); addEdge(b+n, a, INF);
}
printf("%d\n",Dinic(s, n+t));
}
fclose(stdin);
return 0;
}