POJ 1020 Anniversary Cake（DFS）

Anniversary Cake

Time Limit: 1000MS
Memory Limit: 10000KB
64bit IO Format: %I64d & %I64u

Submit Status

Description

Nahid Khaleh decides to invite the kids of the "Shahr-e Ghashang" to her wedding anniversary. She wants to prepare a square-shaped chocolate cake with known size. She asks each invited person to determine the size of the piece of cake that he/she wants (which should also be square-shaped). She knows that Mr. Kavoosi would not bear any wasting of the cake. She wants to know whether she can make a square cake with that size that serves everybody exactly with the requested size, and without any waste.

Input

The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by input data for each test case. Each test case consist of a single line containing an integer s, the side of the cake, followed by an integer n (1 ≤ n ≤ 16), the number of cake pieces, followed by n integers (in the range 1..10) specifying the side of each piece.

Output

There should be one output line per test case containing one of the words KHOOOOB! or HUTUTU! depending on whether the cake can be cut into pieces of specified size without any waste or not.

Sample Input

2
4 8 1 1 1 1 1 3 1 1
5 6 3 3 2 1 1 1

Sample Output

KHOOOOB!
HUTUTU!

题目简单翻译：

给你一个方形蛋糕，问能不能把它切成m个小蛋糕，而不浪费。

解题思路：

主要思路来源于優YoU，大致是从下往上填格子。

代码：

#include<iostream>
#include<cstring>
using namespace std;

int BoxSize;
int n;
int SizeNum[];
int col[];

bool DFS(int FillNum)
{
    if(FillNum==n) return true;
    int min=;
    int prow;
    for(int i=;i<=BoxSize;i++)
        if(min>col[i])
        {
            min=col[i];
            prow=i;
        }
    for(int size=;size>=;size--)
    {
        if(!SizeNum[size]) continue;
        if(BoxSize-col[prow]>=size&&BoxSize-prow+>=size)
        {
            int wide=;
            for(int r=prow;r<=prow+size-;r++)
            {
                if(col[r]<=col[prow])
                {
                    wide++;
                    continue;
                }
                break;
            }

            if(wide>=size)
            {
                int r;
                SizeNum[size]--;
                for(r=prow;r<=prow+size-;r++)
                    col[r]+=size;
                if(DFS(FillNum+)) return true;
                SizeNum[size]++;
                for(r=prow;r<=prow+size-;r++)
                    col[r]-=size;
            }
        }

    }
    return false;
}

int main(void)
{
    int test;
    cin >> test;
    for(int t=;t<=test;t++)
    {
        memset(SizeNum,,sizeof SizeNum);
        memset(col,,sizeof col);
        cin >> BoxSize >> n;
        int cnt=,area=;
        for(int i=;i<=n;i++)
        {
            int size;
            cin >> size;
            area+=size*size;
            SizeNum[size]++;
            if(size>BoxSize/) cnt++;
        }
        if(cnt>||area!=BoxSize*BoxSize)
        {
            cout << "HUTUTU!" << endl;
            continue;
        }
        if(DFS()) cout << "KHOOOOB!" << endl;
        else cout << "HUTUTU!" << endl;
    }
}