HDU1518：Square(DFS)

Square

Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 80   Accepted Submission(s) : 33

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?

Input

The first line of input contains N, the number of test cases. Each test case begins with an integer 4 <= M <= 20, the number of sticks. M integers follow; each gives the length of a stick - an integer between 1 and 10,000.

Output

For each case, output a line containing "yes" if is is possible to form a square; otherwise output "no".

Sample Input

3
4 1 1 1 1
5 10 20 30 40 50
8 1 7 2 6 4 4 3 5

Sample Output

yes
no
yes

Source

University of Waterloo Local Contest 2002.09.21

原题： http://acm.hdu.edu.cn/showproblem.php?pid=1518

代码：

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


int length[25],vis[25];//length记录木棍长，vis记录是否被访问过
double avg;
bool flag;
int n;


void dfs(int curlen,int len,int k)
{
    if(len==3)
        flag=true;
    if(flag)
        return ;
    for(int i=k;i<=n;i++)
    {
        if(vis[i]==0&&(curlen+length[i])<=avg)//如果加上第i根木棍长度后小于边长，就继续
        {
            vis[i]=1;
            if(curlen+length[i]==avg)
            {
                dfs(0,len+1,0);
            }
            else
            {
                dfs(curlen+length[i],len,i+1);//接着上次的i搜索否则会超时
            }
            vis[i]=0;//回溯
        }
    }
}


int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        avg=0;
        for(int i=1;i<=n;i++)
        {
            cin>>length[i];
            avg+=length[i];
        }
        if(avg/4!=int(avg/4))//如果平均值不为整则直接输出no
        {
            cout<<"no\n";
            continue;
        }
        sort(length+1,length+n+1);
        avg/=4;
        memset(vis,0,sizeof(vis)); 
        flag=false;
        dfs(0,0,1);
        if(flag)
            cout<<"yes\n";
        else cout<<"no\n";
    }
    return 0;
}

---