hdu 1518 Square

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

旋影

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

阅读量439

点赞数

分类专栏：深搜

本文链接：https://blog.csdn.net/u010101875/article/details/9972641

版权

深搜专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Square

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

Total Submission(s) : 34 Accepted Submission(s) : 15

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<stdio.h>
#include<string.h>
#include<stdlib.h>


int *array,*vis;
int edge;


int cmp(const void *a,const void *b)
{

   
   	return *(int *)b-*(int *)a;
}


int dfs(int curlen,int num,int cur,int len)
{

   
   	int i;

   
   	if(num==3)

   
   		return 1;

   
   	if(curlen==edge)

   
   	{

   
   		if(dfs(0,num+1,num+1,len))

   
   			return 1;

   
   		else

   
   			return 0;

   
   	}

   
   	else

   
   	{

   
   		for(i=cur;i<len;i++)

   
   		{

   
   			if(!vis[i])

   
   			{

   
   				if(curlen + array[i] <= edge)

   
   				{

   
   					vis[i]=1;

   
   					if(dfs(curlen+array[i],num,i+1,len))

   
   					{

   
   						return 1;

   
   					}

   
   					vis[i] = 0;

   
   				}

   
   			}

   
   		}

   
   	}

   
   	return 0;
}


int main()
{

   
   	int n,m,i,sum;

   
   	scanf("%d",&n);

   
   	while(n--)

   
   	{

   
   		scanf("%d",&m);

   
   		array=(int *)malloc(sizeof(int)*m);

   
   		for(i=0;i<m;i++)

   
   			array[i]=0;

   
   		vis=(int *)malloc(sizeof(int)*m);

   
   		for(i=0;i<m;i++)

   
   			vis[i]=0;

   
   		for(i=0,sum=0;i<m;i++)

   
   		{

   
   			scanf("%d",&array[i]);

   
   			sum+=array[i];

   
   		}

   
   		edge=sum>>2;

   
   		if(sum%4==0 && edge>=array[0])

   
   		{

   
   			qsort(array,m,sizeof(array[0]),cmp);

   
   			if(dfs(0,0,0,m))

   
   				printf("yes\n");

   
   			else

   
   				printf("no\n");

   
   		}

   
   		else

   
   		{

   
   			printf("no\n");

   
   		}

   
   		free(vis);

   
   		free(array);

   
   	}

   
   	return 0;
}