-
Notifications
You must be signed in to change notification settings - Fork 0
/
VideoGame.java
79 lines (72 loc) · 1.92 KB
/
VideoGame.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
import java.util.*;
class VideoGame
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner kb = new Scanner(System.in);
int n = kb.nextInt();
int h = kb.nextInt();
int arr[] = new int[n];
for(int i=0; i<n; i++)
arr[i] = kb.nextInt();
ArrayList<Integer> com = new ArrayList<Integer>();
boolean flag = true;
while(flag){
int num = kb.nextInt();
if(num==0)
flag = false;
com.add(num);
}
boolean crane = false;
int pos = 0;
flag = true;
int x = -1;
while(flag){
x++;
switch(com.get(x)){
case 1:
pos = left(arr, n, h, pos, crane);
break;
case 2:
pos = right(arr, n, h, pos, crane);
break;
case 3:
crane = pick(arr, n, h, pos, crane);
break;
case 4:
crane = drop(arr, n, h, pos, crane);
break;
case 0:
flag = false;
}
}
for(int i =0; i<n; i++)
System.out.print(arr[i]+ " ");
}
public static boolean pick(int arr[], int n, int h, int pos, boolean crane){
if(arr[pos]!=0 && crane!=true){
crane = true;
arr[pos]--;
}
return crane;
}
public static boolean drop(int arr[], int n, int h, int pos, boolean crane){
if(arr[pos]!=h && crane!=false){
crane = false;
arr[pos]++;
}
return crane;
}
public static int left(int arr[], int n, int h, int pos, boolean crane){
if(pos!=0){
pos--;
}
return pos;
}
public static int right(int arr[], int n, int h, int pos, boolean crane){
if(pos!=n-1){
pos++;
}
return pos;
}
}