You are given ‘N’ words of various lengths, now you have to arrange these words in such a way that each line contains at most ‘M’ characters and each word is separated by a space character. The cost of each line is equal to the cube of extra space characters required to complete ‘M’ characters in that particular line. Total cost is equal to the sum of costs of each line.
Your task is to form this arrangement with the minimum cost possible and return the minimum total cost.
1. Length of each word should be less than or equal to ‘M’.
2. You can’t break a word, i.e. the entire word should come in the same line and it must not be the case that a part of it comes in the first line and another part on the next line.
The first line of the input contains an integer ‘T’ denoting the number of test cases.
The first line of each Test case should contain two positive integers, ‘N’ and ‘M’, where ‘N’ is the number of words and ‘M’ is the number of characters we require in each line.
Following ‘N’ lines, contains one word each.
The only line of output of each test case should contain an integer denoting the minimum cost required to form the arrangement.
Print the output of each test case in a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 100
1 <= N <= 300
1 <= |words[i]| <= 100
1 <= M <= 100
Time Limit: 1sec
Sample Input 1:
Sample Output 1:
Explanation for sample input 1:
All the 3 words can be inserted in a single line.
ab a b Total Characters = 6
Hence extra spaces used are (6-6)^3=0
Sample Input 2:
Sample Output 2:
Explanation for sample input 2:
The optimal output will be:
Hence extra spaces will be -> (1)^3 + (2)^3 + (1)^3 = 10