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.
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 non-empty string consisting of '1' and '0'.
1 represents Boy.
0 represents Girl.
The number of (i, j) pairs such that the number of boys between index i and j, both inclusive is equal to K.
O(N) solution without binary search is possible...
O(n) Solution->Use same logic as in SUBSEQ & CRAN02.
Someone please tell me what's wrong with the source code. I keep getting WA. O(n) soln. submission id: 18262942
Last edit: 2016-10-15 12:23:26
Number of pairs can exceed 10^9, lead me to several WAs.Last edit: 2016-07-18 18:27:54
input the string carefully...got TLE bcuz of that
nice Binary Search questn . Beware of the case when k=0Last edit: 2016-05-16 17:27:34
@BITMEN, It is tagged by someone who solved it with Binary Search.
[BITMEN] DARK LORD:
The aim of the problem is to find the O(n) solution i.e DP solution.Don't know why it is tagged as binary search problem. Otherwise good problem with strong test cases.
nice one.easy problem.look out for corner cases .good test cases.read constraints carefully!!