POJ-1273 Drainage Ditches(最大流)
来源:互联网 发布:淘宝咖啡猫游戏代购 编辑:程序博客网 时间:2024/06/08 06:33
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 71209 Accepted: 27705
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.
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 41 2 401 4 202 4 202 3 303 4 10
Sample Output
50网络流模板题,拆点构图什么的都不需要,直接上模板就行
#include<cstdio>#include<algorithm>#include<string.h>#include<queue>using namespace std;const int inf = 0x3f3f3f3f;const int maxn = 205;const int maxe = 4 * maxn * maxn;struct MaxFlow { struct Edge { int v, w, nxt; } edge[maxe]; int head[maxn], tot, level[maxn]; void init(){ memset(head,-1,sizeof(head)); tot=0; } void add(int u, int v, int w) { edge[tot].v = v; edge[tot].w = w; edge[tot].nxt = head[u]; head[u] = tot++; edge[tot].v = u; edge[tot].w = 0; edge[tot].nxt = head[v]; head[v] = tot++; } bool bfs(int s, int t) { memset(level, -1, sizeof(level)); queue<int>q; q.push(s); level[s] = 0; while(!q.empty()) { int u = q.front(); q.pop(); for(int i = head[u]; ~i; i = edge[i].nxt) { if(edge[i].w > 0 && level[edge[i].v] < 0) { level[edge[i].v] = level[u] + 1; q.push(edge[i].v); } } } return level[t] > 0; } int dfs(int u, int t, int f) { if(u == t) return f; for(int i = head[u]; ~i; i = edge[i].nxt) { int v = edge[i].v; if(edge[i].w > 0 && level[v] > level[u]) { int d = dfs(v, t, min(f, edge[i].w)); if(d > 0) { edge[i].w -= d; edge[i ^ 1].w += d; return d; } } } level[u] = -1; //不太确定,如果WA了把这句删掉试试 return 0; } int solve(int s, int t) { int flow = 0, f; while(bfs(s, t)) { while(f = dfs(s, t, inf)) flow += f; } return flow; }}F;int main(){ // freopen("in.txt","r",stdin); int n,m; while(~scanf("%d%d",&m,&n)){ F.init(); for(int i=0;i<m;i++){ int u,v,c; scanf("%d%d%d",&u,&v,&c); F.add(u,v,c); } printf("%d\n",F.solve(1,n)); } return 0;}
0 0
- poj 1273 Drainage Ditches 网络最大流
- 【最大流】北大 poj 1273 Drainage Ditches
- POJ-1273 Drainage Ditches【最大流】
- poj 1273 Drainage Ditches--最大流--Dinic
- poj 1273Drainage Ditches 最大流
- poj 1273 Drainage Ditches--最大流--sap
- poj 1273 Drainage Ditches---maxflow最大流
- poj - 1273 - Drainage Ditches(最大流)
- poj 1273 Drainage Ditches(最大流)
- poj-1273 Drainage Ditches 最大流
- POJ 1273 Drainage Ditches 最大流
- poj 1273 Drainage Ditches (最大流Dinic)
- POJ 1273 Drainage Ditches 最大流
- POJ 1273 Drainage Ditches(最大流)
- POJ 1273 Drainage Ditches 最大流 dinic
- POJ 1273 Drainage Ditches 最大流
- POJ 1273 Drainage Ditches (网络最大流)
- poj 1273 最大流 Drainage Ditches
- JavaBean 实现Mysql数据库操作(Query、Insert、Delete、Update)
- 19. Remove Nth Node From End of List (移除链表倒数第n个节点)
- Scintilla笔记(2)
- JDBC的学习
- OpenCV人脸检测(C++代码)—— By wepon
- POJ-1273 Drainage Ditches(最大流)
- Android 对话框弹出底部背景透明度调节
- java xml解析
- Scintilla笔记(3)
- request.getRequestURI()、getRequestURL()、getContextPath()、getServletPath()区别
- 备忘录模式(Memento Pattern)
- ubuntu 终端命令
- POJ1502(暴力floyd)
- Scintilla笔记(4)