/*
translation:
n个城市,从0出发,要遍历所有得城市。在访问城市i之前必须已经访问完所有j(j<i)得城市。现在最多有k
个人,求这k个人遍历完所有的城市所走的最小距离。
solution:
最小费用流
添加源点、汇点。源点和0之间添加容量为k,费用0的边。0和汇点添加容量k,费用0的边(因为不必k个人全都用)
将每个点拆成i、i+n。i、i+n之间添加容量1,费用-INF的边。对每个编号大于i的城市j,在i+n,j之间添加容量1,
费用为城市i、j之间的最短距离。如此建图之后,再求最小费用流
note:
# 一开始的思路建图少了两个步骤,考虑到没有必须用到k个人,所以在0->t之间必须添加费用0,容量k的边,但是
这样的话求出来的费用是0,因为都走这条边了。为了能让走其它的城市,所以还必须将城市拆点,再在拆成的两个
点之间添加费用负无穷的边,使得尽量遍历所有的城市。
*/
#include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 205;
const int INF = 1000000;
typedef pair<int,int> P;
struct Edge
{
int to, cap, cost, rev;
Edge(int to_, int cap_, int cost_, int rev_):to(to_),cap(cap_),cost(cost_),rev(rev_){}
};
vector<Edge> G[maxn];
int V, n, m, k, min_dist[maxn][maxn];
int h[maxn], dist[maxn], prevv[maxn], preve[maxn];
void add_edge(int from, int to, int cap, int cost)
{
G[from].push_back(Edge(to, cap, cost, G[to].size()));
G[to].push_back(Edge(from, 0, -cost, G[from].size()-1));
}
int min_cost_flow(int s, int t, int f)
{
int res = 0;
while(f > 0) {
fill(dist, dist + V, INF);
dist[s] = 0;
bool update = true;
while(update) {
update = false;
for(int v = 0; v < V; v++) {
if(dist[v] == INF) continue;
for(int i = 0; i < G[v].size(); i++) {
Edge& e = G[v][i];
if(e.cap > 0 && dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
prevv[e.to] = v;
preve[e.to] = i;
update = true;
}
}
}
}
if(dist[t] == INF) return -1;
int d = f;
for(int v = t; v != s; v = prevv[v]) {
d = min(d, G[prevv[v]][preve[v]].cap);
}
f -= d;
res += d * dist[t];
for(int v = t; v != s; v = prevv[v]) {
Edge& e = G[prevv[v]][preve[v]];
e.cap -= d;
G[v][e.rev].cap += d;
}
}
return res;
}
int main()
{
while(~scanf("%d%d%d", &n, &m, &k), n || m || k) {
for(int i = 0; i < maxn; i++) G[i].clear();
for(int i = 0; i < maxn; i++)
for(int j = 0; j < maxn; j++)
min_dist[i][j] = INF;
for(int i = 0; i < maxn; i++) min_dist[i][i] = 0;
int u, v, w;
for(int i = 0; i < m; i++) {
scanf("%d%d%d", &u, &v, &w);
min_dist[u][v] = min(min_dist[u][v], w);
min_dist[v][u] = min_dist[u][v];
}
for(int k = 0; k <= n; k++) {
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= n; j++) {
min_dist[i][j] = min(min_dist[i][j], min_dist[i][k] + min_dist[k][j]);
}
}
}
int s = 2 * n + 1, t = s + 1;
V = t + 1;
add_edge(s, 0, k, 0);
add_edge(0, t, k, 0);
for(int i = 1; i <= n; i++) {
for(int j = i + 1; j <= n; j++) {
add_edge(i + n, j, 1, min_dist[i][j]);
}
add_edge(0, i, 1, min_dist[0][i]);
add_edge(i + n, t, 1, min_dist[i][0]);
add_edge(i, i + n, 1, -INF);
}
printf("%d\n", min_cost_flow(s, t, k) + n * INF);
}
return 0;
}
hdu4411(#最小费用流)
最新推荐文章于 2018-08-22 21:47:15 发布