QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#768784 | #8022. Walker | surenjamts# | WA | 0ms | 3888kb | C++20 | 1.2kb | 2024-11-21 14:26:59 | 2024-11-21 14:26:59 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
double n,p1,v1,p2,v2;
cin>>n>>p1>>v1>>p2>>v2;
if(p1 > p2) swap(p1, p2), swap(v1, v2);
auto check = [&](double mid){
double l1 = mid * v1, l2 = mid * v2;
double x1 = (l1 - p1) / 2;
double x2 = (l2 - (n - p2)) / 2;
if(p1 + x1 > p2 - x2) return 1;
x1 = (l1 - p1) / 2;
x2 = (l2 - 2 * (n - p2));
if(p1 + x1 > p2 - x2) return 1;
x1 = (l1 - 2 * p1);
x2 = (l2 - (n - p2)) / 2;
if(p1 + x1 > p2 - x2) return 1;
x1 = (l1 - p1 * 2);
x2 = (l2 - (n - p2) * 2);
if(p1 + x1 > p2 - x2) return 1;
if(l1 >= (n - p1) && l2 >= p2) return 1;
return 0;
};
double l = 0, r = 1e9;
for(int i = 0; i < 200; i++){
double mid = (l + r)/2;
if(check(mid)) r = mid;
else l = mid;
}
cout << setprecision(18) << l << '\n';
}
signed main(){
int t;
cin>>t;
while(t--) solve();
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3888kb
input:
2 10000.0 1.0 0.001 9999.0 0.001 4306.063 4079.874 0.607 1033.423 0.847
output:
5001000 3827.83700137551614
result:
ok 2 numbers
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3708kb
input:
1 10.0 1.0 10.0 9.0 0.1
output:
1.0447761194029852
result:
wrong answer 1st numbers differ - expected: '1.1000000', found: '1.0447761', error = '0.0502035'