HDU 1518 Square(DFS)

Square

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13644    Accepted Submission(s): 4323

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
yesd
  
  

题意：给一组数，判断是否能够组成正方形，要求所有的数都要选择。。

简单DFS,但剪枝要注意。。首先判断所有数的和是否是4的倍数，然后以是否找到几个数满足一条边，和是否找全4个边，这就是DFS中的剪枝条件，

        还有一个重要的剪枝，当每找到一个边满足条件后寻找下一条边时，需要从头开始找，，，但是在找其中一条边时，如果之前的数不满足，当递归返回时不需要从头找，而是从当前位置往后找，因为之前的数不满足就不需要看了。

以下AC代码：

#include<stdio.h>
#include<string.h>
int avg;
int flag;
int vis[25];
int n;
int a[25];
void dfs(int sum,int temp,int index)
{
    int i;
    if(temp==4)
    {
        flag=1;
        return;
    }
    if(sum==avg)
    {
        dfs(0,temp+1,0);
        if(flag)
            return;
    }
     for(i=index;i<n;i++)
     {
         if(!vis[i] && sum+a[i]<=avg)
         {
             vis[i]=1;
             dfs(sum+a[i],temp,i+1);
             if(flag)
                return;
             vis[i]=0;
         }
     }
}
int main()
{
    int i;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int sum=0;
        flag=0;
        scanf("%d",&n);
        memset(vis,0,sizeof(vis));
        for(i=0;i<n;i++)
        {
           scanf("%d",&a[i]);
           sum+=a[i];
        }
        if(sum%4)
            printf("no\n");
        else
        {
           avg=sum/4;
           dfs(0,0,0);
           if(flag)
            printf("yes\n");
           else
            printf("no\n");
        }
    }
    return 0;
}