uva 10594(最大流最小费)

题意：有n个结点，要从1到n运送指定量的数据，然后每两个结点之间管道有特定的容量和花费，问将全部数据从1运到n是否能到达，可能的话输出最小费。

题解：无向图邻接表的最大流最小费模板题。

#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
const int N = 105;
const int M = 5100;
const long long INF = 1000000000000000000;
struct Edge {
	int x, y;
	long long w;
}e[M];
struct EDGE {
	int u, v;
	long long cap, flow, cost;
	int next;
}edge[M * 4];
int n, m, sum, lim, cnt;
int maxflow, p[N], head[N];
long long d[N], c;

void addedge(int u, int v, int w, int cap) {
	edge[cnt].u = u;	
	edge[cnt].v = v;
	edge[cnt].flow = 0;
	edge[cnt].cap = cap;
	edge[cnt].cost = w;
	edge[cnt].next = head[u];	
	head[u] = cnt++;	

	edge[cnt].u = v;	
	edge[cnt].v = u;
	edge[cnt].flow = 0;
	edge[cnt].cap = 0;
	edge[cnt].cost = -w;
	edge[cnt].next = head[v];
	head[v] = cnt++;
}

void ek(int scr, int en) {
	queue<int> q;
	maxflow = c = 0;
	while (1) {
		bool vis[N];
		memset(p, -1, sizeof(p));
		for (int i = 0; i <= en; i++)
			d[i] = INF;
		d[scr] = 0;
		memset(vis, 0, sizeof(vis));
		q.push(scr);
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			vis[u] = false;
			for (int i = head[u]; i != -1; i = edge[i].next) {
				if (edge[i].cap > edge[i].flow && d[edge[i].v] > d[u] + edge[i].cost) {
					d[edge[i].v] = d[u] + edge[i].cost;
					p[edge[i].v] = i;
					if (!vis[edge[i].v]) {
						vis[edge[i].v] = true;
						q.push(edge[i].v);
					}
				}
			}
		}
		if (d[en] == INF)
			break;
		int a = 0x3f3f3f3f;
		for (int i = p[en]; i != -1; i = p[edge[i].u])
			a = a < edge[i].cap - edge[i].flow ? a : edge[i].cap - edge[i].flow;
		for (int i = p[en]; i != -1; i = p[edge[i].u]) {
			edge[i].flow += a;
			edge[i ^ 1].flow -= a;
		}
		c += d[en] * a;
		maxflow += a;
	}
}

int main() {
	while (scanf("%d%d", &n, &m) != EOF) {
		cnt = 0;
		memset(head, -1, sizeof(head));
		for (int i = 1; i <= m; i++)
			scanf("%d%d%lld", &e[i].x, &e[i].y, &e[i].w);
		scanf("%d%d", &sum, &lim);
		for (int i = 1; i <= m; i++) {
			addedge(e[i].x, e[i].y, e[i].w, lim);
			addedge(e[i].y, e[i].x, e[i].w, lim);
		}
		addedge(0, 1, 0, sum);
		ek(0, n);
		if (maxflow == sum)
			printf("%lld\n", c);
		else
			printf("Impossible.\n");
	}
	return 0;
}