AcWing 5569. 奶牛过马路
原题链接
困难
作者:
最后五分钟
,
2024-04-26 12:38:56
,
所有人可见
,
阅读 4
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define de(x) cout<<#x<<" = "<<x<<" "
#define deg(x) cout<<#x<<" = "<<x<<endl
#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
const int N=10010,M=10010;
typedef pair<int,int> PII;
PII a[N];
signed main()
{
//io;
int n,e,v2,v1;
cin>>n>>e>>v2>>v1;
for(int i=1;i<=n;i++)
{
int x,y;
cin>>x>>y;
a[i]={x,y};
}
double k1=1.0*v1/v2;
int ok1=1,ok2=1;
double minb=0;
for(int i=1;i<=n;i++)
{
double x=a[i].x,y=a[i].y;
double k;
minb=min(minb,y-k1*x);
if(x==0)k=1e16;
else k=y/x;
if(x>=0&&k<k1)ok1=0;
else if(k!=k1)ok2=0;
}
if(ok1||ok2)printf("%.7f\n",1.0*e/v1);
else
{
printf("%.7f\n",-minb/v1+1.0*e/v1);
}
return 0;
}