QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#77605 | #5505. Great Chase | zhangboju# | WA | 2ms | 5624kb | C++14 | 842b | 2023-02-15 10:03:01 | 2023-02-15 10:03:04 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
x=0;short f=1;char c=getchar();
for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
x*=f;return;
}
#define double long double
const int N=4e5+5;
const double eps=1e-5;
#define ll long long
int n;
ll p[N],v[N],k;
bool check(double x)
{
double maxx=-1e18,minx=1e18;
for(int i=1;i<=n;++i)
if(p[i]<0) maxx=max(maxx,p[i]+v[i]*x);
else minx=min(minx,p[i]-v[i]*x);
return minx<maxx;
}
int main()
{
int T;read(T);
while(T--)
{
read(n),read(k);
for(int i=1;i<=n;++i)
read(p[i]),read(v[i]);
double l=0,r=1e12;
while(r-l>eps)
{
double mid=(l+r)/2.0;
if(check(mid)) r=mid;
else l=mid;
}
printf("%.9Lf\n",l*k);
}
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 5624kb
input:
3 4 9 10 2 -7 2 -6 1 7 1 2 8 -1 7 1 6 2 3 -1000000000000 1 1000000000000 1
output:
38.249965695 1.230737734 2999999999999.999979258
result:
wrong answer 1st numbers differ - expected: '38.2500000', found: '38.2499657', error = '0.0000009'