SDOI 2010, 星际竞速 (最小费用流）

最小费用流

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int V = 20100;
const int E = 201000;

template<typename T>
struct MinCostGraph {
	int s, t, vtot;
	int head[V], etot;
	T dis[V], flow, cost, pf[V];
	int pre[V];
	bool vis[V];

	struct edge {
		int v, nxt;
		T f, c;
	} e[E * 2];
	void addedge(int u,int v, T f, T c, T f2 = 0){
		e[etot]= {v, head[u], f, c}; head[u] = etot++;
		e[etot]= {u, head[v], f2, -c}; head[v] = etot++;
	}

	bool spfa() {
		T inf = numeric_limits<T>::max() / 2;
		for (int i = 1; i <= vtot; i++) {
			dis[i] = inf;
			vis[i] = false;
			pre[i] = -1;
			pf[i] = inf;
		}
		dis[s] = 0;
		vis[s] = true;
		queue<int> q;
		q.push(s);
		while (!q.empty()) {
			int u = q.front();
			for (int i = head[u]; ~i; i = e[i].nxt) {
				int v = e[i].v;
				if (e[i].f && dis[v] > dis[u] + e[i].c) {
					dis[v] = dis[u] + e[i].c;
					pre[v] = i;
					pf[v] = min(pf[u], e[i].f);
					if (!vis[v]) {
						vis[v] = 1;
						q.push(v);
					}
				}
			}
			q.pop();
			vis[u] = false;
		}
		return dis[t] < 0;
	}

	void augment() {
		int u = t;
		T f = pf[t];
	//	cout<<dis[t]<<" "<<f<<endl;
		flow += f;
		cost += f * dis[t];
	//	cout<<flow<<" "<<cost<<endl;
		while (~pre[u]) {
			e[pre[u]].f -= f;
			e[pre[u] ^ 1].f += f;
			u = e[pre[u] ^ 1].v;
		}
	}

	pair<T, T> solve() {
		flow = 0;
		cost = 0;
		while (spfa()) augment();
		return {flow, cost};
	}
	void init(int s_, int t_, int vtot_) {
		s = s_;
		t = t_;
		vtot = vtot_;
		etot = 0;
		for (int i = 1; i <= vtot; i++) head[i] = -1;
	}
};

MinCostGraph<ll> g;
ll inf = 1e13;
int n, m;
int main() {
	scanf("%d%d", &n, &m);
	int s = 2 * n + 1, t = 2 * n + 2;
	g.init(s, t, t);
	for (int i = 1; i <= n; i++) {
		int x;
		scanf("%d", &x);
		//g.addedge(ss, 2 * i - 1, inf, x);
		//g.addedge(2 * i, ss, inf, 0);
		g.addedge(s, 2 * i-1, inf, x);
		g.addedge(2 * i , t, inf, 0);
		g.addedge(2*i-1,2*i,1,-inf);
	}
	for (int i = 1; i <= m; i++) {
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		if (u > v) swap(u, v);
		g.addedge(2 * u, 2 * v - 1, inf, w);
	}
     ll cost= g.solve().second;
	// flow != n 鏃犺В
//	cout<<cost;
	ll cc=cost+n*inf;
	printf("%lld\n",cc);
}