Task: | Elevator Trouble |
Sender: | ☃☃☃ |
Submission time: | 2015-09-02 16:55:40 +0300 |
Language: | Java |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.17 s | details |
#2 | ACCEPTED | 0.17 s | details |
#3 | ACCEPTED | 0.21 s | details |
#4 | ACCEPTED | 0.19 s | details |
#5 | ACCEPTED | 0.17 s | details |
#6 | ACCEPTED | 0.21 s | details |
#7 | ACCEPTED | 0.21 s | details |
#8 | ACCEPTED | 0.23 s | details |
#9 | ACCEPTED | 0.17 s | details |
#10 | ACCEPTED | 0.22 s | details |
#11 | ACCEPTED | 0.21 s | details |
#12 | ACCEPTED | 0.17 s | details |
Code
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 details
Test 1
Verdict: ACCEPTED
input |
---|
10 1 10 2 1 |
correct output |
---|
6 |
user output |
---|
6 |
Test 2
Verdict: ACCEPTED
input |
---|
100 2 1 1 0 |
correct output |
---|
use the stairs |
user output |
---|
use the stairs |
Test 3
Verdict: ACCEPTED
input |
---|
1000000 1 1000000 1 1 |
correct output |
---|
999999 |
user output |
---|
999999 |
Test 4
Verdict: ACCEPTED
input |
---|
1000000 1 1000000 0 1 |
correct output |
---|
use the stairs |
user output |
---|
use the stairs |
Test 5
Verdict: ACCEPTED
input |
---|
1000000 1 1000000 0 0 |
correct output |
---|
use the stairs |
user output |
---|
use the stairs |
Test 6
Verdict: ACCEPTED
input |
---|
1000000 1 1000000 1 0 |
correct output |
---|
999999 |
user output |
---|
999999 |
Test 7
Verdict: ACCEPTED
input |
---|
1000000 1000000 1 0 1 |
correct output |
---|
999999 |
user output |
---|
999999 |
Test 8
Verdict: ACCEPTED
input |
---|
1000000 2 99999 2 1 |
correct output |
---|
50000 |
user output |
---|
50000 |
Test 9
Verdict: ACCEPTED
input |
---|
10 5 4 6 2 |
correct output |
---|
use the stairs |
user output |
---|
use the stairs |
Test 10
Verdict: ACCEPTED
input |
---|
1000000 1000000 1000000 100000... |
correct output |
---|
0 |
user output |
---|
0 |
Test 11
Verdict: ACCEPTED
input |
---|
456789 2 456789 2 1 |
correct output |
---|
228395 |
user output |
---|
228395 |
Test 12
Verdict: ACCEPTED
input |
---|
100 50 51 4 6 |
correct output |
---|
use the stairs |
user output |
---|
use the stairs |