Elevator Trouble

import java.util.*;
public class ElevatorTrouble {
public static void main(String[] args) {
	IO io = new IO();
	
	int f = io.nextInt();
	int s = io.nextInt();
	int g = io.nextInt();
	int u = io.nextInt();
	int d = io.nextInt();
	
	int[] dist = new int[f + 1];
	Arrays.fill(dist, -1);
	ArrayDeque<Integer> Q = new ArrayDeque<>();
	
	Q.push(s);
	dist[s] = 0;
	
	while(!Q.isEmpty()) {
		int v = Q.pop();
		
		int x = v - d;
		int y = v + u;
		
		if(x >= 1 && dist[x] == -1) {
			dist[x] = dist[v] + 1;
			Q.push(x);
		}
		
		if(y <= f && dist[y] == -1) {
			dist[y] = dist[v] + 1;
			Q.push(y);
		}
	}
	
	if(dist[g] == -1) {
		io.println("use the stairs");
	} else {
		io.println(dist[g]);
	}
	
	io.close();
}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED