陈老师的多校联合2010811c题||09年武汉站||hdu3232
来源:互联网 发布:第一人称冒险游戏java 编辑:程序博客网 时间:2024/05/17 09:25
http://acm.hdu.edu.cn/showproblem.php?pid=3232
Problem Description
You live in a village but work in another village. You decided to follow the straight path between your house (A) and the working place (B), but there are several rivers you need to cross. Assume B is to the right of A, and all the rivers lie between them.
Fortunately, there is one "automatic" boat moving smoothly in each river. When you arrive the left bank of a river, just wait for the boat, then go with it. You're so slim that carrying you does not change the speed of any boat.
Days and days after, you came up with the following question: assume each boat is independently placed at random at time 0, what is the expected time to reach B from A? Your walking speed is always 1.
To be more precise, for a river of length L, the distance of the boat (which could be regarded as a mathematical point) to the left bank at time 0 is uniformly chosenfrom interval [0, L], and the boat is equally like to be moving left or right, if it’s not precisely at the river bank.
Fortunately, there is one "automatic" boat moving smoothly in each river. When you arrive the left bank of a river, just wait for the boat, then go with it. You're so slim that carrying you does not change the speed of any boat.
Days and days after, you came up with the following question: assume each boat is independently placed at random at time 0, what is the expected time to reach B from A? Your walking speed is always 1.
To be more precise, for a river of length L, the distance of the boat (which could be regarded as a mathematical point) to the left bank at time 0 is uniformly chosenfrom interval [0, L], and the boat is equally like to be moving left or right, if it’s not precisely at the river bank.
Input
There will be at most 10 test cases. Each case begins with two integers n and D, where n (0 <= n <= 10) is the number of rivers between A and B, D (1 <= D <= 1000) is the distance from A to B. Each of the following n lines describes a river with 3 integers: p, L and v (0 <= p < D, 0 < L <= D, 1 <= v <= 100). p is the distance from A to the left bank of this river, L is the length of this river, v is the speed of the boat on this river. It is guaranteed that rivers lie between A and B, and they don’t overlap. The last test case is followed by n=D=0, which should not be processed.
Output
For each test case, print the case number and the expected time, rounded to 3 digits after the decimal point.
Print a blank line after the output of each test case.
Print a blank line after the output of each test case.
Sample Input
1 10 1 20 10 0
Sample Output
Case 1: 1.000Case 2: 1.000
#include <stdio.h>#include <iostream>#include <algorithm>using namespace std;int n;double m,p,l,v;int main(){ int tt=0; while(~scanf("%d%lf",&n,&m)) { if(n==0&&m==0) break; double sum=0.0,sum1=0.0; for(int i=0;i<n;i++) { scanf("%lf%lf%lf",&p,&l,&v); sum+=(l*2.0)/v; sum1+=l; } printf("Case %d: ",++tt); printf("%.3lf\n\n",sum+m-sum1); } return 0;}
Problem Description
You live in a village but work in another village. You decided to follow the straight path between your house (A) and the working place (B), but there are several rivers you need to cross. Assume B is to the right of A, and all the rivers lie between them.
Fortunately, there is one "automatic" boat moving smoothly in each river. When you arrive the left bank of a river, just wait for the boat, then go with it. You're so slim that carrying you does not change the speed of any boat.
Days and days after, you came up with the following question: assume each boat is independently placed at random at time 0, what is the expected time to reach B from A? Your walking speed is always 1.
To be more precise, for a river of length L, the distance of the boat (which could be regarded as a mathematical point) to the left bank at time 0 is uniformly chosenfrom interval [0, L], and the boat is equally like to be moving left or right, if it’s not precisely at the river bank.
Fortunately, there is one "automatic" boat moving smoothly in each river. When you arrive the left bank of a river, just wait for the boat, then go with it. You're so slim that carrying you does not change the speed of any boat.
Days and days after, you came up with the following question: assume each boat is independently placed at random at time 0, what is the expected time to reach B from A? Your walking speed is always 1.
To be more precise, for a river of length L, the distance of the boat (which could be regarded as a mathematical point) to the left bank at time 0 is uniformly chosenfrom interval [0, L], and the boat is equally like to be moving left or right, if it’s not precisely at the river bank.
Input
There will be at most 10 test cases. Each case begins with two integers n and D, where n (0 <= n <= 10) is the number of rivers between A and B, D (1 <= D <= 1000) is the distance from A to B. Each of the following n lines describes a river with 3 integers: p, L and v (0 <= p < D, 0 < L <= D, 1 <= v <= 100). p is the distance from A to the left bank of this river, L is the length of this river, v is the speed of the boat on this river. It is guaranteed that rivers lie between A and B, and they don’t overlap. The last test case is followed by n=D=0, which should not be processed.
Output
For each test case, print the case number and the expected time, rounded to 3 digits after the decimal point.
Print a blank line after the output of each test case.
Print a blank line after the output of each test case.
Sample Input
1 10 1 20 10 0
Sample Output
Case 1: 1.000Case 2: 1.000
0 0
- 陈老师的多校联合2010811c题||09年武汉站||hdu3232
- 陈老师的多校联合2009年武汉站D题 ||hdu 3033
- 陈老师的多校联合20140811||HDU 3236 ||2009年武汉站G题 01背包问题
- 陈老师的多校联合 20140809 C题
- 陈老师的多校联合 I题 二分
- 陈老师的多校联合 20140808 E题
- 陈老师的多校联合 20140809
- 陈老师的多校联合20180808 map映射字符串
- 陈老师的多校联合20140815 ||uvalive 5881 区间处理
- 陈老师的多校联合20140816||spoj10237 bfs
- 陈老师的多校联合20140818||Uvalive 5683 模拟
- 陈老师的多校联合 D题 字符串处理起来挺麻烦
- 陈老师的多校联合20140816A题||spoj 10228 动态规划
- UVALive 5691 二分图匹配||陈老师的多校联合20140818 J题
- 陈老师的多校联合20140816||SPOJ AMR11B 三角形的有向面积
- 陈老师的艺术人生
- 2016年武汉科技大学邀请赛网络赛 C题
- 百度2014校招系统分析师笔试题(武汉站)
- 主成分分析与白化预处理
- POJ 1323-Game Prediction(贪心)
- javascript中解析四则运算表达式的算法和示例
- HTML中的超链接
- toad导出表的数据
- 陈老师的多校联合2010811c题||09年武汉站||hdu3232
- JMM介绍
- Runtime类
- [LeetCode]Longest Substring Without Repeating Characters
- Labwindows/CVI下调用openCV实现多摄像头切换
- 母函数之Big Event in HDU hdoj 1171
- bnu36905 Nested Segments 离散化+线段树
- Android开发周围wifi热点和属性的获取
- 一些有用的数论知识。(莫比乌斯反演)