Repository navigation
Expand file tree
/
Copy pathSolution.java
More file actions
59 lines (53 loc) · 1.44 KB
/
Copy pathSolution.java
File metadata and controls
59 lines (53 loc) · 1.44 KB
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
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for (int i = 0; i < t; i++) {
int size = sc.nextInt();
int jump = sc.nextInt();
int[] arr = new int[size];
for (int j = 0; j < size; j++) {
arr[j] = sc.nextInt();
}
boolean[] visited = new boolean[size];
if (solve(arr, visited, 0, jump, size)) {
System.out.println("YES");
} else {
System.out.println("NO");
}
}
}
public static boolean solve(int[] arr, boolean[] visited, int curr, int jump, int size) {
if (curr >= size) {
return true;
} else {
visited[curr] = true;
if (validJump(arr, visited, curr + jump, size)) {
return solve(arr, visited, curr + jump, jump, size);
}
if (validJump(arr, visited, curr + 1, size)) {
return solve(arr, visited, curr + 1, jump, size);
}
if (validJump(arr, visited, curr - 1, size)) {
return solve(arr, visited, curr - 1, jump, size);
}
}
return false;
}
public static boolean validJump(int[] arr, boolean[] visited, int index, int size) {
if (index < 0) {
return false;
}
if (index < size) {
if ((arr[index] == 1) || visited[index]) {
return false;
}
}
return true;
}
}