codeforces 703c（简单几何）

C. Chris and Road

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

And while Mishka is enjoying her trip...

Chris is a little brown bear. No one knows, where and when he met Mishka, but for a long time they are together (excluding her current trip). However, best friends are important too. John is Chris' best friend.

Once walking with his friend, John gave Chris the following problem:

At the infinite horizontal road of width w, bounded by lines y = 0 and y = w, there is a bus moving, presented as a convex polygon of nvertices. The bus moves continuously with a constant speed of v in a straight Ox line in direction of decreasing x coordinates, thus in time only x coordinates of its points are changing. Formally, after time t each of x coordinates of its points will be decreased by vt.

There is a pedestrian in the point (0, 0), who can move only by a vertical pedestrian crossing, presented as a segment connecting points (0, 0) and (0, w) with any speed not exceeding u. Thus the pedestrian can move only in a straight line Oy in any direction with any speed not exceeding u and not leaving the road borders. The pedestrian can instantly change his speed, thus, for example, he can stop instantly.

Please look at the sample note picture for better understanding.

We consider the pedestrian is hit by the bus, if at any moment the point he is located in lies strictly inside the bus polygon (this means that if the point lies on the polygon vertex or on its edge, the pedestrian is not hit by the bus).

You are given the bus position at the moment 0. Please help Chris determine minimum amount of time the pedestrian needs to cross the road and reach the point (0, w) and not to be hit by the bus.

Input

The first line of the input contains four integers n, w, v, u (3 ≤ n ≤ 10 000, 1 ≤ w ≤ 109, 1 ≤ v,  u ≤ 1000) — the number of the bus polygon vertices, road width, bus speed and pedestrian speed respectively.

The next n lines describes polygon vertices in counter-clockwise order. i-th of them contains pair of integers xi and yi ( - 109 ≤ xi ≤ 109,0 ≤ yi ≤ w) — coordinates of i-th polygon point. It is guaranteed that the polygon is non-degenerate.

Output

Print the single real t — the time the pedestrian needs to croos the road and not to be hit by the bus. The answer is considered correct if its relative or absolute error doesn't exceed 10 - 6.

Example

input

5 5 1 2
1 2
3 1
4 3
3 4
1 4

output

5.0000000000

Note

Following image describes initial position in the first sample case:

【题意】有一个凸多边形的客车，和一个旅客，客车有固定的速度，人的速度可以变化有一个峰值，问人从（0,0）到达（0，w）且与车不发生碰撞的最短时间。（人与凸多边形的边重合不算碰撞）

【分析】我们可以考虑两种情况：

（1）人直接过去，在客车还没过去之前。

（2）人等车过去之后再过去。

针对（1），我们只需要判断在每个点到达y轴之前，我们的人是否已经越过这个点就好了。

针对（2），我们的人的行走分成两段：1.在等待车，并尽量跟随着车；2.前方没有阻碍了，全速前进。

由于每个点都可能成为分界点，我们只要枚举所有的点求一个最大值就 好了。

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<vector>

#define F first
#define S second
#define mp make_pair
using namespace std;
typedef __int64 LL;
const LL mod = 1000000007;
const int maxn = 1e4 + 10;

pair <double,double> p[maxn];
int main()
{
    int n;
    double w,v,u;
    scanf("%d%lf%lf%lf",&n,&w,&v,&u);
    for(int i=1; i<=n; i++)
        scanf("%lf%lf",&p[i].F,&p[i].S);
    double minsum=(w/u);
    bool flag=true;
    for(int i=1; i<=n; i++)
    {
        if(p[i].S/u>p[i].F/v||p[i].F<0) flag=false;
        double x=max(p[i].F/v,p[i].S/u);
        minsum=max(minsum,x+(w-p[i].S)/u);
    }
    if(!flag)
        printf("%.10f\n",minsum);
    else printf("%.10f\n",w/u);
    return 0;
}