题意:输入一个h行w列的字符矩阵,草地用‘#’表示,洞用‘.'表示,可以把草改成洞,每格花费为d,也可以把洞填上草,每格花费为f。最后还需要在草和洞之间修围栏,每条边的花费为b。整个矩阵的四周必须是草,问最小花费是多少?
题解:参考了传送门
附上代码:
#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn=3e3+50;
struct Edge {
int from, to, cap, flow;
Edge(int u, int v, int c, int f):from(u),to(v),cap(c),flow(f) {}
};
struct EdmondsKarp {
int n, m;
vector<Edge> edges; // 边数的两倍
vector<int> G[maxn]; // 邻接表,G[i][j]表示结点i的第j条边在e数组中的序号
int a[maxn]; // 当起点到i的可改进量
int p[maxn]; // 最短路树上p的入弧编号
void init(int n) {
for(int i = 0; i < n; i++) G[i].clear();
edges.clear();
}
void AddEdge(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;
for(;;) {
memset(a, 0, sizeof(a));
queue<int> Q;
Q.push(s);
a[s] = INF;
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) {
p[e.to] = G[x][i];
a[e.to] = min(a[x], e.cap-e.flow);
Q.push(e.to);
}
}
if(a[t]) break;
}
if(!a[t]) break;
for(int u = t; u != s; u = edges[p[u]].from) {
edges[p[u]].flow += a[t];
edges[p[u]^1].flow -= a[t];
}
flow += a[t];
}
return flow;
}
};
EdmondsKarp g;
int w,h;
char pool[99][99];
inline int ID(int i,int j)
{
return i*w+j;
}
int main()
{
int T,d,f,b;
scanf("%d",&T);
while(T--){
scanf("%d%d%d%d%d",&w,&h,&d,&f,&b);
for(int i=0;i<h;i++){
scanf("%s",pool[i]);
}
int cost=0;
for(int i=0;i<h;i++){
if(pool[i][0]=='.'){
pool[i][0]='#';cost+=f;
}
if(pool[i][w-1]=='.'){
pool[i][w-1]='#';cost+=f;
}
}
for(int i=1;i<w-1;i++){
if(pool[0][i]=='.'){
pool[0][i]='#';cost+=f;
}
if(pool[h-1][i]=='.'){
pool[h-1][i]='#';cost+=f;
}
}
g.init(h*w+2);
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(pool[i][j]=='#'){
int cap=INF;
if(i!=0&&i!=h-1&&j!=0&&j!=w-1){
cap=d;
}
g.AddEdge(h*w,ID(i,j),cap);
}else{
g.AddEdge(ID(i,j),h*w+1,f);
}
if(i>0){
g.AddEdge(ID(i,j),ID(i-1,j),b);
}
if(i<h-1){
g.AddEdge(ID(i,j),ID(i+1,j),b);
}
if(j>0){
g.AddEdge(ID(i,j),ID(i,j-1),b);
}
if(j<w-1){
g.AddEdge(ID(i,j),ID(i,j+1),b);
}
}
}
printf("%d\n",cost+g.Maxflow(h*w,h*w+1));
}
return 0;
}