hdu1518 Square

 

Square

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

Total Submission(s) : 154   Accepted Submission(s) : 57

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

给出一些长度的边。全部要用到，去组成一个正方形。 因为都是整数所以若总和不是4的倍数不行，边数小于三也不行。 然后就是dfs过程，共3个参数，一个是目前所搜索到所求正方形的边数num，一个是当前的长度len，一个是所搜索到的边数的数组的位置，一旦len达到了所要求的正方形边长，就让num+1，若num达到了5，则表示可以组成一个正方形。

#include<iostream>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
int n,m;
int flag=0;
int a[111];       double sum=0;
int vis[111];
void dfs(int num,int len,int wz)
{
    if(num==5)
    {
        flag=1;
        return;
    }
    if(len==sum/4)
    {
        dfs(num+1,0,1);
    }
    for(int i=wz;i<=m;i++)
    {
        if(a[i]+len<=sum/4&&vis[i]==0)
        {
            vis[i]=1;
            dfs(num,len+a[i],i+1);
            if(flag) return ;
            vis[i]=0;
        }
    }
}
int main()
{      
   cin>>n;
   while(n--)
   {
       cin>>m;
       int i,j,k;
       memset(vis,0,sizeof(vis));
    sum=0;
       int max1=0;
       for(i=1;i<=m;i++)
       {
           cin>>a[i];
           sum+=a[i];
           if(a[i]>max1)
           max1=a[i];
    }
    if(m<4||sum/4<max1)
    {
        cout<<"no"<<endl;
        continue;
    }
    flag=0;
    dfs(1,0,1);
    if(flag)cout<<"yes"<<endl;
    else cout<<"no"<<endl;
   }
    return 0;
}