Submission #736621
Source Code Expand
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define inf 2000000000
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
typedef pair<int,int> P;
int main(){
int L,X,Y,S,D;
cin>>L>>X>>Y>>S>>D;
double ans;
int Z=abs(X-Y);
if(S<=D){
if(Z==0) ans=(double)(D-S)/(Y+X);
else if(Y<X) ans=(double)(D-S)/(Y+X);
else ans=min((double)(D-S)/(Y+X),(double)(L+S-D)/(Y-X));
}
else{
if(Z==0)ans=(double)(L+D-S)/(Y+X);
else if(Y<X)ans=(double)(L+D-S)/(Y+X);
else ans=min((double)(L+D-S)/(Y+X),(double)(S-D)/(Y-X));
}
printf("%.10f\n",ans);
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | A - 動く歩道 |
| User | luan273 |
| Language | C++14 (GCC 5.4.1) |
| Score | 100 |
| Code Size | 671 Byte |
| Status | AC |
| Exec Time | 4 ms |
| Memory | 256 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 100 / 100 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
| All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 01.txt | AC | 4 ms | 256 KiB |
| 02.txt | AC | 4 ms | 256 KiB |
| 03.txt | AC | 4 ms | 256 KiB |
| 04.txt | AC | 4 ms | 256 KiB |
| 05.txt | AC | 4 ms | 256 KiB |
| 06.txt | AC | 4 ms | 256 KiB |
| 07.txt | AC | 4 ms | 256 KiB |
| 08.txt | AC | 4 ms | 256 KiB |
| 09.txt | AC | 4 ms | 256 KiB |
| 10.txt | AC | 4 ms | 256 KiB |
| 11.txt | AC | 4 ms | 256 KiB |
| 12.txt | AC | 4 ms | 256 KiB |
| 13.txt | AC | 4 ms | 256 KiB |
| 14.txt | AC | 4 ms | 256 KiB |
| 15.txt | AC | 4 ms | 256 KiB |
| 16.txt | AC | 4 ms | 256 KiB |
| sample_01.txt | AC | 4 ms | 256 KiB |
| sample_02.txt | AC | 4 ms | 256 KiB |
| sample_03.txt | AC | 4 ms | 256 KiB |
| sample_04.txt | AC | 4 ms | 256 KiB |