【BZOJ1070】【SCOI2007】修车

【题目链接】

• 点击打开链接
  

【思路要点】

• 补档博客，无题解。

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN	105
#define MAXP	1005
#define MAXQ	1000005
#define INF	1e9
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
struct edge {int dest, flow, cost; unsigned home; };
vector <edge> a[MAXP];
int Cost[MAXN][MAXN];
int tot, point[MAXN][MAXN];
int s, t, flow, cost, len;
int dist[MAXP], path[MAXP];
unsigned home[MAXP];
bool spfa() {
	static int q[MAXQ];
	static bool inq[MAXP];
	int l = 0, r = 0;
	q[0] = s; dist[s] = 0;
	inq[s] = true;
	while (l <= r) {
		int tmp = q[l++];
		inq[tmp] = false;
		for (unsigned i = 0; i < a[tmp].size(); i++)
			if (a[tmp][i].flow != 0 && dist[tmp] + a[tmp][i].cost < dist[a[tmp][i].dest]) {
				dist[a[tmp][i].dest] = dist[tmp] + a[tmp][i].cost;
				path[a[tmp][i].dest] = tmp;
				home[a[tmp][i].dest] = i;
				if (!inq[a[tmp][i].dest]) {
					inq[a[tmp][i].dest] = true;
					q[++r] = a[tmp][i].dest;
				}
			}
	}
	len = dist[t];
	for (int i = 0; i <= r; i++)
		dist[q[i]] = INF;
	return len != INF;
}
void flow_path() {
	int p = t, ans = INF;
	while (p != s) {
		ans = min(ans, a[path[p]][home[p]].flow);
		p = path[p];
	}
	flow += ans; cost += ans * len; p = t;
	while (p != s) {
		a[path[p]][home[p]].flow -= ans;
		a[p][a[path[p]][home[p]].home].flow += ans;
		p = path[p];
	}
}
void addedge(int s, int t, int flow, int cost) {
	a[s].push_back((edge) {t, flow, cost, a[t].size()});
	a[t].push_back((edge) {s, 0, -cost, a[s].size() - 1});
}
int main() {
	int n, m; read(m), read(n);
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= m; j++)
		read(Cost[i][j]);
	s = 0; tot = n;
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= m; j++) {
		point[i][j] = ++tot;
		addedge(s, tot, 1, 0);
	}
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= m; j++)
	for (int k = 1; k <= n; k++)
		addedge(point[i][j], k, 1, i * Cost[k][j]);
	t = ++tot;
	for (int i = 1; i <= n; i++)
		addedge(i, t, 1, 0);
	for (int i = 0; i <= t; i++)
		dist[i] = INF;
	while (spfa())
		flow_path();
	printf("%.2lf\n", (double) cost / n);
	return 0;
}