zoukankan      html  css  js  c++  java
  • codeforces 598E E. Chocolate Bar(区间dp)

    题目链接:

    E. Chocolate Bar

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You have a rectangular chocolate bar consisting of n × m single squares. You want to eat exactly k 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 ksquares.

    Examples
    input
    4
    2 2 1
    2 2 3
    2 2 2
    2 2 4
    output
    5
    5
    4
    0
    Note

    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.

    AC代码:

    #include <bits/stdc++.h>
    using namespace std;
    const int inf=0x7f7f7f7f;
    int dp[32][32][53];
    int n,m,k;
    int get_ans()
    {
        memset(dp,inf,sizeof(dp));
        for(int i=0;i<=30;i++)
        {
            for(int j=0;j<=30;j++)
            {
                dp[i][j][0]=0;
                dp[0][i][j]=0;
                dp[i][0][j]=0;
            }
        }
        for(int i=1;i<=30;i++)
        {
            for(int j=1;j<=30;j++)
            {
                int x=min(i*j,50);
                if(i*j<=50)dp[i][j][i*j]=0;
                for(int k=1;k<=x;k++)
                {
    
                    for(int v=1;v<=i/2;v++)
                    {
                        int num=min(k,v*j);
                        for(int u=0;u<=num;u++)
                        {
                            dp[i][j][k]=min(dp[i][j][k],dp[v][j][u]+dp[i-v][j][k-u]+j*j);
                        }
                    }
                    for(int v=1;v<=j/2;v++)
                    {
                        int num=min(k,v*i);
                        for(int u=0;u<=num;u++)
                        {
                            dp[i][j][k]=min(dp[i][j][k],dp[i][v][u]+dp[i][j-v][k-u]+i*i);
                        }
                    }
                }
            }
        }
    }
    int main()
    {
        int t;
        scanf("%d",&t);
        get_ans();
        while(t--)
        {
            scanf("%d%d%d",&n,&m,&k);
            printf("%d
    ",dp[n][m][k]);
        }
        return 0;
    }
  • 相关阅读:
    mysql日志查看
    mysql LAST_INSERT_ID详解
    LR监测windows资源一般监测哪几个项?
    如何在 Linux 服务器上部署多个 Tomcat
    微信支付的JAVA SDK存在漏洞,可导致商家服务器被入侵(绕过支付)XML外部实体注入防护
    Eclipse 处理 IOConsole Updater 报错
    Eclipse 处理 Console 打印信息自动删除
    Linux后台运行java的jar包
    MySQL重置主键ID
    Java转义emoji等特殊符号
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5304132.html
Copyright © 2011-2022 走看看