116. 有源汇有上下界最大流
题目描述
这是一道模板题。
n 个点,m 条边,每条边 e 有一个流量下界 &\text{lower}(e) &和流量上界 &\text{upper}(e) &,给定源点 s 与汇点 t,求源点到汇点的最大流。
输入格式
第一行两个正整数 n、m、s、t。
之后的 m 行,每行四个整数 s、t、 lower lower 、 upper 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
1
≤
n
≤
202
,
1
≤
m
≤
9999
建图:
rep(i, E) {
//scanf("%d%d%d%d", &x, &y, &b, &c);
read(x);read(y);read(b);read(c);
add_edge(x, y, c - b);
add_edge(x, T, b);
add_edge(S, y, b);
}
add_edge(S, s, INF);
add_edge(t, T, INF);
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
//#include <unordered_map>
//#include <unordered_set>
#include <vector>
//#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define rep(i, n) for(int i = 0; i < n; ++i)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
const int MOD = (int)1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1.0);
const db EPS = 1e-10;
const int MAXS = 64 * 1024 * 1024;
char buf[MAXS], *ch;
void read(int &x) {
int t = 1;
while(*ch <= 32) ++ch;
//if(*ch == '-') ++ch, t = -1;
for(x = 0; *ch >= '0'; ++ch) x = x * 10 + *ch - 48;
//x = t * x;
}
void read_init() {
fread(buf, sizeof(char), MAXS, stdin);
ch = buf;
}
const int MAXV = 205<<1;
const int MAXE = 10005*6;
int V, E;
struct edge{
int to, cap, nxt;
edge() {}
edge(const int _to, const int _cap, const int _nxt) {
to = _to;
cap = _cap;
nxt = _nxt;
}
}dat[MAXE];
int head[MAXV], lever[MAXV], iter[MAXV], tail;
void add_edge(int from, int to, int cap) {
dat[tail] = edge(to, cap, head[from]);
head[from] = tail++;
dat[tail] = edge(from, 0, head[to]);
head[to] = tail++;
}
queue<int> que;
void bfs(int s, int t) {
memset(lever, 0xff, sizeof(int) * (t + 1));
lever[s] = 0;
que.push(s);
while(!que.empty()) {
int v = que.front(); que.pop();
for(int i = head[v]; ~i; i = dat[i].nxt) {
edge &e = dat[i];
if(lever[e.to] < 0 && e.cap > 0) {
lever[e.to] = lever[v] + 1;
que.push(e.to);
}
}
}
}
int dfs(int u, int t, int f) {
if(u == t) return f;
for(int &v = iter[u]; ~v; v = dat[v].nxt) {
edge &e = dat[v];
if(lever[e.to] > lever[u] && e.cap > 0) {
int d = dfs(e.to, t, min(e.cap, f));
if(d > 0) {
e.cap -= d;
dat[v^1].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t) {
int res = 0, f;
while(true) {
bfs(s, t);
if(lever[t] < 0) return res;
memcpy(iter, head, sizeof(int) * (t + 1));
while((f = dfs(s, t, INF))) res += f;
}
}
int main()
{
read_init();
//scanf("%d%d", &V, &E);
int s, t;
read(V); read(E); read(s); read(t);
int S = 0, T = V<<1|1;
memset(head, 0xff, sizeof(head));
tail = 0;
int x, y, b, c;
rep(i, E) {
//scanf("%d%d%d%d", &x, &y, &b, &c);
read(x);read(y);read(b);read(c);
add_edge(x, y, c - b);
add_edge(x, T, b);
add_edge(S, y, b);
}
add_edge(S, s, INF);
add_edge(t, T, INF);
int maxflow = max_flow(S, T);
int _flow;
bool ans = true;
for(int v = dat[head[0]].nxt; ~v && ans; v = dat[v].nxt) {
if(dat[v].cap != 0) ans = false;
_flow += dat[v^1].cap;
}
if(ans) {
printf("%d\n", maxflow - _flow);
} else {
puts("please go home to sleep");
}
return 0;
}