链接:点击打开链接
题意:给出一个n个点,m条边组成的无向图,给出S和T。对于图中的每个点,去掉这个点都需要一定的花费。求最少多少花费才能使得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[100005];
int R,S,T;
int dis[505],iter[505];
vector<int> tab[505];
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;
} // dinic模板
int main(){
int n,m,i,u,v,num;
while(scanf("%d%d",&n,&m)!=EOF){
R=0; //将一个点拆成两个点从而将点权转换为边权
for(i=0;i<=2*n;i++)
tab[i].clear();
scanf("%d%d",&S,&T);
T+=n;
for(i=1;i<=n;i++){
scanf("%d",&num);
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;
}