Sphere Online Judge

SPOJ Problem Set (classical)

9655. Elevator Trouble

Problem code: ELEVTRBL


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 UP-button takes the elevator u
floors up
(if there aren't enough
oors, pressing the UP-botton does nothing, or at least so you
assume), whereas the DOWN-button 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 one-indexed, 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 con guration of the elvator.

Example

Input:
10 1 10 2 1
Output:
6

Added by:Krzysztof Lewko
Date:2011-10-06
Time limit:1s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All
Resource:Nordic programming contest

hide comments
2014-08-16 13:56:56 AAKASH TYAGI
declare array as static int to avoid sigsegv
2013-09-06 17:35:30 -_-
awesome problem :)
2012-09-22 11:46:49 Rahul Dubey
take care of the case if(s==g ) output is 0; it caused me 5-6 wrong answer :(:(
Also Test cases are too weak.. wrong solution getting accepted :P


Last edit: 2012-09-30 21:40:27
2012-07-21 11:36:39 Ajey Golsangi
Clear problem description found here http://ncpc.idi.ntnu.no/ncpc2011/ncpc2011problems.pdf
2012-07-16 11:08:06 :D
I just rechecked my old submission and it still passes with roughly the same time. The problem is ok and your solution is simply to weak. It's not the first time when the author's solution is too weak for SPOJ standards ;)
2012-07-16 01:57:50 voodoo
I did the problem, and I submitted, but I got TL, and I tried submitting the solution given by the problem setter but got TL too...so, there is something wrong here.(java)
2012-02-12 22:27:58 hibernating
y tle :(
my solution is O(minimum number of pushes)
2011-10-31 11:37:11 Chandan Giri
using recursion was a big mistake!!! :(
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.