QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#617469#8022. WalkerOkuchiriWA 0ms3940kbC++202.5kb2024-10-06 15:41:462024-10-06 15:41:48

Judging History

你现在查看的是最新测评结果

  • [2024-10-06 15:41:48]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3940kb
  • [2024-10-06 15:41:46]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 998244353
using namespace std;
ld n,a,b,v1,v2;
void work()
{
    cin>>n>>a>>v1>>b>>v2;
    
    if(a>b)
    {
        swap(a,b);
        swap(v1,v2);
    }
    ld a1=a,b1=n-b;
    ld ans=min((a+n)/v1,(b+n)/v2);
    ans=min({(n-a+n)/v1,(n-b+n)/v2,ans});
    
    ans=min(ans, max(a/v1,    min((2*(b-a)+n-b)/v2,(2*(n-b)+b-a)/v2)));
    ans=min(ans, max((n-b)/v2,min((2*a+b-a)/v1,(2*(b-a)+a)/v1)));
    if(2*a1<=n-2*b1)
    {
        ld x=(2*v1*b1+(b-a1)*v1-v2*a1)/(2*v2+v1);
        if(x>=0&&x<=a1)
        {
            ans=min(ans,(a1+2*x)/v1);
        }
        ans=min(ans,max(3*a1/v1,(2*b1+b-2*a1)/v2));
        x=(2*b1*v1+(b-a1)*v1-2*a1*v2)/(v1+v2);
        if(x>=a1&&x<=b-a-b1)
        {
            ans=min(ans,(2*a1+x)/v1);
        }
        ans=min(ans,max(3*b1/v2,(2*a1+b-a-b1)/v1));
        x=(v1*b1+2*(b-a1)*v1-2*a1*v2)/(v2+2*v1);
        if(x>=b-a-b1&&x<=b-a)
        {
            ans=min(ans,(2*a1+x)/v1);
        }
    }
    else if(a+a1<=b&&n-2*b1>=a)
    {
        ld x=(2*v1*b1+(b-a1)*v1-v2*a1)/(2*v2+v1);
        if(x>=0&&x<=b-a-b1)
        {
            ans=min(ans,(a1+2*x)/v1);
        }
        ans=min(ans,max(3*b1/v2,(2*(b-a-b1)+a)/v1));
        x=(v1*b1+2*(b-a1)*v1-v2*a1)/(2*v2+2*v1);
        if(x>=b-a-b1&&x<=a1)
        {
            ans=min(ans,(a1+2*x)/v1);
        }
        ans=min(ans,max(3*a1/v1,(2*(b-2*a1)+b1)/v2));
        x=(v1*b1+2*(b-a1)*v1-2*a1*v2)/(v2+2*v1);
        if(x>=a1&&x<=b-a)
        {
            ans=min(ans,(x+2*a1)/v1);
        }
    }
    else if(b-b1>=a)
    {
        ld x=(2*v1*b1+v1*(b-a)-a1*v2)/(2*v2+v1);
        if(x>=0&&x<=b-a-b1)
        {
            ans=min(ans,(2*x+a1)/v1);
        }
        ans=min(ans,max((2*(b-a-b1)+a1)/v1,3*b1/v2));
        x=(v1*b1+2*(b-a)*v1-v2*a1)/(2*v2+2*v1);
        if(x>=b-a-b1&&x<=b-a)
        {
            ans=min(ans,(2*x+a1)/v1);
        }
    }
    else if(a1*2<=b)
    {
        ld x=(2*v1*b1+v1*(b-a)-a1*v2)/(2*v2+v1);
        if(x>=0&&x<=a1)
        {
            ans=min(ans,(2*x+a1)/v1);
        }
        ans=min(ans,max(3*a1/v1,(2*(b-2*a1)+b1)/v2));
        x=(v1*b1+2*(b-a)*v1-2*v2*a1)/(v2+2*v1);
        if(x>=a1&&x<=b-a)
        {
            ans=min(ans,(2*a1+x)/v1);
        }
    }
    ans=min(ans,max(b/v2,(n-a)/v1));
    cout<<fixed<<setprecision(6)<<ans<<'\n';
}
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)
    {
        work();
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3848kb

input:

2
10000.0 1.0 0.001 9999.0 0.001
4306.063 4079.874 0.607 1033.423 0.847

output:

5001000.000000
3827.837001

result:

ok 2 numbers

Test #2:

score: 0
Accepted
time: 0ms
memory: 3940kb

input:

1
10.0 1.0 10.0 9.0 0.1

output:

1.100000

result:

ok found '1.1000000', expected '1.1000000', error '0.0000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3820kb

input:

1
10.0 8.0 10.0 9.0 0.1

output:

1.200000

result:

ok found '1.2000000', expected '1.2000000', error '0.0000000'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3936kb

input:

1
10.0 8.0 0.1 9.0 10

output:

1.100000

result:

ok found '1.1000000', expected '1.1000000', error '0.0000000'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3792kb

input:

1
10.0 2.0 0.1 3.0 10

output:

1.300000

result:

ok found '1.3000000', expected '1.3000000', error '0.0000000'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3800kb

input:

1
10.0 9.0 0.1 8.0 10.0

output:

1.200000

result:

ok found '1.2000000', expected '1.2000000', error '0.0000000'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3864kb

input:

1
10.0 4.0 0.1 6.0 0.1

output:

60.000000

result:

ok found '60.0000000', expected '60.0000000', error '0.0000000'

Test #8:

score: -100
Wrong Answer
time: 0ms
memory: 3872kb

input:

1
10.0 4.5 0.1 6.0 0.1

output:

60.000000

result:

wrong answer 1st numbers differ - expected: '57.5000000', found: '60.0000000', error = '0.0434783'