问题
分析
将问题转化为最小割问题,主要难点在数学模型的建立
将草和洞分隔开,使人联想到了割的概念,从而想到了最大流最小割定理,可以将问题转化为最大流模型
首先外围的格子上必须种草,如果有洞,就把洞变为草
里面的各自中有洞和草,如何表示洞和草之间的转化费用?添加源点s和宿点t,规定和s相连的是草,和t相连的是洞,那么把草和洞抽象成点,s->草 洞->t建立图,s->洞之间边的容量是d,洞->t之间的容量是f,表示切断费用,s->边缘点的容量是Inf,表示无法切断
相邻两个格子u,v,需要连接两条边u->v,v->u,如果u是草,v是洞,那么需要切断u->v,反之就要切断v->u,uv之间的容量是b,表示切断所需要的费用
画出的图可以分为五部分点,s,外围的草,内部的草,内部的洞,t
可以使用
###
#.#
###
这样的尝试画下拓扑
大概的拓扑是s->草 ,洞->t,相邻格子之间有边相连
洞->t之间的边达到最大容量就相当于洞变为草,草和洞之间有四条边相连,代表的是围栏费用
求出最大流,就是能把图分为两部分的最小割的大小,也就是最小代价
感觉还是挺抽象的
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <utility>
#include <map>
#include <string>
#include <queue>
#include <utility>
using namespace std;
const int maxn=2505,Inf=0x3f3f3f3f;
struct Edge{
int from,to,cap,flow;
Edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow){}
};
struct EdmondsKarp{
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
int a[maxn];
int p[maxn];
void init(int n){
this->n=n;
for(int i=0;i<n;++i) G[i].clear();
edges.clear();
}
void AddEdges(int from,int to,int cap){
edges.push_back(Edge(from,to,cap,0));
edges.push_back(Edge(to,from,0,0));
m=edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
int Maxflow(int s,int t){
int flow=0;
while(true){
memset(a,0,sizeof(a));
a[s]=Inf;
queue<int> Q;
Q.push(s);
while(!Q.empty()){
int x=Q.front();
Q.pop();
for(int i=0;i<G[x].size();++i){
Edge &e=edges[G[x][i]];
if(!a[e.to] && e.cap>e.flow){
a[e.to]=min(a[x],e.cap-e.flow);
p[e.to]=G[x][i];
Q.push(e.to);
}
}
if(a[t]) break;
}
if(!a[t]) break;
flow+=a[t];
for(int u=t;u!=s;u=edges[p[u]].from){
edges[p[u]].flow+=a[t];
edges[p[u]^1].flow-=a[t];
}
}
return flow;
}
};
int kase,w,h,d,f,b,cost,n;
char ch[55][55];
int dx[]={0,0,-1,1},dy[]={-1,1,0,0};
EdmondsKarp ek;
int main(void){
scanf("%d",&kase);
while(kase--){
cost=0;
n=0;
scanf("%d%d",&w,&h);
scanf("%d%d%d",&d,&f,&b);
for(int i=0;i<h;++i){
scanf("%s",ch[i]);
}
int t=w*h;
ek.init(t+2);
//处理外部的'.',将它们变成'#’
for(int i=0;i<w;++i){
if(ch[0][i]=='.'){ cost+=f; ch[0][i]='#'; }
if(ch[h-1][i]=='.'){ cost+=f; ch[h-1][i]='#'; }
}
for(int i=0;i<h;++i){
if(ch[i][0]=='.'){ cost+=f; ch[i][0]='#'; }
if(ch[i][w-1]=='.'){ cost+=f; ch[i][w-1]='#'; }
}
for(int i=0;i<h;++i){
int t2=i*w;
for(int j=0;j<w;++j){
if(i==0 || j==0 || i==h-1 || j==w-1)
ek.AddEdges(t,t2+j,Inf);
else if(ch[i][j]=='#') ek.AddEdges(t,t2+j,d);
else ek.AddEdges(t2+j,t+1,f);
for(int k=0;k<4;++k){
int nx=i+dx[k],ny=j+dy[k];
if(nx<0 || nx >=h || ny<0 || ny>=w) continue;
ek.AddEdges(t2+j,nx*w+ny,b);
}
}
}
int ans=ek.Maxflow(t,t+1);
printf("%d\n",cost+ans);
}
return 0;
}
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <utility>
#include <map>
#include <string>
#include <queue>
#include <utility>
using namespace std;
const int maxn=2505,Inf=0x3f3f3f3f;
struct Edge{
int from,to,cap,flow;
Edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow){}
};
struct Dinic{
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
int d[maxn];
void init(int n){
this->n=n;
for(int i=0;i<n;++i) G[i].clear();
edges.clear();
}
void AddEdges(int from,int to,int cap){
edges.push_back(Edge(from,to,cap,0));
edges.push_back(Edge(to,from,0,0));
m=edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool BFS(int s,int t){
memset(d,-1,sizeof(d));
d[s]=0;
queue<int> Q;
Q.push(s);
while(!Q.empty()){
int x=Q.front();
Q.pop();
for(int i=0;i<G[x].size();++i){
Edge &e=edges[G[x][i]];
if(e.cap>e.flow && d[e.to]<0){
d[e.to]=d[x]+1;
Q.push(e.to);
if(e.to==t) return true;
}
}
}
return d[t]>=0;
}
int DFS(int cur,int t,int a){
if(cur==t || a==0) return a;
int flow=0,f;
for(int i=0;i<G[cur].size();++i){
Edge &e=edges[G[cur][i]];
if(d[e.to]==d[cur]+1 && (f=DFS(e.to,t,min(a,e.cap-e.flow)))>0){
flow+=f;
a-=f;
e.flow+=f;
edges[G[cur][i]^1].flow-=f;
if(a==0) return flow;
}
}
return flow;
}
int Maxflow(int s,int t){
int flow=0;
while(BFS(s,t))
flow+=DFS(s,t,Inf);
return flow;
}
};
int kase,w,h,d,f,b,cost,n;
char ch[55][55];
int dx[]={0,0,-1,1},dy[]={-1,1,0,0};
Dinic din;
int main(void){
scanf("%d",&kase);
while(kase--){
cost=0;
n=0;
scanf("%d%d",&w,&h);
scanf("%d%d%d",&d,&f,&b);
for(int i=0;i<h;++i){
scanf("%s",ch[i]);
}
int t=w*h;
din.init(t+2);
//处理外部的'.',将它们变成'#’
for(int i=0;i<w;++i){
if(ch[0][i]=='.'){ cost+=f; ch[0][i]='#'; }
if(ch[h-1][i]=='.'){ cost+=f; ch[h-1][i]='#'; }
}
for(int i=0;i<h;++i){
if(ch[i][0]=='.'){ cost+=f; ch[i][0]='#'; }
if(ch[i][w-1]=='.'){ cost+=f; ch[i][w-1]='#'; }
}
//计算格子(i,j)和左边,上面的格子之间是否有边存在
for(int i=0;i<h;++i){
int t2=i*w;
for(int j=0;j<w;++j){
if(i==0 || j==0 || i==h-1 || j==w-1)
din.AddEdges(t,t2+j,Inf);
else if(ch[i][j]=='#') din.AddEdges(t,t2+j,d);
else din.AddEdges(t2+j,t+1,f);
for(int k=0;k<4;++k){
int nx=i+dx[k],ny=j+dy[k];
if(nx<0 || nx >=h || ny<0 || ny>=w) continue;
din.AddEdges(t2+j,nx*w+ny,b);
}
}
}
int ans=din.Maxflow(t,t+1);
printf("%d\n",cost+ans);
}
return 0;
}
当前弧优化后的Dinic:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <utility>
#include <map>
#include <string>
#include <queue>
#include <utility>
using namespace std;
const int maxn=2505,Inf=0x3f3f3f3f;
struct Edge{
int from,to,cap,flow;
Edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow){}
};
struct Dinic{
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
int d[maxn];
int cur[maxn];
void init(int n){
this->n=n;
for(int i=0;i<n;++i) G[i].clear();
edges.clear();
}
void AddEdges(int from,int to,int cap){
edges.push_back(Edge(from,to,cap,0));
edges.push_back(Edge(to,from,0,0));
m=edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool BFS(int s,int t){
memset(d,-1,sizeof(d));
d[s]=0;
queue<int> Q;
Q.push(s);
while(!Q.empty()){
int x=Q.front();
Q.pop();
for(int i=0;i<G[x].size();++i){
Edge &e=edges[G[x][i]];
if(e.cap>e.flow && d[e.to]<0){
d[e.to]=d[x]+1;
Q.push(e.to);
if(e.to==t) return true;
}
}
}
return d[t]>=0;
}
int DFS(int x,int t,int a){
if(x==t || a==0) return a;
int flow=0,f;
for(int &i=cur[x];i<G[x].size();++i){
Edge &e=edges[G[x][i]];
if(d[e.to]==d[x]+1 && (f=DFS(e.to,t,min(a,e.cap-e.flow)))>0){
flow+=f;
a-=f;
e.flow+=f;
edges[G[x][i]^1].flow-=f;
if(a==0) return flow;
}
}
return flow;
}
int Maxflow(int s,int t){
int flow=0;
while(BFS(s,t)) {
memset(cur,0,sizeof(cur));
flow += DFS(s, t, Inf);
}
return flow;
}
};
int kase,w,h,d,f,b,cost,n;
char ch[55][55];
int dx[]={0,0,-1,1},dy[]={-1,1,0,0};
Dinic din;
int main(void){
scanf("%d",&kase);
while(kase--){
cost=0;
n=0;
scanf("%d%d",&w,&h);
scanf("%d%d%d",&d,&f,&b);
for(int i=0;i<h;++i){
scanf("%s",ch[i]);
}
int t=w*h;
din.init(t+2);
//处理外部的'.',将它们变成'#’
for(int i=0;i<w;++i){
if(ch[0][i]=='.'){ cost+=f; ch[0][i]='#'; }
if(ch[h-1][i]=='.'){ cost+=f; ch[h-1][i]='#'; }
}
for(int i=0;i<h;++i){
if(ch[i][0]=='.'){ cost+=f; ch[i][0]='#'; }
if(ch[i][w-1]=='.'){ cost+=f; ch[i][w-1]='#'; }
}
//计算格子(i,j)和左边,上面的格子之间是否有边存在
for(int i=0;i<h;++i){
int t2=i*w;
for(int j=0;j<w;++j){
if(i==0 || j==0 || i==h-1 || j==w-1)
din.AddEdges(t,t2+j,Inf);
else if(ch[i][j]=='#') din.AddEdges(t,t2+j,d);
else din.AddEdges(t2+j,t+1,f);
for(int k=0;k<4;++k){
int nx=i+dx[k],ny=j+dy[k];
if(nx<0 || nx >=h || ny<0 || ny>=w) continue;
din.AddEdges(t2+j,nx*w+ny,b);
}
}
}
int ans=din.Maxflow(t,t+1);
printf("%d\n",cost+ans);
}
return 0;
}