[Solution] Binary Deque Codeforces Solution | Codeforces Problem Solution 2022

[Solution] Binary Deque Codeforces Solution | Codeforces Problem Solution 2022

E. Binary Deque

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Slavic has an array of length n$n$ consisting only of zeroes and ones. In one operation, he removes either the first or the last element of the array.

What is the minimum number of operations Slavic has to perform such that the total sum of the array is equal to s$s$ after performing all the operations? In case the sum s$s$ can't be obtained after any amount of

Solution Click Below:-  CLICK HERE

 operations, you should output -1.

Input

The first line contains a single integer t$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of test cases.

The first line of each test case contains two integers n$n$ and s$s$ (1≤n,s≤2⋅105$1\le n,s\le 2\cdot {10}^5$) — the length of the array and the needed sum of elements.

The second line of each test case contains n$n$ integers ai$a_i$ (0≤ai≤1$0\le a_i\le 1$) — the elements of the array.

Marathon Codeforces Solution

Binary Deque Codeforces Solution

All Distinct Codeforces Solution

Where's the Bishop? Codeforces Solution

The Clock Codeforces Solution

3SUM Codeforces Solution

2^Sort Codeforces Solution

Gambling Codeforces Solution

It is guaranteed that the sum of n$n$ over all test cases doesn't exceed 2⋅105$2\cdot {10}^5$.

Output

For each test case, output a single integer — the minimum amount of operations required to have the total sum of the array equal to s$s$, or -1 if obtaining an array with sum s$s$ isn't possible.