P3381最小费用最大流（模板题）

一、题目描述

给出一个包含 n 个点和 m 条边的有向图（下面称其为网络） G=(V,E)，该网络上所有点分别编号为 1 ∼n，所有边分别编号为 1∼m，其中该网络的源点为 s，汇点为 t，网络上的每条边 (u,v)都有一个流量限制 w(u,v) 和单位流量的费用 c(u,v)。你需要求出该网络的最小费用最大流。

二、解题思路

喜闻乐见模板系列。%%%大佬的板子

三、AC代码

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <unordered_map>
#include <sstream>
#include <vector>
#include <stack>
using namespace std;
const int MAXN = 10000;
const int MAXM = 100000;
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);
				}
			}
		}
	}
	return pre[t] != -1; 
}
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, s, t;
	while (scanf("%d%d", &n, &m)) {
		cin >> s >> t;
		init(n + 1);
		for (int i = 1; i <= m; i++) {
			int x, y, w, dis;
			scanf("%d %d %d %d", &x, &y, &w, &dis);

			addedge(x, y, w, dis);
		}
		int ans = 0;
		int ct = minCostMaxflow(s, t, ans);
		printf("%d %d\n", ct, ans);
	}
	return 0;
}