poj 1273 Drainage Ditches【最大流 dinic】
来源:互联网 发布:免费.tk域名的注册 编辑:程序博客网 时间:2024/06/05 00:23
Description
Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of drainage ditches so that Bessie’s clover patch is never covered in water. Instead, the water is drained to a nearby stream. Being an ace engineer, Farmer John has also installed regulators at the beginning of each ditch, so he can control at what rate water flows into that ditch.
Farmer John knows not only how many gallons of water each ditch can transport per minute but also the exact layout of the ditches, which feed out of the pond and into each other and stream in a potentially complex network.
Given all this information, determine the maximum rate at which water can be transported out of the pond and into the stream. For any given ditch, water flows in only one direction, but there might be a way that water can flow in a circle.
Input
The input includes several cases. For each case, the first line contains two space-separated integers, N (0 <= N <= 200) and M (2 <= M <= 200). N is the number of ditches that Farmer John has dug. M is the number of intersections points for those ditches. Intersection 1 is the pond. Intersection point M is the stream. Each of the following N lines contains three integers, Si, Ei, and Ci. Si and Ei (1 <= Si, Ei <= M) designate the intersections between which this ditch flows. Water will flow through this ditch from Si to Ei. Ci (0 <= Ci <= 10,000,000) is the maximum rate at which water will flow through the ditch.
Output
For each case, output a single integer, the maximum rate at which water may emptied from the pond.
Sample Input
5 4
1 2 40
1 4 20
2 4 20
2 3 30
3 4 10
Sample Output
50
#include <cstdio> #include <cstring> #include <queue> #include <algorithm> #define MAXN 200+10 #define INF 0x3f3f using namespace std;int dist[MAXN], cur[MAXN], vis[MAXN], head[MAXN], top;int n, m;struct Edge { int to, cap, flow, next;}edge[MAXN << 2];void addedge(int a, int b, int c) { Edge E1 = {b, c, 0, head[a]}; edge[top] = E1; head[a] = top++; Edge E2 = {a, 0, 0, head[b]}; edge[top] = E2; head[b] = top++;}bool BFS(int start, int end) { //spfa法求最短路 memset(dist, -1, sizeof(dist)); memset(vis, 0, sizeof(vis)); queue<int> Q; Q.push(start); vis[start] = 1; dist[start] = 0; while(!Q.empty()) { int u = Q.front(); Q.pop(); for(int i = head[u]; i != -1; i = edge[i].next) { Edge E = edge[i]; if(!vis[E.to] && E.cap > E.flow) { //多个流限制 dist[E.to] = dist[u] + 1; //建立分层 vis[E.to] = 1; if(E.to == end) return true; Q.push(E.to); } } } return false;}int DFS(int x, int cost, int end) { //根据分层图进行深搜 if(x == end || cost == 0) return cost; int flow = 0, f; for(int& i = cur[x]; i != -1; i = edge[i].next) { Edge& E = edge[i]; if(dist[E.to] == dist[x] + 1 && (f = DFS(E.to, min(cost, E.cap - E.flow), end)) > 0) { E.flow += f; edge[i ^ 1].flow -= f; flow += f; cost -= f; if(cost == 0) break; } } return flow;}int Maxflow(int start, int end) { int flow = 0; while(BFS(start, end)) { //对残量网络增广 memcpy(cur, head, sizeof(head)); flow += DFS(start, INF, end); } return flow;}int main() { while(scanf("%d %d", &m, &n) != EOF) { top = 0; memset(head, -1, sizeof(head)); int a, b, c; while(m--) { scanf("%d %d %d", &a, &b, &c); addedge(a, b, c); } printf("%d\n", Maxflow(1, n)); } return 0;}
- poj 1273 Drainage Ditches--最大流--Dinic
- poj 1273 Drainage Ditches (最大流Dinic)
- POJ 1273 Drainage Ditches 最大流 dinic
- POJ-1273 Drainage Ditches 最大流Dinic
- poj 1273 Drainage Ditches【最大流 dinic】
- poj 1273 Drainage Ditches(最大流 dinic模版)
- 【最大流(dinic)】poj 1273 Drainage Ditches
- POJ 1273~Drainage Ditches(网络最大流ek,dinic)
- POJ 1273 --Drainage Ditches【最大流模板 && dinic】
- POJ 1273 && HDU 1532 Drainage Ditches(最大流-Dinic)
- 【poj 1273】Drainage Ditches 最大流dinic模板
- POj 1273 Drainage Ditches (最大流 Dinic + ISAP 模板)
- poj 1273 hdu 1532 Drainage Ditches 最大流dinic 算法
- POJ 1273 Drainage Ditches -dinic
- poj 1273 Drainage Ditches 【最大流入门 dinic算法】
- POJ 1273 Drainage Ditches—网络流,最大流模板题,Dinic算法
- POJ--1273--Drainage Ditches【Dinic模板】【isap模板】网络最大流
- poj 1273 Drainage Ditches(最大流E-K +dinic 模板)
- 快用markdown写一篇博客吧
- 【总结】公钥加密私钥解密/私钥加密公钥机密验证
- python3[爬虫实战] 使用selenium,xpath爬取京东手机(上)
- usaco1.1你的飞碟在这儿
- 游戏开发流程
- poj 1273 Drainage Ditches【最大流 dinic】
- 函数返回值、引用和指针的区别思考
- 详解js中的setTimeout()函数
- 文章标题
- 概率性算法
- 判断两个循环链表内容是否相等
- POJ1434 Fill the Cisterns! 二分法
- 17ACM Qingdao 1010 Brute Force Sorting
- 九九乘法表