hdu1518 Square

最新推荐文章于 2019-07-20 18:06:16 发布

Little_boy_z

最新推荐文章于 2019-07-20 18:06:16 发布

阅读量250

点赞数

分类专栏：大三ACM - 搜索

本文链接：https://blog.csdn.net/Little_boy_z/article/details/78405493

版权

大三ACM - 搜索专栏收录该内容

34 篇文章 1 订阅

订阅专栏

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
  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  
   
   问给出的这些木棍是否可以正好构成一个正方形。
  
  
  
  
   
   主要还是考剪枝问题
  
  
  
  
   
   剪枝一：只要找到了，以后所有的dfs全部return
  
  
  
  
   
   剪枝二：dfs设计一个变量代表当前已经走到哪里了，深层遍历时直接从那之后开始遍历。这样节省时间！！主要是这个
  
  
  
  
   
   

   
   

   
   

   
   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
     
     
   
   
   
   

   
   

   
   
#include<cstdio>
   
   
#include<cstring>
   
   
#include<iostream>
   
   
#include<algorithm>
   
   
using namespace std;
   
   
const int maxn=20+10;
   
   
int a[maxn],vis[maxn];
   
   
int edge,average;
   
   
int t,sum,flag;
   
   
int m;
   
   
void dfs(int pos,int w,int count)
   
   
{
   
   
    if(pos==average)
   
   
    {
   
   
        count++;
   
   
        pos=0;
   
   
        w=1;
   
   
        if(count==4)
   
   
        {
   
   
            flag=1;
   
   
            return;
   
   
        }
   
   
    }
   
   
    if(flag)
   
   
        return;
   
   
    for(int i=w;i<=m;i++)
   
   
    {
   
   
       if(vis[i])
   
   
         continue;
   
   
       else
   
   
       {
   
   
           if(pos+a[i]<=average)
   
   
           {
   
   
               vis[i]=1;
   
   
               dfs(pos+a[i],i+1,count);
   
   
               vis[i]=0;
   
   
           }
   
   
       }
   
   
    }
   
   

   
   

   
   
}
   
   

   
   

   
   
int main()
   
   
{
   
   
    scanf("%d",&t);
   
   
    while(t--)
   
   
    {
   
   
        memset(vis,0,sizeof(vis));
   
   
        flag=0;
   
   
        sum=0;
   
   
        scanf("%d",&m);
   
   
        for(int j=1;j<=m;j++)
   
   
        {
   
   
            scanf("%d",&a[j]);
   
   
            sum=sum+a[j];
   
   
        }
   
   
        average=sum/4;
   
   
        flag=0;
   
   
        if(sum%4!=0||m<4||a[m]>sum/4)
   
   
            printf("no\n");
   
   
        else
   
   
        {
   
   
            dfs(0,1,0);
   
   
            if(flag)
   
   
                printf("yes\n");
   
   
            else
   
   
                printf("no\n");
   
   
        }
   
   
    }
   
   
    return 0;
   
   
}