Codeforces 598E:Chocolate Bar(DP)

题意:一个n*m的巧克力,你想吃k个单元格的巧克力,每一次切都有切的那条边的长度平方的代价,问最小代价

思路:明显的DP,设dp[i][j][k]为在i*j大的巧克力中吃k的最小代价,那么直接预处理枚举巧克力的长,宽,k,切的方式,切的位置..见代码....


#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#pragma warning(disable:4996)
using namespace std;

#define INF 1e9+7

int dp[32][32][52];

int main()
{
    //freopen("i.txt","r",stdin);
    //freopen("o.txt","w",stdout);
    int i, j, k, h, m;
    for (i = 0; i <= 30; i++)
    {
        for (j = 0; j <= 30; j++)
        {
            for (k = 0; k <= 50; k++)
            {
                if (k == i*j || k == 0)
                {
                    dp[i][j][k] = 0;
                }
                else
                {
                    dp[i][j][k] = INF;
                }
                for (h = 0; h <= k; h++)
                {
                    for (m = 1; m < j; m++)
                        dp[i][j][k] = min(dp[i][j][k], dp[i][m][h] + dp[i][j - m][k - h] + i*i);
                    for (m = 1; m < i; m++)
                        dp[i][j][k] = min(dp[i][j][k], dp[m][j][h] + dp[i - m][j][k - h] + j*j);
                }
            }
        }
    }

    scanf("%d", &k);
    while (k--)
    {
        scanf("%d%d%d", &i, &j, &h);
        printf("%d\n", dp[i][j][h]);
    }
    //system("pause");
    return 0;
}


Description

You have a rectangular chocolate bar consisting of n × m single squares. You want to eat exactlyk squares, so you may need to break the chocolate bar.

In one move you can break any single rectangular piece of chocolate in two rectangular pieces. You can break only by lines between squares: horizontally or vertically. The cost of breaking is equal to square of the break length.

For example, if you have a chocolate bar consisting of 2 × 3 unit squares then you can break it horizontally and get two 1 × 3 pieces (the cost of such breaking is 32 = 9), or you can break it vertically in two ways and get two pieces: 2 × 1 and 2 × 2 (the cost of such breaking is 22 = 4).

For several given values nm and k find the minimum total cost of breaking. You can eat exactly k squares of chocolate if after all operations of breaking there is a set of rectangular pieces of chocolate with the total size equal to k squares. The remaining n·m - ksquares are not necessarily form a single rectangular piece.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 40910) — the number of values nm and k to process.

Each of the next t lines contains three integers nm and k (1 ≤ n, m ≤ 30, 1 ≤ k ≤ min(n·m, 50)) — the dimensions of the chocolate bar and the number of squares you want to eat respectively.

Output

For each nm and k print the minimum total cost needed to break the chocolate bar, in order to make it possible to eat exactly k squares.

Sample Input

Input
4
2 2 1
2 2 3
2 2 2
2 2 4
Output
5
5
4
0

Hint

In the first query of the sample one needs to perform two breaks:

  • to split 2 × 2 bar into two pieces of 2 × 1 (cost is 22 = 4),
  • to split the resulting 2 × 1 into two 1 × 1 pieces (cost is 12 = 1).

In the second query of the sample one wants to eat 3 unit squares. One can use exactly the same strategy as in the first query of the sample.




  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值