POJ-1273 Drainage Ditches 最大流Dinic
2015-12-29 20:54
609 查看
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 65146 Accepted: 25112
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
题目大意:草地排水。。。
多组数据,有源有汇。。。。
CODE:
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 65146 Accepted: 25112
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
题目大意:草地排水。。。
多组数据,有源有汇。。。。
CODE:
#include<iostream> #include<cstdio> #include<cstring> #include<queue> #include<algorithm> using namespace std; #define maxn 300 int dis[maxn]={0}; int way[maxn][maxn]={0}; int q[maxn*10],h,t; int n,m,ans; bool bfs() { h=0;t=1; memset(dis,0xff,sizeof(dis)); dis[1]=0; q[1]=1; while (h<t) { int j=q[++h]; for (int i=1; i<=n; i++) { if (dis[i]<0 && way[j][i]>0) { dis[i]=dis[j]+1; q[++t]=i; } } } if (dis >0) return true; else return false; } int dfs(int loc,int low) { int ans=0; if (loc==n) return low; for (int i=1; i<=n; i++) if (way[loc][i]>0 && dis[i]==dis[loc]+1 && (ans=dfs(i,min(loc,way[loc][i])))) { way[loc][i]-=ans; way[i][loc]+=ans; return ans; } return 0; } int main() { while (~scanf("%d%d",&m,&n)) { memset(way,0,sizeof(way)); for (int i=1; i<=m; i++) { int s,e,water; scanf("%d%d%d",&s,&e,&water); way[s][e]+=water; } ans=0; while (bfs()) { int now; while (now=dfs(1,0x7fffffff)) ans+=now; } printf("%d\n",ans); } return 0; }
相关文章推荐
- POJ-1273 Drainage Ditches 最大流Dinic
- ORA-38760: This database instance failed to turn on flashback database 第三篇
- FZUoj 题目2216 The Longest Straight*(二分)
- 多线程的使用(1)-performSelectorOnMainThread
- Canvas与Paint的初级使用
- PKU1273Drainage Ditches
- 思杰成为ADC领域在Container容器中提供其产品的第一家主要厂商
- 浅谈RAID写惩罚(Write Penalty)与IOPS计算
- 关于Login failed. The login is from an untrusted domain and cannot be used with Windows authentication.的问题
- 后台数据校验
- assign与retain
- @property (nonatomic, retain)
- time_wait详解
- RAID的各级特性及软RAID的创建
- 怎么解决啊???"Thread-14" HibernateException: Could not obtain transaction-.....
- ibm aix I/O ERROR DETECTED BY LVM
- 自定义View时,用到Paint Canvas的一些温故,讲讲平时一些效果是怎么画的(基础篇 二,图像遮盖,Canvas静态变化)
- 自定义View时,用到Paint Canvas的一些温故,讲讲平时一些效果是怎么画的(基础篇 二,图像遮盖,Canvas静态变化)
- Error: Cannot retrieve metalink for repository: epel. Please verify its path and try again
- EC纠删码(Erasure Code)校验码算法相比传统RAID5有哪些优势?