poj 1273 Drainage Ditches
来源:互联网 发布:如何修改淘宝账户名称 编辑:程序博客网 时间:2024/06/05 01:56
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
第一道网络流......
思路:没什么好说的,不会有人看这种题的题解的吧.....
EK算法
#include <stdio.h>#include <queue>#include <cstring>using namespace std;int Map[205][205],n,m;int solve(){ queue<int>q; while(!q.empty())q.pop(); int val[205]; memset(val,0,sizeof(val)); val[1]=2000000001; int pre[205]; memset(pre,0,sizeof(pre)); q.push(1); while(!q.empty()){ int now=q.front(); q.pop(); for(int i=1;i<=n;i++){ if(!val[i] && Map[now][i]){ pre[i]=now; val[i]=min(val[now],Map[now][i]); q.push(i); if(i==n){ while(pre[i]){ Map[pre[i]][i]-=val[n]; Map[i][pre[i]]+=val[n]; i=pre[i]; } return val[n]; } } } } return 0;}int main(){ while(~scanf("%d%d",&m,&n)){ memset(Map,0,sizeof(Map)); for(int i=1;i<=m;i++){ int s,e,v; scanf("%d%d%d",&s,&e,&v); Map[s][e]+=v; } int ans=0,t=0; while(t=solve())ans+=t; printf("%d\n",ans); } return 0;}
Dinic算法:
#include <queue>#include <stdio.h>#include <string.h>#define inf 2000000001using namespace std;int n,m;int Map[205][205],layer[205];bool find_layer(){ memset(layer,-1,sizeof(layer)); queue<int>q; q.push(1); layer[1]=0; while(!q.empty()){ int now=q.front(); q.pop(); for(int i=1;i<=n;i++){ if(Map[now][i] && layer[i]==-1){ layer[i]=layer[now]+1; q.push(i); if(i==n)return true; } } } return false;}int solve(){ int ans=0; int vis[205]; deque<int>dq; while(!dq.empty())dq.pop_front(); while(find_layer()){ memset(vis,0,sizeof(vis)); dq.push_front(1); vis[1]=1; while(!dq.empty()){ if(dq.back()==n){ int Min=inf,Min_s; for(int i=1;i<dq.size();i++){ int s=dq[i-1],e=dq[i]; if(Map[s][e]<=Min){ Min=Map[s][e]; Min_s=s; } } ans+=Min; for(int i=1;i<dq.size();i++){ int s=dq[i-1],e=dq[i]; Map[s][e]-=Min; Map[e][s]+=Min; } while(!dq.empty() && dq.back()!=Min_s){ vis[dq.back()]=0; dq.pop_back(); } } else{ int flag=1; for(int i=1;i<=n;i++){ if(Map[dq.back()][i] && vis[i]==0 && layer[i]==layer[dq.back()]+1){ vis[i]=1; dq.push_back(i); flag=0; break; } } if(flag)dq.pop_back(); } } } return ans;}int main(){ while(~scanf("%d%d",&m,&n)){ memset(Map,0,sizeof(Map)); memset(layer,-1,sizeof(layer)); for(int i=1;i<=m;i++){ int s,e,v; scanf("%d%d%d",&s,&e,&v); Map[s][e]+=v; } printf("%d\n",solve()); }}
0 0
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ-1273-Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ-1273-Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- https页面打不开
- 查看impala分区命令
- 通过shell检查usb总线下的所有设备
- gdb的简单使用
- 2017年石家庄最新房贷利率
- poj 1273 Drainage Ditches
- wireshark--一些东西
- C++ Web 编程
- 数据结构与算法(19)——二叉树习题二
- maven pom.xml详解
- 使用OPENCV中的Sobel函数找函数边缘并显示
- 垃圾信息防御措施
- expected at least 1 bean which qualifies as autowire candidate for this dependency. Dependency annot
- ios UINavigationController如何连续返回两级pop