Dinic算法java实现(HDU1532)
来源:互联网 发布:大数据市场规模2016 编辑:程序博客网 时间:2024/06/05 00:14
题意:就是由于下大雨的时候约翰的农场就会被雨水给淹没,
无奈下约翰不得不修建水沟,而且是网络水沟,
并且聪明的约翰还控制了水的流速,本题就是让你求出最大流速,
无疑要运用到求最大流了。题中N为水沟数,M为水沟的顶点,注意先输入M后输入n
接下来Si,Ei,Ci分别是水沟的起点,终点以及其容量。求源点1到终点M的最大流速。注意重边
Drainage Ditches
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18770 Accepted Submission(s): 8924Problem DescriptionEvery 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.InputThe 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.OutputFor each case, output a single integer, the maximum rate at which water may emptied from the pond.Sample Input5 41 2 401 4 202 4 202 3 303 4 10Sample Output50
阅读全文
0 0
- Dinic算法java实现(HDU1532)
- hdu1532 当前弧优化的dinic算法实现
- HDU1532 Drainage Ditches Dinic算法
- HDU1532——Drainage Ditches(网络流Dinic算法)
- Dinic 算法hdu1532(转给自己做模板)
- HDU1532(最大流Dinic算法模板题)
- HDU1532 Drainage Ditches 网络流之dinic算法(省内存,但耗时)
- hdu1532 Drainage Ditches (Dinic)
- hdu1532网络流(DINIC)
- hdu1532 网络流入门 dinic
- dinic算法实现
- [译]网络流Dinic算法-最大流-HDU1532&POJ1273
- HDU1532 Drainage Ditches 最大流Dinic模板
- Dinic算法的程序实现
- hdu1532--Drainage Ditches(最大流(EK算法))
- 增广路算法(网络流) HDU1532 Drainage Ditches
- HDU1532 Drainage Ditches —— 最大流(sap算法)
- 网络流(Dinic算法)
- c语言---数值的上溢和下溢
- hibernate关联配置
- Android4.4 增加的/system/priv-app
- ROS Robotics Projects(8)自动驾驶汽车
- Android中的消息机制
- Dinic算法java实现(HDU1532)
- ambariHDP部署总结
- 栈实例(转载)
- python 创建一个空dataframe 然后添加行数据
- 插件化系列开发之七--replugin源码解析之replugin-host-gradle(宿主的gradle插件)
- solr
- Bootstrap 弹出框modal 垂直居中(适用各种分辨率窗口)
- 左移右移的区别
- iOS 获取当前和当前n天后的日期(n为负数表示往前)