POJ 1273 Drainage Ditches(网络流【Dinic算法】)
2016-11-02 16:10
381 查看
题目链接:http://poj.org/problem?id=1273
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 71280 Accepted: 27724
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
【思路分析】网络流水题,裸题没啥好说的。
【AC代码】
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 71280 Accepted: 27724
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
【思路分析】网络流水题,裸题没啥好说的。
【AC代码】
#include <cstdio> #include <queue> #include <cstring> #include <vector> using namespace std; const int maxv = 205; const long long INF = 0x3f3f3f; struct Edge { int from, to, cap, flow; Edge(){} Edge(int from, int to, int cap, int flow) { this->from = from; this->to = to; this->cap = cap; this->flow = flow; } }; struct Dinic { int n, m, s, t; vector<Edge> edges; vector<int> G[maxv]; bool vis[maxv]; int d[maxv]; int cur[maxv]; void AddEdge(int from, int to, int cap) { edges.push_back(Edge(from, to, cap, 0)); edges.push_back(Edge(to, from, 0, 0)); m = edges.size(); G[from].push_back(m-2); G[to].push_back(m-1); } bool BFS() { memset(vis, 0, sizeof(vis)); queue<int>Q; Q.push(s); d[s] = 0; vis[s] = 1; while (!Q.empty()) { int x = Q.front(); Q.pop(); for (int i = 0; i < (int)G[x].size(); i++) { Edge& e = edges[G[x][i]]; if (!vis[e.to] && e.cap > e.flow) { vis[e.to] = 1; d[e.to] = d[x] + 1; Q.push(e.to); } } } return vis[t]; } int DFS(int x, int a) { if (x == t || a == 0) return a; int flow = 0, f; for (int& i = cur[x]; i < (int)G[x].size(); i++) { Edge& e = edges[G[x][i]]; if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0) { e.flow += f; edges[G[x][i]^1].flow -= f; flow += f; a -= f; if (a == 0) break; } } return flow; } int Maxflow(int s, int t) { this -> s = s; this -> t = t; int flow = 0; while (BFS()) { memset(cur, 0, sizeof(cur)); flow += DFS(s, INF); } return flow; } }; int main() { int n, m, u, v, c, i, t; //freopen("in.txt", "r", stdin); while(~scanf("%d%d", &m, &n)) { Dinic H; for(i=1; i<=m; ++i) { scanf("%d%d%d", &u, &v, &c); H.AddEdge(u, v, c); } printf("%d\n",H.Maxflow(1, n)); } return 0; }
相关文章推荐
- POJ 1273 Drainage Ditches—网络流,最大流模板题,Dinic算法
- poj 1273 hdu 1532 网络流最大流 Dinic算法
- poj 1273 Drainage Ditches 经典网络流 Dinic算法
- poj 1273--Drainage Ditches [网络流dinic算法]
- poj1273 网络流入门题 dinic算法解决,可作模板使用
- POJ 1273 Drainage Ditches(网络流dinic算法模板)
- POJ 1273 Drainage Ditches 网络流算法 .
- POJ 1273 Drainage Ditches(网络流——最大流)
- POJ1273 Drainage Ditches (网络流)
- poj 1273 网络流
- 【最大流-ISAP】POJ-1273-网络流模板!!
- 【POJ 1273 Drainage Ditches】& 网络流 & Dinic 算法
- 【网络流】 POJ 1273 Drainage Ditches
- Drainage Ditches - poj 1273(网络流模板)
- POJ 1273 Drainage Ditches (网络流最大流基础 Edmonds_Karp算法)
- poj 1273 Drainage Ditches 【最大流入门 dinic算法】
- POJ 1273网络流模板测试
- POJ 1273-Drainage Ditches(网络流_最大流_ISAP()算法和EK()算法)
- poj 1459 Power Network : 最大网络流 dinic算法实现
- poj 1273 裸 网络流 (dinic)