HDOJ 5563 Clarke and five-pointed star(枚举)



Clarke and five-pointed star

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 154    Accepted Submission(s): 87

Problem Description

Clarke is a patient with multiple personality disorder. One day, Clarke turned into a learner of geometric.
When he did a research with polygons, he found he has to judge if the polygon is a five-pointed star at many times. There are 5 points on a plane, he wants to know if a five-pointed star existed with 5 points given.

 

Input

The first line contains an integer T(1≤T≤10) , the number of the test cases.
For each test case, 5 lines follow. Each line contains 2 real numbers xi,yi(−109≤xi,yi≤109) , denoting the coordinate of this point.

 

Output

Two numbers are equal if and only if the difference between them is less than 10−4 .
For each test case, print Yes if they can compose a five-pointed star. Otherwise, print No . (If 5 points are the same, print Yes . )

 

Sample Input

  
  

   
   2
3.0000000 0.0000000
0.9270509 2.8531695
0.9270509 -2.8531695
-2.4270509 1.7633557
-2.4270509 -1.7633557
3.0000000 1.0000000
0.9270509 2.8531695
0.9270509 -2.8531695
-2.4270509 1.7633557
-2.4270509 -1.7633557
  
  

 

Sample Output

  
  

   
   Yes
No


   
   

    
    

     
     Hint
    
    

    
    

    
    

   
   
   
    
  
  

 

题意：给出5个点，判断能不能组成正5角星。

这题还是贴官方给的题解吧：

容易看出只需要判断这5个点是否在一个正五边形上。

因此我们枚举排列，然后依次判断即可。

判定方法是，五条相邻边相等，五条对角线相等。

当然题目给的精度问题，窝只能说，如果泥做法不复杂，精度足够好的话，是可以过的。毕竟题目说的小于10−410^{-4}10​−4​​是指理论上的，所以理论上适用所有的数之间的比较。所以有人问我开方前和开方后，我只能说，哪个精度高用哪个....

当然你也可以先求出凸包然后再判相邻距离......

数据比较弱，我枚举每个点的最长边，再判断每个最长边是否相等，居然过了，代码如下：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
double x[6],y[6],len[6];
double max[6]; 
int main()
{
    int i,t,j,k;
    scanf("%d",&t);
    while(t--)
    {
        for(i=0;i<5;++i)
        {
            scanf("%lf%lf",&x[i],&y[i]);
            max[i]=0;
        }
        for(i=0;i<5;++i)
        {
            for(j=0;j<5;++j)
            {
                if(i!=j)
                {
                    len[i]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
                    if(max[i]<len[i])
                        max[i]=len[i]; 
                }
            }
        }
        int sign=0;
        for(i=0;i<5;++i)
        {
            for(j=0;j<5;++j)
            {
                if(i!=j&&fabs(max[i]-max[j])>1e-4)
                {
                    sign=1;
                    break;
                }
                if(max[i]==0||max[j]==0)
                {
                    sign=1;
                    break;
                }
            }
            if(sign)
                break;
        }
        if(sign)
            printf("No\n");
        else
            printf("Yes\n"); 
    }
    return 0;
}