51nod2905 奔小康赚大钱

题目

题目链接

解题思路

非常明显的费用流。
这里有两点需要注意：
1.求得是最大收益，因此要跑最大费用最大流。即spfa时求的是最长路。
2.图是完全图，属于稠密图。单纯的spfa会TLE。需要SLF优化，即当松弛后点的距离比队头小则放到队头，否则放到队尾。
如此能够通过此题。

代码

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <deque>
using namespace std;

typedef long long ll;

const int N = 610;

struct edge {
	int to, rev;
	ll cap, w;
	edge() {}
	edge(int to, ll cap, ll w, int rev):to(to), cap(cap), w(w), rev(rev) {}
};

vector<edge> G[N];
int fr[N], idx[N];
ll dis[N], flow[N];
bool vis[N];

void addedge(int from, int to, ll cap, ll w) {
	G[from].push_back(edge(to, cap, w, G[to].size()));
	G[to].push_back(edge(from, 0, -w, G[from].size() - 1));
}

bool spfa(int s, int t) {
	for (int i = 1; i <= t; i++) dis[i] = -1e18, flow[i] = 1e18;
	dis[s] = 0;
	deque<int> Q;
	Q.push_back(s);
	while (!Q.empty()) {
		int u = Q.front(); Q.pop_front();
		vis[u] = false;
		for (int i = 0; i < G[u].size(); i++) {
			edge e = G[u][i];
			if (e.cap > 0 && dis[e.to] < dis[u] + e.w) {
				dis[e.to] = dis[u] + e.w;
				fr[e.to] = u; idx[e.to] = i;
				flow[e.to] = min(flow[u], e.cap);
				if (!vis[e.to]) {
					vis[e.to] = true;
					if (e.w > 0) Q.push_back(e.to);
					else Q.push_front(e.to);
				}
			}
		}
	}
	return dis[t] > -1e17;
}

ll MCMF(int s, int t) {
	ll ans = 0, i = 0;;
	while (spfa(s, t)) {
		ans += dis[t] * flow[t];
		int x = t;
		while (x != s) {
			edge &e = G[fr[x]][idx[x]];
			e.cap -= flow[t];
			G[e.to][e.rev].cap += flow[t];
			x = fr[x];
		}
	}
	return ans;
}

int n;

int main() {
	//freopen("0.txt", "r", stdin);
	scanf("%d", &n);
	int S = n * 2 + 1, T = S + 1, x;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			scanf("%d", &x);
			addedge(i, n + j, 1, x);
		}
	}
	for (int i = 1; i <= n; i++) 
		addedge(S, i, 1, 0), addedge(n + i, T, 1, 0);
	printf("%lld\n", MCMF(S, T));
	return 0;
}