POJ 1459 最大流 Dinic

题意

传送门 POJ 1459

题解

题目描述天花乱坠，其实就是求发电机到消费者的多源点、多汇点的最大流；加入超级源点、超级汇点跑 $Dinic$ 即可。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <string>
#include <map>
#include <set>
#define min(a,b)    (((a) < (b)) ? (a) : (b))
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define abs(x)    ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
using namespace std;

#define MAX_V 105
typedef int capType;
struct edge{
	int to, rev;
	capType cap;
	edge(int to, capType cap, int rev) : to(to), cap(cap), rev(rev){}
};
int V;
vector<edge> G[MAX_V];
int level[MAX_V], iter[MAX_V];

void add_edge(int from, int to, capType cap){
	G[from].push_back(edge(to, cap, G[to].size()));
	G[to].push_back(edge(from, 0, G[from].size() - 1));
}

void bfs(int s){
	memset(level, -1, sizeof(level));
	queue<int> que;
	level[s] = 0;
	que.push(s);
	while(!que.empty()){
		int v = que.front(); que.pop();
		for(int i = 0; i < G[v].size(); i++){
			edge &e = G[v][i];
			if(e.cap > 0 && level[e.to] < 0){
				level[e.to] = level[v] + 1;
				que.push(e.to);
			}
		}
	}
}

capType dfs(int v, int t, capType f){
	if(v == t) return f;
	for(int &i = iter[v]; i < G[v].size(); i++){
		edge &e = G[v][i];
		if(e.cap > 0 && level[v] < level[e.to]){
			capType d = dfs(e.to, t, min(f, e.cap));
			if(d > 0){
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}

capType max_flow(int s, int t){
	capType flow = 0;
	for(;;){
		bfs(s);
		if(level[t] < 0) return flow;
		memset(iter, 0, sizeof(iter));
		capType f;
		while((f = dfs(s, t, INF)) > 0){
			flow += f;
		}
	}
}

void clear_graph(){
	for(int v = 0; v < V; v++) G[v].clear();
}

#define MAX_N 105
int n, np, nc, m;

void solve(){
	int s = n, t = s + 1;
	V = t + 1;
	clear_graph();
	// 建图
	for(int i = 0; i < m; i++){
		int u, v, z;
		scanf(" (%d,%d)%d", &u, &v, &z);
		add_edge(u, v, z);
	}
	for(int i = 0; i < np; i++){
		int u, z;
		scanf(" (%d)%d", &u, &z);
		add_edge(s, u, z);
	}
	for(int i = 0; i < nc; i++){
		int u, z;
		scanf(" (%d)%d", &u, &z);
		add_edge(u, t, z);
	}
	printf("%d\n", max_flow(s, t));
}

int main(){
	while(~scanf("%d%d%d%d", &n, &np, &nc, &m)){
		solve();
	}
	return 0;
}