jzoj3399: 有源汇有上下界最大流

3399: 有源汇有上下界最大流

3399--有源汇有上下界最大流 (jzoj.cn)

时间限制: 1.000 Sec  内存限制: 256 MB
提交: 11  解决: 6
[命题人:][下载数据: 70]

提交状态报告

题目描述

这是一道模板题。

n个点，m条边，每条边 e有一个流量下界 lower(e) 和流量上界 upper(e)，给定源点 s与汇点 t，求源点到汇点的最大流。

输入

第一行两个正整数 n、m、s、t。

之后的 m 行，每行四个整数 s、t、lower、upper。

输出

如果无解，输出一行please go home to sleep。

否则输出最大流。

样例

输入  复制

10 15 9 10 9 1 17 18 9 2 12 13 9 3 11 12 1 5 3 4 1 6 6 7 1 7 7 8 2 5 9 10 2 6 2 3 2 7 0 1 3 5 3 4 3 6 1 2 3 7 6 7 5 10 16 17 6 10 10 11 7 10 14 15

输出  复制

43

提示

1≤n≤202,1≤m≤9999

#include<queue>

const int inf = 1 << 29, N = 211, M = 10001;
int n, m, s, t, lower, upper, ss, tt, tot = 1;
int edge[(N + M) * 2], head[N], next[(N + M) * 2], ver[(N + M) * 2], dep[N], d[N];
std::queue<int> q;

void add(int x, int y, int z) {
	ver[++tot] = y;
	edge[tot] = z;
	next[tot] = head[x];
	head[x] = tot;
	
	ver[++tot] = x;
	edge[tot] = 0;
	next[tot] = head[y];
	head[y] = tot;
}

bool bfs(int st, int en) {
	memset(dep, 0, sizeof(dep));
	while (q.size()) q.pop();
	q.push(st);
	dep[st] = 1;
	while (q.size()) {
		int x = q.front();
		q.pop();
		for (int i = head[x]; i; i = next[i]) {
			if (edge[i] && !dep[ver[i]]) {
				q.push(ver[i]);
				dep[ver[i]] = dep[x] + 1;
				if (ver[i] == en) return 1;
			}
		}
	}
	return 0;
}

int dfs(int x, int en, int flow) {
	if (x == en) return flow;
	int rest = flow, k;
	for (int i = head[x]; i && rest; i = next[i])
		if (edge[i] && dep[ver[i]] == dep[x] + 1) {	
			k = dfs(ver[i], en, std::min(rest, edge[i]));
			if (!k) dep[ver[i]] = 0;
			edge[i] -= k;
			edge[i ^ 1] += k;
			rest -= k;
		}
	return flow - rest;
}

int dinic(int st, int en) {
	int res = 0, flow = 0;
	while (bfs(st, en))
		while (flow = dfs(st, en, inf)) res += flow;
	return res;
}

int main() {
	scanf("%d %d %d %d", &n, &m, &s, &t);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d %d", &ss, &tt, &lower, &upper);
		d[ss] -= lower;
		d[tt] += lower;
		add(ss, tt, upper - lower);
	}
	ss = 0;
	tt = n + 1;
	int all = 0;
	for (int i = 1; i <= n; i++) {
		if (d[i] > 0) add(ss, i, d[i]), all += d[i];
		else add(i, tt, -d[i]);
	}
	add(t, s, inf);
	int flow = 0, maxflow = 0;
	if (dinic(ss, tt) != all) {
		printf("please go home to sleep");
		return 0;
	}
	maxflow = edge[tot];
	edge[tot] = edge[tot ^ 1] = 0;
	printf("%d", maxflow + dinic(s, t))
}

代码错不犯法吧，呵呵呵，吭吭，测试大家的耐心。

AC代码：

#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>

const int inf = 1 << 29, N = 211, M = 10001;
int n, m, s, t, lower, upper, ss, tt, tot = 1;
int edge[(N + M) * 2], head[N], next[(N + M) * 2], ver[(N + M) * 2], dep[N], d[N];
std::queue<int> q;

void add(int x, int y, int z) {
	ver[++tot] = y;
	edge[tot] = z;
	next[tot] = head[x];
	head[x] = tot;
	
	ver[++tot] = x;
	edge[tot] = 0;
	next[tot] = head[y];
	head[y] = tot;
}

bool bfs(int st, int en) {
	memset(dep, 0, sizeof(dep));
	while (q.size()) q.pop();
	q.push(st);
	dep[st] = 1;
	while (q.size()) {
		int x = q.front();
		q.pop();
		for (int i = head[x]; i; i = next[i]) {
			if (edge[i] && !dep[ver[i]]) {
				q.push(ver[i]);
				dep[ver[i]] = dep[x] + 1;
				if (ver[i] == en) return 1;
			}
		}
	}
	return 0;
}

int dfs(int x, int en, int flow) {
	if (x == en) return flow;
	int rest = flow, k;
	for (int i = head[x]; i && rest; i = next[i])
		if (edge[i] && dep[ver[i]] == dep[x] + 1) {	
			k = dfs(ver[i], en, std::min(rest, edge[i]));
			if (!k) dep[ver[i]] = 0;
			edge[i] -= k;
			edge[i ^ 1] += k;
			rest -= k;
		}
	return flow - rest;
}

int dinic(int st, int en) {
	int res = 0, flow = 0;
	while (bfs(st, en))
		while (flow = dfs(st, en, inf)) res += flow;
	return res;
}

int main() {
	scanf("%d %d %d %d", &n, &m, &s, &t);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d %d", &ss, &tt, &lower, &upper);
		d[ss] -= lower;
		d[tt] += lower;
		add(ss, tt, upper - lower);
	}
	ss = 0;
	tt = n + 1;
	int all = 0;
	for (int i = 1; i <= n; i++) {
		if (d[i] > 0) add(ss, i, d[i]), all += d[i];
		else add(i, tt, -d[i]);
	}
	add(t, s, inf);
	int flow = 0, maxflow = 0;
	if (dinic(ss, tt) != all) {
		printf("please go home to sleep");
		return 0;
	}
	maxflow = edge[tot];
	edge[tot] = edge[tot ^ 1] = 0;
	printf("%d", maxflow + dinic(s, t));
}

                                               886咯！