CSU 1506 Double Shortest Paths（最小费用流）

题目链接：http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1506

 

题意：有两个人要从起点走到终点，对于每条路径给出两个人走所需的费用，对于第一个人所走过的路，第二个人在走时需要加上第一个人走所需的费用，问两人所需的最小总费用

 

思路：比较裸的费用流问题了，u, v之间构建两条边，流量均为1，费用一个为w1, 一个为w1 + w2

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

const int MAXN = 1000;
const int MAXM = 10000;
const int INF = 0x3f3f3f3f;

struct Edge
{
	int to, next, cap, flow, cost;
} edge[MAXM];

int head[MAXN], tol;
int pre[MAXN], dis[MAXN];
bool vis[MAXN];
int N;

void init(int n)
{
	N = n;
	tol = 0;
	memset(head, -1, sizeof(head));
}

void addedge(int u, int v, int cap, int cost)
{
	edge[tol].to = v;
	edge[tol].cap = cap;
	edge[tol].cost = cost;
	edge[tol].flow = 0;
	edge[tol].next = head[u];
	head[u] = tol++;
	edge[tol].to = u;
	edge[tol].cap = 0;
	edge[tol].cost = -cost;
	edge[tol].flow = 0;
	edge[tol].next = head[v];
	head[v] = tol++;
}

bool spfa(int s, int t)
{
	queue <int> q;
	for (int i = 0; i < N; i++)
	{
		dis[i] = INF;
		vis[i] = false;
		pre[i] = -1;
	}
	dis[s] = 0;
	vis[s] = true;
	q.push(s);
	while (!q.empty())
	{
		int u = q.front();
		q.pop();
		vis[u] = false;
		for (int i = head[u]; i != -1; i = edge[i].next)
		{
			int v = edge[i].to;

			if (edge[i].cap > edge[i].flow && dis[v] > dis[u] + edge[i].cost)
			{
				dis[v] = dis[u] + edge[i].cost;
				pre[v] = i;
				if (!vis[v])
				{
					vis[v] = true;
					q.push(v);
				}
			}
		}
	}
	if (pre[t] == -1)
		return false;
	else
		return true;
} //返回的是最大流，cost存的是最小费用

int minCostMaxflow(int s, int t, int &cost)
{
	int flow = 0;
	cost = 0;
	while (spfa(s, t))
	{
		int Min = INF;
		for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
		{
			if (Min > edge[i].cap - edge[i].flow)
				Min = edge[i].cap - edge[i].flow;
		}
		for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
		{
			edge[i].flow += Min;
			edge[i ^ 1].flow -= Min;
			cost += edge[i].cost * Min;
		}
		flow += Min;
	}
	return flow;
}

int main()
{
	int n, m;
	int ca = 1;
	while (~scanf("%d%d", &n, &m))
	{
		int s = 0, t = n + 1, ans;
		init(t + 1);
		for (int i = 0; i < m; i++)
		{
			int u, v, a, b;
			scanf("%d%d%d%d", &u, &v, &a, &b);
			addedge(u, v, 1, a);
			addedge(u, v, 1, a + b);
		}
		addedge(s, 1, 2, 0);
		addedge(n, t, 2, 0);
		minCostMaxflow(s, t, ans);
		printf("Case %d: %d\n", ca++, ans);
	}
	return 0;
}