Codeforces Round 386 (Div. 2)
C
Tram
Codeforces
1600
原题
← BD →
翻译中…

The tram in Berland goes along a straight line from the point $0$ to the point $*s*$ and back, passing $1$ meter per $*t*_{1}$ seconds in both directions. It means that the tram is always in the state of uniform rectilinear motion, instantly turning around at points $*x* = 0$ and $*x* = *s*$.

翻译中…

Igor is at the point $*x*_{1}$. He should reach the point $*x*_{2}$. Igor passes $1$ meter per $*t*_{2}$ seconds.

翻译中…

Your task is to determine the minimum time Igor needs to get from the point $*x*_{1}$ to the point $*x*_{2}$, if it is known where the tram is and in what direction it goes at the moment Igor comes to the point $*x*_{1}$.

翻译中…

Igor can enter the tram unlimited number of times at any moment when his and the tram's positions coincide. It is not obligatory that points in which Igor enter and exit the tram are integers. Assume that any boarding and unboarding happens instantly. Igor can move arbitrary along the line (but not faster than $1$ meter per $*t*_{2}$ seconds). He can also stand at some point for some time.

翻译中…

Input

翻译中…

The first line contains three integers $*s*$, $*x*_{1}$ and $*x*_{2}$ ($2 ≤ *s* ≤ 1000$, $0 ≤ *x*_{1}, *x*_{2} ≤ *s*$, $*x*_{1} ≠ *x*_{2}$) — the maximum coordinate of the point to which the tram goes, the point Igor is at, and the point he should come to.

翻译中…

The second line contains two integers $*t*_{1}$ and $*t*_{2}$ ($1 ≤ *t*_{1}, *t*_{2} ≤ 1000$) — the time in seconds in which the tram passes $1$ meter and the time in seconds in which Igor passes $1$ meter.

翻译中…

The third line contains two integers $*p*$ and $*d*$ ($1 ≤ *p* ≤ *s* - 1$, $*d*$ is either $1$ or image) — the position of the tram in the moment Igor came to the point $*x*_{1}$ and the direction of the tram at this moment. If image, the tram goes in the direction from the point $*s*$ to the point $0$. If $*d* = 1$, the tram goes in the direction from the point $0$ to the point $*s*$.

翻译中…

Output

翻译中…

Print the minimum time in seconds which Igor needs to get from the point $*x*_{1}$ to the point $*x*_{2}$.

翻译中…

Note

翻译中…

In the first example it is profitable for Igor to go by foot and not to wait the tram. Thus, he has to pass $2$ meters and it takes $8$ seconds in total, because he passes $1$ meter per $4$ seconds.

翻译中…

In the second example Igor can, for example, go towards the point $*x*_{2}$ and get to the point $1$ in $6$ seconds (because he has to pass $3$ meters, but he passes $1$ meters per $2$ seconds). At that moment the tram will be at the point $1$, so Igor can enter the tram and pass $1$ meter in $1$ second. Thus, Igor will reach the point $*x*_{2}$ in $7$ seconds in total.

翻译中…

样例

Input #1
4 2 4
3 4
1 1
Output #1
8
InputCopy OutputCopy
Input #2
5 4 0
1 2
3 1
Output #2
7
InputCopy OutputCopy
题目信息
题号
746C
时间限制
1 s
内存限制
256 MB
标签
构造
模拟
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。