BZOJ 1738: [Usaco2005 mar]Ombrophobic Bovines 发抖的牛( floyd + 二分答案 + 最大流 )
一道水题WA了这么多次真是....
统考终于完 ( 挂 ) 了...可以好好写题了...
先floyd跑出各个点的最短路 , 然后二分答案 m , 再建图.
每个 farm 拆成一个 cow 点和一个 shelter 点, 然后对于每个 farm x : S -> cow( x ) = cow( x ) 数量 , shelter( x ) -> T = shelter( x ) 容量 ; 对于每个dist( u , v ) <= m 的 cow( u ) -> shelter( v ) = +oo , 然后跑最大流 , 假如满流就可行
最近我真是积极写题解...虽说都是水题..攒RP...
-----------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------
1738: [Usaco2005 mar]Ombrophobic Bovines 发抖的牛
Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 206 Solved: 91
[Submit][Status][Discuss]
Description
FJ's cows really hate getting wet so much that the mere thought of getting caught in the rain makes them shake in their hooves. They have decided to put a rain siren on the farm to let them know when rain is approaching. They intend to create a rain evacuation plan so that all the cows can get to shelter before the rain begins. Weather forecasting is not always correct, though. In order to minimize false alarms, they want to sound the siren as late as possible while still giving enough time for all the cows to get to some shelter. The farm has F (1 <= F <= 200) fields on which the cows graze. A set of P (1 <= P <= 1500) paths connects them. The paths are wide, so that any number of cows can traverse a path in either direction. Some of the farm's fields have rain shelters under which the cows can shield themselves. These shelters are of limited size, so a single shelter might not be able to hold all the cows. Fields are small compared to the paths and require no time for cows to traverse. Compute the minimum amount of time before rain starts that the siren must be sounded so that every cow can get to some shelter.
Input
* Line 1: Two space-separated integers: F and P
* Lines 2..F+1: Two space-separated integers that describe a field. The first integer (range: 0..1000) is the number of cows in that field. The second integer (range: 0..1000) is the number of cows the shelter in that field can hold. Line i+1 describes field i. * Lines F+2..F+P+1: Three space-separated integers that describe a path. The first and second integers (both range 1..F) tell the fields connected by the path. The third integer (range: 1..1,000,000,000) is how long any cow takes to traverse it.
Output
* Line 1: The minimum amount of time required for all cows to get under a shelter, presuming they plan their routes optimally. If it not possible for the all the cows to get under a shelter, output "-1".
Sample Input
7 2
0 4
2 6
1 2 40
3 2 70
2 3 90
1 3 120
Sample Output
1号田的7只牛中,2只牛直接进入1号田的雨棚,4只牛进入1号田的雨棚,1只进入3号田的雨棚,加入其他的由3号田来的牛们.所有的牛都能在110单位时间内到达要去的雨棚.
HINT
Source
Gold
转载于:https://www.cnblogs.com/JSZX11556/p/4621241.html
BZOJ 1738: [Usaco2005 mar]Ombrophobic Bovines 发抖的牛( floyd + 二分答案 + 最大流 )相关推荐
- 【bzoj1738】[Usaco2005 mar]Ombrophobic Bovines 发抖的牛 Floyd+二分+网络流最大流
题目描述 FJ's cows really hate getting wet so much that the mere thought of getting caught in the rain m ...
- bzoj 1681: [Usaco2005 Mar]Checking an Alibi 不在场的证明(BFS)
1681: [Usaco2005 Mar]Checking an Alibi 不在场的证明 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 389 So ...
- bzoj 1682: [Usaco2005 Mar]Out of Hay 干草危机(最小生成树)
1682: [Usaco2005 Mar]Out of Hay 干草危机 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 626 Solved: 436 ...
- BZOJ 1734: [Usaco2005 feb]Aggressive cows 愤怒的牛( 二分答案 )
最小最大...又是经典的二分答案做法.. -------------------------------------------------------------------------- #inc ...
- bzoj 3375: [Usaco2004 Mar]Paranoid Cows 发疯的奶牛(二分)
3375: [Usaco2004 Mar]Paranoid Cows 发疯的奶牛 Time Limit: 10 Sec Memory Limit: 128 MB Submit: 28 Solved ...
- bzoj 3993 星际战争 - 二分答案 - 最大流
3333年,在银河系的某星球上,X军团和Y军团正在激烈地作战.在战斗的某一阶段,Y军团一共派遣了N个巨型机器人进攻X军团的阵地,其中第i个巨型机器人的装甲值为Ai.当一个巨型机器人的装甲值减少到0或者 ...
- 1682: [Usaco2005 Mar]Out of Hay 干草危机
1682: [Usaco2005 Mar]Out of Hay 干草危机 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 391 Solved: 258 ...
- BZOJ 1639: [Usaco2007 Mar]Monthly Expense 月度开支( 二分答案 )
直接二分答案然后判断. ----------------------------------------------------------------------------- #include&l ...
- bzoj 1639: [Usaco2007 Mar]Monthly Expense 月度开支(二分)
1639: [Usaco2007 Mar]Monthly Expense 月度开支 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 1057 Solve ...
最新文章
- 理解Python的迭代器(转)
- 总监说,20、30岁年轻人面临人生抉择,早点知道这个法则,会少一些遗憾!
- 谈谈varnish、squid、apache、nginx缓存的对比
- 【错误记录】Ubuntu 中 ROOT 用户无法启动 Visual Studio Code 开发环境 ( 推荐在普通用户下使用 VSCode 开发环境 )
- 前端获取浏览器标识_浏览器缓存机制
- Java short 无符号右移_char类型byte类型或short类型进行无符号右移遇到的神奇问题...
- [Redux/Mobx] 你有了解Rxjs是什么吗?它是做什么的?
- 使用系统的CoreLocation定位
- 资源不足的情况怎么设置sparkrdd并行度_监控录像机资源不足或达到上限的原因及解决方法!...
- 黑客攻防技术宝典Web实战篇第2版—第1章Web应用程序安全与风险
- linux ubuntu软件中心,安装Lubuntu 软件中心
- Visio风格源代码组件库,流程图,矢量图,图形编辑,打印,导入,导出,VC++源代码...
- 智慧交通前瞻:如何解决城市发展“心病”?
- 微信可以修改微信号了
- 易知微当选中国互联网协会数字孪生技术应用工作委员会成员单位
- 光标大小怎么调_cad十字光标和坐标系,你必知的几个小技巧!
- rabbitMq用guest登录失败解决办法
- Jetson设备下使用docker报错的排错过程完整记录,failed to create shim: OCI runtime create failed: container_linux.go:38
- gitlab仓库的克隆和提交
- npm ERR! code EPERM npm ERR! syscall unlink npm ERR! errno -4048 解决方法