1454: CF9 - B. Running Student
[Creator : ]
Description
And again a misfortune fell on Poor Student. He is being late for an exam.
Having rushed to a bus stop that is in point $(0,0)$, he got on a minibus and they drove along a straight line, parallel to axis OX, in the direction of increasing $x$.
Poor Student knows the following:
Poor Student knows the following:
- during one run the minibus makes $n$ stops, the $i$-th stop is in point $(x_i,0)$
- coordinates of all the stops are different
- the minibus drives at a constant speed, equal to $v_b$
- it can be assumed the passengers get on and off the minibus at a bus stop momentarily
- Student can get off the minibus only at a bus stop
- Student will have to get off the minibus at a terminal stop, if he does not get off earlier
- the University, where the exam will be held, is in point $(x_u,y_u)$
- Student can run from a bus stop to the University at a constant speedvsas long as needed
- a distance between two points can be calculated according to the following formula: $\sqrt{(x_2-x_1)^2+(y_2-y_1)^2}$
- Student is already on the minibus, so, he cannot get off at the first bus stop
Input
The first line contains three integer numbers: $2≤n≤100,1≤v_b,v_s≤1000$.
The second line contains $n$ non-negative integers in ascending order: coordinates $x_i$ of the bus stop with index $i$. It is guaranteed that $x_1$ equals to zero, and $x_n≤10^5$.
The third line contains the coordinates of the University, integers $x_u$ and $y_u$, not exceeding $10^5$ in absolute value.
The second line contains $n$ non-negative integers in ascending order: coordinates $x_i$ of the bus stop with index $i$. It is guaranteed that $x_1$ equals to zero, and $x_n≤10^5$.
The third line contains the coordinates of the University, integers $x_u$ and $y_u$, not exceeding $10^5$ in absolute value.
Output
In the only line output the answer to the problem − index of the optimum bus stop.
Sample 1 Input
4 5 2
0 2 4 6
4 1
Sample 1 Output
3
Sample 2 Input
2 1 1
0 100000
100000 100000
Sample 2 Output
2