BZOJ 1689 [Usaco2005 Open] Muddy roads 泥泞的路 模拟
来源:互联网 发布:yy摇骰子软件 编辑:程序博客网 时间:2024/04/29 03:48
Description
Farmer John has a problem: the dirt road from his farm to town has suffered in the recent rainstorms and now contains (1 <= N <= 10,000) mud pools. Farmer John has a collection of wooden planks of length L that he can use to bridge these mud pools. He can overlap planks and the ends do not need to be anchored on the ground. However, he must cover each pool completely. Given the mud pools, help FJ figure out the minimum number of planks he needs in order to completely cover all the mud pools.
Input
* Line 1: Two space-separated integers: N and L * Lines 2..N+1: Line i+1 contains two space-separated integers: s_i and e_i (0 <= s_i < e_i <= 1,000,000,000) that specify the start and end points of a mud pool along the road. The mud pools will not overlap. These numbers specify points, so a mud pool from 35 to 39 can be covered by a single board of length 4. Mud pools at (3,6) and (6,9) are not considered to overlap.
Output
* Line 1: The miminum number of planks FJ needs to use.
Sample Input
1 6
13 17
8 12
Sample Output
HINT
Source
#include<bits/stdc++.h>using namespace std;int read(){ int x=0,f=1;char ch=getchar(); while (ch<'0' || ch>'9'){if (ch=='-') f=-1;ch=getchar();} while (ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f;}const int N=10005;int n,L;struct hole{int l,r;}a[N];bool cmp(hole x,hole y){return x.l<y.l;}int main(){n=read(),L=read();for (int i=0;i<n;i++)a[i].l=read(),a[i].r=read()-1;sort(a,a+n,cmp);int t,ans=0,last=a[0].l-1;for (int i=0;i<n;i++){last=max(last,a[i].l-1);t=a[i].r-last;if (!(~t)) continue;ans+=t/L; last+=t/L*L;if (last<a[i].r) last+=L,ans++;//以上if这句话如果换成//if (t%L) ans++,last+=L; 就会WA//求解…… }printf("%d\n",ans);return 0;}
- BZOJ 1689 [Usaco2005 Open] Muddy roads 泥泞的路 模拟
- BZOJ 1689: [Usaco2005 Open] Muddy roads 泥泞的路
- bzoj 1689: [Usaco2005 Open] Muddy roads 泥泞的路(模拟)
- 1689: [Usaco2005 Open] Muddy roads 泥泞的路
- bzoj1689 [Usaco2005 Open] Muddy roads 泥泞的路
- BZOJ1689: [Usaco2005 Open] Muddy roads 泥泞的路
- bzoj1689: [Usaco2005 Open] Muddy roads 泥泞的路
- BZOJ[1735][Usaco2005 jan]Muddy Fields 泥泞的牧场 网络流
- [BZOJ1689][POJ2437]Muddy Roads泥泞的道路
- bzoj1735[Usaco2005 jan]Muddy Fields 泥泞的牧场
- Muddy roads
- Muddy roads
- bzoj 1747: [Usaco2005 open]Expedition 探险 贪心
- BZOJ 1747 [Usaco2005 open]Expedition 探险 贪心
- bzoj 1749: [usaco2005 open]Landscaping 地形改造
- BZOJ 1746: [Usaco2005 open]Lazy Cows
- 8.22--练习赛F题--Muddy roads (模拟)
- BZOJ 1621 [Usaco2008 Open]Roads Around The Farm分岔路口 模拟
- 文章标题
- 04.24 网络知识章节
- C++每日一课(十七)
- java的int类型线程安全
- ngmodel在Eonasdan/bootstrap-datetimepicker中不生效解决方法
- BZOJ 1689 [Usaco2005 Open] Muddy roads 泥泞的路 模拟
- Kali 2016.2 安装 OpenVAS 9 步骤
- 关于List.contains()方法的探究
- 欢迎使用CSDN-markdown编辑器
- 文章标题
- Python String 的replace()与List的remove()
- css定位
- Java约瑟夫问题(丢手帕)的双向循环实现
- Ajax中window.location.href无法跳转的解决办法