WA了好多次,终于AC了,纪念一下(泪奔)。。。。
Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?
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.
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
Output for Sample Input
yes no yes首先,题目的意思是先输入一个N,然后依次输入N个case,每行的第一个数为M,代表M根棍子,要求判断这M根棍子是否可以拼成一个正方形。
用到了深度优先搜索以及剪枝,里面的数组按照由大到小的顺序排序,以减少算法的遍历次数。具体的请参照注释。
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<cstring>
using namespace std;
int a[220],b[220];
int M,ave,sum;
int cmp(const void *a,const void *b){
return *(int*)b-*(int*)a;
}
int dfs(int x,int y,int z){//x为当前已经找好的边数,y为剩余木棍数
if(x==3)
return 1;
for(int i=y;i>=0;i--){
if(!b[i]){
b[i]=1;
if(z+a[i]<ave){
if(dfs(x,i-1,z+a[i]))
return 1;
}
else if(z+a[i]==ave){
if(dfs(x+1,M-1,0))
return 1;
}
b[i]=0;
}
}
return 0;
}
int main(){
int N,i,j;
cin>>N;
while(N--){
cin>>M;
sum=0;
for(i=0;i<M;i++){
cin>>a[i];
sum=sum+a[i];
}
ave=sum/4;
memset(b,0,sizeof(b));
qsort(a,M,sizeof(int),cmp);
if(ave*4!=sum||M<4||a[0]>ave){
cout<<"no"<<endl;
continue;
}
if(dfs(0,M-1,0))
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
return 0;
}