1891. Drainage Ditches

单点时限: 2.0 sec

内存限制: 256 MB

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. Note however, that there can be more than one ditch between two intersections.

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.


Line $1$: Two space-separated integers, $N$ $(0 \le N \le 200)$ and M $(2 \le M \le 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.

Line $2$..$N+1$: Each of $N$ lines contains three integers, $S_i$, $E_i$, and $C_i$. $S_i$ and $E_i$ $(1 \le S_i, E_i \le M)$ designate the intersections between which this ditch flows. Water will flow through this ditch from $S_i$ to $E_i$. $C_i$ $(0 \le Ci \le 10~000~000)$ is the maximum rate at which water will flow through the ditch.


One line with a single integer, the maximum rate at which water may emptied from the pond.


5 4
1 2 40
1 4 20
2 4 20
2 3 30
3 4 10

31 人解决,68 人已尝试。

46 份提交通过,共有 228 份提交。

5.9 EMB 奖励。

创建: 14 年,9 月前.

修改: 5 年,3 月前.

最后提交: 2 年,11 月前.