New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Ninja And The Class Room

Contributed by

Omkar Deshmukh

Easy

0/40

Avg time to solve 12 mins

Success Rate 89 %

3 upvotes

Problem Statement

Ninja has been asked to make the seating arrangement during the exam. Given an array ‘A’ of ‘N’ integers where ‘A[i] = 1’ means there is a student seated at the index ‘i’ and ‘A[i] = 0’ means that the place is currently unoccupied.

Provided no two students can seat adjacent to each other Ninjas has been asked to place extra ‘K’ students in the classroom.

Return 1 if the Ninja is able to place that extra ‘K’ student else return 0.

Example :

Input: ‘N’ = 7, ‘K’ = 2, ‘A’ = [1, 0, 0, 0, 1, 0, 0]
Output: 1

It is possible to place locations 2 and 6 (0-indexed) the updated array will be [1, 0, 1, 0, 1, 0, 1] Here no two students are adjacent to each other.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format:

The first line contains a single integer ‘T’ denoting the number of test cases, then the test case follows.

For each test case, the first line will contain two spaced integers ‘N’, the size of an input array ‘A’ and ‘K’. The second line will contain the ‘N’ spaced integers denoting the array ‘A’ values.

Output Format:

For each test case print, 1 if the Ninja is able to place that extra ‘K’ student else print 0.

Output for each test case will be printed on a separate line.

Note:

You are not required to print anything; it has already been taken care of. Just implement the function.

Constraints:

1 ≤ T ≤ 10
1 ≤ N ≤ 10^5
0 ≤ K ≤ 10^9
0 ≤ ‘A[i]’ ≤ 1
It is guaranteed that the sum of ‘N’ is ≤ 10^5 for all test cases.

Time limit: 1 sec

Sample Input 1 :

Sample Output 1 :

1
0

Explanation For Sample Input 1 :

For test case 1:
It is possible to place at locations 2 and 4 (0-indexed) the updated array will be [1, 0, 1, 0, 1] Here no two students are adjacent to each other.

For test case 2:
For any possible combinations, there is no way to place the students.

Sample Input 2 :

Sample Output 2 :

0
1

Auto

Console