ELEVTRBL  Elevator Trouble
You are on your way to your rst job interview as a program tester, and you are already
late. The interview is in a skyscraper and you are currently in
oor s, where you see an
elevator. Upon entering the elvator, you learn that it has only two buttons, marked UP
u" and DOWN d". You conclude that the UPbutton takes the elevator u
floors up
(if there aren't enough
oors, pressing the UPbotton does nothing, or at least so you
assume), whereas the DOWNbutton takes you d stories down (or none if there aren't
enough). Knowing that the interview is at
floor g, and that there are only f
floors in
the building, you quickly decide to write a program that gives you the amount of button
pushes you need to perform. If you simply cannot reach the correct
floor, your program
halts with the message "use the stairs".
Given input f, s, g, u and d (
floors, start, goal, up, down), nd the shortest sequence
of button presses you must press in order to get from s to g, given a building of floors,
or output "use the stairs" if you cannot get from s to g by the given elevator.
Input
The input will consist of one line, namely f s g u d, where 1 <= s; g <= f <= 1000000 and
0 <= u; d <= 1000000. The
floors are oneindexed, i.e. if there are 10 stories, s and g be in
[1; 10].
Output
You must reply with the minimum numbers of pushes you must make in order to get from
s to g, or output use the stairs if it is impossible given the conguration of the elvator.
Example
Input: 10 1 10 2 1 Output: 6
hide comments
nitin jain:
20160128 21:05:05
simple BFS :)


darkhire21:
20160117 18:40:49
graph is too big declare queue at top ...!! 

Deepak :
20160109 12:58:43
just bfs :) 

gaurav_994:
20151228 06:09:03
can i in any way find the testcases for this problem i m getting wrong answer cant find why 

Advitiya:
20151019 19:50:16
BFS kills it ! :P 

dev:
20151013 01:43:26
simple bfs ! 

AYUSH SAHU:
20150822 12:17:36
my 50th :)


ADITYA JAIN:
20150731 16:15:10
My 100th :) 

Saksham :
20150727 14:00:26
BFS rocks!! AC in 1 go 

Abhinandan Agarwal:
20150727 10:13:05
Simple BFS gives 0.00s ! :) 
Added by:  Krzysztof Lewko 
Date:  20111006 
Time limit:  0.148s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Nordic programming contest 