| Task: | Elevator Trouble |
| Sender: | ∂(Skill)/∂W ≤ 0 |
| Submission time: | 2015-09-02 20:48:32 +0300 |
| Language: | Java |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.20 s | details |
| #2 | ACCEPTED | 0.20 s | details |
| #3 | ACCEPTED | 0.20 s | details |
| #4 | ACCEPTED | 0.19 s | details |
| #5 | ACCEPTED | 0.19 s | details |
| #6 | ACCEPTED | 0.20 s | details |
| #7 | ACCEPTED | 0.21 s | details |
| #8 | ACCEPTED | 0.20 s | details |
| #9 | ACCEPTED | 0.19 s | details |
| #10 | ACCEPTED | 0.20 s | details |
| #11 | ACCEPTED | 0.20 s | details |
| #12 | ACCEPTED | 0.20 s | details |
Code
import java.util.Scanner;
public class Hissi {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int f=s.nextInt();
int l=s.nextInt();
int k=s.nextInt();
int u=s.nextInt();
int d=s.nextInt();
int painallukset=0;
boolean onko =false;
boolean[] kayty = new boolean[f+1];
while (true) {
if (l==k) {
break;
} else if (kayty[l]) {
onko=true;
break;
}
kayty[l]=true;
painallukset++;
if (l<k) {
if (l+u<=k) {
l+=u;
} else if (l-d>=0) {
l-=d;
} else if (l+u<=f) {
l+=u;
}
} else if (l>k) {
if (l-d>=k) {
l-=d;
} else if (l+u<=f) {
l+=u;
} else if (l-d>=0) {
l-=d;
}
}
}
if (onko) {
System.out.println("use the stairs");
} else {
System.out.println(painallukset);
}
}
}
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 |
