CHOCOLA - Chocolate
We are given a bar of chocolate composed of m*n square pieces. One should break the chocolate into single squares. Parts of the chocolate may be broken along the vertical and horizontal lines as indicated by the broken lines in the picture.
A single break of a part of the chocolate along a chosen vertical or horizontal line divides that part into two smaller ones. Each break of a part of the chocolate is charged a cost expressed by a positive integer. This cost does not depend on the size of the part that is being broken but only depends on the line the break goes along. Let us denote the costs of breaking along consecutive vertical lines with x1, x2, ..., xm-1 and along horizontal lines with y1, y2, ..., yn-1.
The cost of breaking the whole bar into single squares is the sum of the successive breaks. One should compute the minimal cost of breaking the whole chocolate into single squares.
For example, if we break the chocolate presented in the picture first along the horizontal lines, and next each obtained part along vertical lines then the cost of that breaking will be y1+y2+y3+4*(x1+x2+x3+x4+x5).
Write a program that for each test case:
- Reads the numbers x1, x2, ..., xm-1 and y1, y2, ..., yn-1
- Computes the minimal cost of breaking the whole chocolate into single squares, writes the result.
One integer in the first line, stating the number of test cases, followed by a blank line. There will be not more than 20 tests.
For each test case, at the first line there are two positive integers m and n separated by a single space, 2 <= m,n <= 1000. In the successive m-1 lines there are numbers x1, x2, ..., xm-1, one per line, 1 <= xi <= 1000. In the successive n-1 lines there are numbers y1, y2, ..., yn-1, one per line, 1 <= yi <= 1000.
The test cases will be separated by a single blank line.
For each test case : write one integer - the minimal cost of breaking the whole chocolate into single squares.
Input: 1 6 4 2 1 3 1 4 4 1 2 Output: 42
ST is sometimes good, but not this time
greed is sometimes good
simple logic... and you'll get there :)
My 100th....Be Greedy this time!!
O(n + m)log(n+m) just one sort.
be greedy ......
little logic +pair data structure+sort
Would like to see this with n, m <= 1000000(0?), as it can be solved in O(n + m).
solved with the help of ganda singh ganda !
greedy + divide and conquerLast edit: 2016-10-29 12:19:04