-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy pathSolution.java
34 lines (27 loc) · 902 Bytes
/
Solution.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
import java.util.*;
public class Solution {
public static boolean canWin(int leap, int[] game, int i) {
if (i < 0 || game[i] == 1)
return false;
if (i + 1 >= game.length || i + leap >= game.length)
return true;
game[i] = 1; //flag
return canWin(leap, game, i + leap)
|| canWin(leap, game, i + 1)
|| canWin(leap, game, i - 1);
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int q = scan.nextInt();
while (q-- > 0) {
int n = scan.nextInt();
int leap = scan.nextInt();
int[] game = new int[n];
for (int i = 0; i < n; i++) {
game[i] = scan.nextInt();
}
System.out.println((canWin(leap, game, 0)) ? "YES" : "NO");
}
scan.close();
}
}