QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#708951#8022. WalkeroqmsacWA 1ms3960kbC++23941b2024-11-04 10:07:212024-11-04 10:07:27

Judging History

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

  • [2024-11-04 10:07:27]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3960kb
  • [2024-11-04 10:07:21]
  • 提交

answer

#include<bits/stdc++.h>

#define ll  long long
#define ull unsigned long long
#define ld long double
#define pii pair<ll,ll>
using namespace std;
#pragma GCC optimize(3)
#define N 100005
struct Node
{
    vector<string> s;
    vector<int> type;
    vector<int> e;
};
ll tot=1;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // freopen("")
    int T;
    cin>>T;
    while(T--)
    {
        ld n,p1,p2,v1,v2;
        cin>>n>>p1>>v1>>p2>>v2;
        if(p1>p2)
        {
            swap(p1,p2);
            swap(v1,v2);
        }
        ld ans=(n+p1)/v1;
        ld t2=(n*2-p2)/v2;
        ans=min(ans,t2);
        ld t3=(n*2+p1-p2)/(v1+v2);
        ans=min(t3,ans);
        ld t4=max(p1/v1,(n-p2+n-p1)/v2);
        ans=min(ans,t4);
        ld t5=max((n-p2)/v2,(p1+p2)/v1);
        ans=min(ans,t5);
        cout<<setprecision(15)<<ans<<endl;
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3900kb

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.83700137552

result:

ok 2 numbers

Test #2:

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

input:

1
10.0 1.0 10.0 9.0 0.1

output:

1.1

result:

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

Test #3:

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

input:

1
10.0 8.0 10.0 9.0 0.1

output:

1.8

result:

wrong answer 1st numbers differ - expected: '1.2000000', found: '1.8000000', error = '0.5000000'