链接:点击打开链接
题意:有n个城市和m条道双向路,一伙小偷准备从S城出发到T城盗窃,为了将这伙小偷抓住,需要在这N个城市中的每一个城市安排一定数量的警察,S点和T点不能放警察,问总共需要的最少警察数
代码:
#include <queue>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
using namespace std;
const int INF=0x3f3f3f3f;
struct node{
int u,v,cap;
node(){}
node(int u,int v,int cap):u(u),v(v),cap(cap){}
}es[50005];
int R,S,T;
int dis[5005],vis[5005],iter[5005];
vector<int> tab[5005];
void addedge(int u, int v, int cap){
tab[u].push_back(R);
es[R++]=node(u,v,cap);
tab[v].push_back(R);
es[R++]=node(v,u,0);
}
int bfs(){
int i,h;
queue<int> q;
q.push(S);
memset(dis,INF,sizeof(dis));
dis[S]=0;
while(q.size()){
h=q.front();
q.pop();
for(i=0;i<tab[h].size();i++){
node &e=es[tab[h][i]];
if(e.cap>0&&dis[e.v]==INF){
dis[e.v]=dis[h]+1;
q.push(e.v);
}
}
}
return dis[T]<INF;
}
int dfs(int x,int maxflow){
int flow;
if(x==T)
return maxflow;
for(int &i=iter[x];i<tab[x].size();i++){
node &e=es[tab[x][i]];
if(dis[e.v]==dis[x]+1&&e.cap>0){
flow=dfs(e.v,min(maxflow,e.cap));
if(flow){
e.cap-=flow;
es[tab[x][i]^1].cap+=flow;
return flow;
}
}
}
return 0;
}
int dinic(){
int ans,flow;
ans=0;
while(bfs()){
memset(iter,0,sizeof(iter));
while(flow=dfs(S,INF))
ans+=flow;
}
return ans;
}
int main(){ //相当于直接求最小割,只不过是割点
int N,M,i,j,u,v,t,ans,num;
scanf("%d",&t);
while(t--){
scanf("%d%d%d%d",&N,&M,&S,&T);
R=0;
for(i=0;i<=2*N;i++)
tab[i].clear();
for(i=1;i<=N;i++){
scanf("%d",&num);
if(i==S||i==T)
addedge(i,i+N,INF); //拆点将点权变为边权
else //并保证起点终点不会被用
addedge(i,i+N,num);
}
for(i=0;i<M;i++){
scanf("%d%d",&u,&v);
addedge(u+N,v,INF); //双向边
addedge(v+N,u,INF);
}
printf("%d\n",dinic());
}
return 0;
}