CRAN04  Audition
Penny is a terrible waitress and even worse actress, however recently she applied for a role in an upcoming TV series. Even though she thought she had no chance, she was called for an audition. She was very happy about it until she found out that her character in this new series will be a studious, high IQ girl named Megan. Producer told her that to get the role of Megan she had to prove that her mind can handle a bit of mathematics and reasoning. If she passed the test then she will be given the role of Megan. The test was as follow.
The people (Boys and Girls) who came for audition are standing in a line in a random order. Producer has to select exactly K boys for the show. So he asks Penny to tell how many ways can he select two numbers i and j such that the number of boys standing between these (including I and j) indexes is exactly K.
Penny desperately needs this role. Everybody knows that Penny is not a very smart and requests you to help her.
Input
First line contains T – The number of test cases.
Next line contains space separated N and K.
N – The total number of boys and girls who came to audition.
K – The number of the boys who must be there between each (i, j) pair.
Next line contains a nonempty string consisting of '1' and '0'.
1 represents Boy.
0 represents Girl.
Output
The number of (i, j) pairs such that the number of boys between index i and j, both inclusive is equal to K.
Constraints
1<=T<=10
1<=N<=10^6
0<=K<=10^6
Example
Input:3
4 1
0101
5 2
01010
5 4
01010
Output: 6
4
0
hide comments
scolar_fuad:
20191111 16:26:22
two pointer got AC


auhan:
20190718 18:57:49
take care of the case with k=0 , and ans can be very large , nd there is a O(n) solution and i=j is a valid pair too


blagojce:
20180812 00:25:47
AC O(n) solution with 2 pointers 

hello_world123:
20180317 20:57:40
Using Dp but gettin WA in 7th test case ...


Hugo Godoy:
20171113 06:39:27
May I assume that the string has length N? 

pradeep_yadav:
20170902 09:47:16
did using binary search O(nlogn) solution.


hacker_sk:
20170627 08:55:00
3rd rank with O(n) soln. :) 

aman224:
20170317 08:41:59
O(N) solution without binary search is possible...


ricky99999:
20170201 12:36:29
O(n) Solution>Use same logic as in SUBSEQ & CRAN02. 

Chinmay Kousik:
20161126 14:17:09
Someone please tell me what's wrong with the source code. I keep getting WA. O(n) soln. submission id: 18262942 
Added by:  CSI 
Date:  20130216 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 