23263번 - Banana Bunches 서브태스크다국어

Barbara goes to Alan's banana farm, where the $N$ banana trees are organized in one long line represented by an array $B$. The tree at position $i$ has $B_i$ banana bunches. Each tree has the same cost. Once Barbara buys a tree, she gets all the banana bunches on that tree. Alan has a special rule: because he does not want too many gaps in his line, he allows Barbara to buy at most $2$ contiguous sections of his banana tree line.

Barbara wants to buy some number of trees such that the total number of banana bunches on these purchased trees equals the capacity $K$ of her basket. She wants to do this while spending as little money as possible. How many trees should she buy?

The first line of the input gives the number of test cases, $T$. $T$ test cases follow.

Each test case begins with a line containing two integers integer $N$, the number of trees on Alan's farm, and $K$, the capacity of Barbara's basket.

The next line contains $N$ non-negative integers $B_1,B_2,\cdots,B_N$ representing array $B$, where the $i$-th integer represents the number of banana bunches on the $i$-th tree on Alan's farm.

For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from $1$) and $y$ is the minimum number of trees Barbara must purchase to obtain $K$ banana bunches using at most $2$ contiguous sections of the farm, or -1 if it is impossible to do so.

• $1 \le T \le 100$.
• $0 \le B_i \le K$, for each $i$ from $1$ to $N$.

• $1 \le K\le 10^4$.
• $1 \le N \le 50$.

• $1 \le K\le 10^4$.
• $1 \le N \le 500$.

• $1 \le K\le 10^6$.

For at most 25 cases:

• $1 \le N \le 5000$.

For the remaining cases:

• $1 \le N \le 500$.