HDU - 1518 Square （能否组成正方形）

最新推荐文章于 2021-03-09 13:00:27 发布

什么样的小孩

最新推荐文章于 2021-03-09 13:00:27 发布

阅读量217

点赞数 1

分类专栏： DFS 文章标签： ACM 深搜

本文链接：https://blog.csdn.net/weixin_37282581/article/details/77150968

版权

DFS 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Square （能否组成正方形）

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<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,s[25],vis[25];
int len,f;

void dfs(int sum,int k,int cnt){
	if(f)return ;
	if(cnt==3){//求出第三边则不需要求第四边了 
		f=1;
		return ;
	}
	
	for(int i=k-1;i>=0;i--){
		if(vis[i])continue;
		
		if(sum+s[i]<len){
			vis[i]=1;
			dfs(sum+s[i],i,cnt);
			vis[i]=0;
		}else if(sum+s[i]==len){
			vis[i]=1;
			dfs(0,n,cnt+1);
			vis[i]=0;
		}
	}
}

int main(){
	int tt;
	scanf("%d",&tt);
	while(tt--){
		memset(vis,0,sizeof(vis));
		scanf("%d",&n);
		len=0;
		for(int i=0;i<n;i++){
			scanf("%d",&s[i]);
			len+=s[i];
		}
		sort(s,s+n);
		
		//进行优化剪枝，排除一些不可能的情况 
		if(len!=len/4*4 || s[n-1]>len/4 || len%2){
			printf("no\n");
			continue;
		}
		f=0;
		len/=4;//求出边长 

		dfs(0,n,0);
		if(f)printf("yes\n");
		else printf("no\n");
	}
	return 0;
}