POJ 1273 Drainage Ditches POJ 1274 The Perfect Stall 最大流简单题
来源:互联网 发布:为什么需要编程语言 编辑:程序博客网 时间:2024/06/08 16:31
http://acm.pku.edu.cn/JudgeOnline/problem?id=1273
POJ 1273 Drainage Ditches
Time Limit:1000MS Memory Limit:10000K
Total Submit:3488 Accepted:1188
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
Source
USACO 93
http://acm.pku.edu.cn/JudgeOnline/problem?id=1274
POJ 1274 The Perfect Stall
Time Limit:1000MS Memory Limit:10000K
Total Submit:1464 Accepted:666
Description
Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the
stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was
only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which
stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall.
Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.
Input
The input includes several cases. For each case, the first line contains two integers, N (0 <= N <= 200) and M (0 <= M <= 200). N is the number of cows that
Farmer John has and M is the number of stalls in the new barn. Each of the following N lines corresponds to a single cow. The first integer (Si) on the line
is the number of stalls that the cow is willing to produce milk in (0 <= Si <= M). The subsequent Si integers on that line are the stalls in which that cow
is willing to produce milk. The stall numbers will be integers in the range (1..M), and no stall will be listed twice for a given cow.
Output
For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.
Sample Input
5 5
2 2 5
3 2 3 4
2 1 5
3 1 2 5
1 2
Sample Output
4
Source
USACO 40
Description:
两道最大流简单题 考察基本建图和基本的Edmonds-Karp算法
建图(有向简单图)很简单 应用Edmonds-Karp就能AC
- POJ 1273 Drainage Ditches POJ 1274 The Perfect Stall 最大流简单题
- (最大流-简单题) poj 1273 Drainage Ditches
- POJ 1274 The Perfect Stall 二分匹配||最大流(简单题)
- POJ 1274 The Perfect Stall 最大匹配
- POJ 1274 The Perfect Stall (网络流-最大流)
- POJ 1274The Perfect Stall (最大流实现)
- 【最大流】北大 poj 1274 The Perfect Stall
- poj 1274 The Perfect Stall(最大流版)
- 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 最大流
- 解决了c#捕获sql错误号的问题和将sql连接用application放在global中作全局变量问题
- Linux和DOS的FORMAT命令区别
- 详细讲解 Linux操作系统下文件解压缩的技巧
- 委托(3.匿名方法)
- 忠告:网页设计必须注意的29个问题
- POJ 1273 Drainage Ditches POJ 1274 The Perfect Stall 最大流简单题
- 技巧和诀窍:在IIS 7.0上使用自签证书来启用SSL
- SQL语句
- C语言的常用库函数
- 编码字符集与Java -Java World乱码问题根源之所在
- vs2003 asp.net中直接输出wml,并利用C#做动态页面的控制,不使用微软的移动控件
- Java桌面应用展望
- CRC算法描述
- 好久没有来这块自留地了