Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Solution {
- public static boolean canWin(int leap, int[] game) {
- // Return true if you can win the game; otherwise, return false.
- int n = game.length;
- boolean[] boolist = new boolean[n];
- boolean result = false;
- int n1 = 0;
- while(n1 != boolist.length){
- result = result && boolist[n1];
- n1++;
- }
- if (result == true){
- return true;
- }
- else
- return false;
- /*
- int move_fwd(int[] game,int i){
- if(game[i+1]==0){
- return i+1;
- }
- }
- int move_back(int[] game, int i){
- if(game[i-1]==0){
- return i-1;
- }
- }
- int move_leap(int [] game, int i){
- if(game[i+leap]==0 || i+leap>=n){
- return i+leap;
- }
- }
- int last_ele(int i){
- if(i==n-1){
- return i;
- }
- } */
- boolean check(int v1, int v2, int v3, int v4){
- if(v1 >= n || v2 >=n || v3 >= n || v4 == n-1){
- return true;
- }
- else
- return false;
- }
- for (int index = 0; index<game.length; index++){
- int var1;
- int var2;
- int var3;
- int var4;
- if(game[i+1]==0){
- var1 = i+1;
- }
- if(game[i-1]==0){
- var2 = i-1;
- }
- if(game[i+leap]==0 || i+leap>=n){
- var3 = i+leap;
- }
- if(i==n-1){
- var4 = i;
- }
- //var2 = move_back(game, index);
- //var3 = move_leap(game,index);
- //var4 = last_ele(index);
- boolist[index] = check(var1, var2, var3, var4);
- }
- }
- 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)) ? "YES" : "NO" );
- }
- scan.close();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement