HDU 3232 Crossing Rivers

Crossing Rivers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1040 Accepted Submission(s): 535

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 chosen from 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.

Sample Input

1 1
0 1 2
0 1
0 0

Sample Output

Case 1: 1.000

Case 2: 1.000

A B 两个点间有n条河，河长、船速已知，求时间期望

我们单纯算过河时间的话，最快的是L/v,最慢的是3L/v,时间是满足线性变化规律，所以期望就是4L/2v=2L/v
(线性规划，三角形面积)

AC

#include <cstdio>
#include <cstdlib>

int main()
{
    int n,d;
    int cnt=0;
    while(scanf("%d%d",&n,&d))
    {
        if(n==0&&d==0)
            break;
        double time=0.0;
        if(n!=0)
        {
            for(int i=0; i<n; i++)
            {
                int p,L,v;
                scanf("%d%d%d",&p,&L,&v);
                time+=(2.0*L)/v;
                d-=L;
            }
        }
        cnt++;
        printf("Case %d: ",cnt);
        printf("%.3f\n\n",time+d);
    }
    return 0;
}