hdu 3488（费用流）

题目链接

同这题

#include <cstdio>
#include <queue>

using namespace std;

const int N = 2005;
const int M = 10005 << 3;

typedef int LL;

const LL INF = (int)1e9;

struct Cost_Flow {
	
	struct Edge {
		LL cap, flow, cost;
		int v;
		Edge* next, * pair;

		inline void init(int v, LL c, LL p, Edge* e, Edge* e2) {
			this->v = v, cap = c, flow = 0, cost = p;
			next = e, pair = e2;
		}
	};

	Edge E[M], * it, * head[N], * path[N];
	int n, s, t;
	LL minCost, maxFlow;
	bool inq[N];
       	LL dis[N];
	queue<int> Q;

	void init(int n, int s, int t) {
		this->n = n, this->s = s, this->t = t;
		it = E;
		for (int i = 0; i < n; i++) {
			head[i] = 0;
		}
	}

	inline void add(int u, int v, LL c, LL p) {
		it->init(v, c, p, head[u], it + 1);
	      	head[u] = it++;
		it->init(u, 0, -p, head[v], it - 1);	
		head[v] = it++;
	}

	bool spfa() {
		LL tmp;
		for (int i = 0; i < n; dis[i++] = INF);
		Q.push(s); dis[s] = 0;
		path[s] = path[t] = 0;
		while (!Q.empty()) {
			int u = Q.front(); Q.pop(); inq[u] = 0;
			for (Edge* e = head[u]; e; e = e->next) {
				int v = e->v;
				if (e->cap > e->flow && dis[v] > (tmp = dis[u] + e->cost) ){
					dis[v] = tmp;
					path[v] = e->pair;
					if(inq[v]) continue;
					inq[v] = 1; Q.push(v);
				}
			}
		}
		return path[t];
	}

	void run() {
		maxFlow = minCost = 0;
		while(spfa()) {
			LL tmp = INF;
			for (Edge* e = path[t]; e; e = path[e->v])
				tmp = min(tmp, e->pair->cap - e->pair->flow);
			for (Edge* e = path[t]; e; e = path[e->v])
				e->pair->flow += tmp, e->flow -= tmp;
			minCost += tmp * dis[t];
			maxFlow += tmp;
		}
	}
}G;

int main() {
	int test, n, m, s, t, u, v, w;
	scanf("%d", &test);
	for (int cas = 1; cas <= test; cas++) {
		scanf("%d%d", &n, &m);
		s = 0, t = 2 * n + 1;
		G.init(2 * n + 2, s, t);

		for (int i = 0; i < m; i++) {
			scanf("%d%d%d", &u, &v, &w);
			G.add(u, v + n, 1, w);
		}

		for (int i = 1; i <= n; i++)
			G.add(s, i, 1, 0), G.add(i + n, t, 1, 0);

		G.run();

		printf("%d\n", G.minCost);
	}
	return 0;
}