http://codevs.cn/problem/1912/
题解:
看到题后第一反应就是费用流,因为求的就是最小费用,还要加入邮箱中剩余油量为参数,因为剩余油量不同到达那个结点后所要执行的操作也不同,因此按油量多少建立Z层图,每个结点向相邻结点的下一层连一条容量为1的边,费用看要求来定。最后输出最小费用。
后来看了题解,发现这个题更好的做法是分层图最短路。想想也是,所有的边容量都是1,而且与源点相连的边容量也是1,那最大流就是1啊,这根求最短路有什么区别?直接把费用改成路径权值SPFA不就行了。
好像发现了求最短路的新方法——网络流,不过……作死而已。
还有一个题目,分层图最短路要更简单,而且BFS就行了:
[codevs 1911] 孤岛营救问题
代码:
总时间耗费: 1895ms
总内存耗费: 52 kB
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 1000000;
const int INF = 1e9 + 7;
struct Edge {
int from, to, cap, flow, cost;
};
int s, t;
vector<int> G[maxn];
vector<Edge> edges;
void AddEdge(int from, int to, int cap, int cost) {
edges.push_back((Edge){from, to, cap, 0, cost});
edges.push_back((Edge){to, from, 0, 0, -cost});
int m = edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
int d[maxn], p[maxn], a[maxn];
bool inq[maxn];
bool BellmanFord(int& cost) {
memset(inq, 0, sizeof(inq));
for(int i = s; i <= t; i++) d[i] = INF;
d[s] = 0; inq[s] = 1; p[s] = 0; a[s] = INF;
queue<int> Q;
Q.push(s);
while(!Q.empty()) {
int x = Q.front(); Q.pop();
inq[x] = 0;
for(int i = 0; i < G[x].size(); i++) {
Edge& e = edges[G[x][i]];
if(e.cap > e.flow && d[e.to] > d[x] + e.cost) {
d[e.to] = d[x] + e.cost;
a[e.to] = min(a[x], e.cap-e.flow);
p[e.to] = G[x][i];
if(!inq[e.to]) { Q.push(e.to); inq[e.to] = 1; }
}
}
}
if(d[t] == INF) return 0;
cost += d[t]*a[t];
int x = t;
while(x != s) {
edges[p[x]].flow += a[t];
edges[p[x]^1].flow -= a[t];
x = edges[p[x]].from;
}
return 1;
}
int MincostMaxflow() {
int cost = 0;
while(BellmanFord(cost));
return cost;
}
int N, K, A, B, C, delta;
int encode(int x, int y, int z) {
return delta*z + (x-1)*N + y;
}
int main() {
cin >> N >> K >> A >> B >> C;
s = 0; delta = N*N; t = delta*(K+1) + 1;
for(int x = 1; x <= N; x++)
for(int y = 1; y <= N; y++) {
bool flag; cin >> flag;
for(int z = 0; z <= K; z++) {
int from = encode(x, y, z);
int newz = (flag? K:z) - 1;
if(!flag && z < K) AddEdge(from, encode(x, y, K), 1, C+A);
if(newz < 0) continue;
if(flag && z < K) { AddEdge(from, encode(x, y, K), 1, A); continue; }
if(x > 1) AddEdge(from, encode(x-1, y, newz), 1, B);
if(y > 1) AddEdge(from, encode(x, y-1, newz), 1, B);
if(x < N) AddEdge(from, encode(x+1, y, newz), 1, 0);
if(y < N) AddEdge(from, encode(x, y+1, newz), 1, 0);
}
}
AddEdge(s, encode(1, 1, K), 1, 0);
for(int k = 0; k <= K; k++) AddEdge(encode(N, N, k), t, 1, 0);
cout << MincostMaxflow() << endl;
return 0;
}