hdu 3902 Swordsman

最新推荐文章于 2013-11-04 09:10:43 发布

ddovetlose

最新推荐文章于 2013-11-04 09:10:43 发布

阅读量1k

点赞数

文章标签： input training integer each struct output

本文链接：https://blog.csdn.net/ddovetlose/article/details/6655190

版权

Swordsman

Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)
Total Submission(s): 150 Accepted Submission(s): 65

Problem Description

Mr. AC is a swordsman. His dream is to be the best swordsman in the world. To achieve his goal, he practices every day. There are many ways to practice, but Mr. AC likes “Perfect Cut” very much. The “Perfect Cut” can be described as the following two steps:
1. Put a piece of wood block on the desk, and then suddenly wave the sword, cutting the block into two pieces.
2. Without any motion, the two pieces must be absolutely axial symmetry.
According to the step two, when the board is an axial symmetry figure, Mr. AC has a chance to achieve the “Perfect Cut”. Now give you a board, and you should tell if Mr. AC has a chance to complete the “Perfect Cut”. The board is a simple polygon.

Input

The input contains several cases.
The first line of one case contains a single integer n (3 <= n <= 20000), the number of points. The next n lines indicate the points of the simple polygon, each line with two integers x, y (0 <= x, y <= 20000). The points would be given either clockwise or counterclockwise.

Output

For each case, output the answer in one line. If Mr. AC has the chance, print “YES”, otherwise "NO".

Sample Input

Sample Output

      
      
       
       NO
YES

       
       
        
        
         
         Hint
        
        Huge input, scanf is recommended.

Source

2011 Multi-University Training Contest 7 - Host by ECNU

题解：有点小暴力，但也很快A了。对于n个点的多边形，再找出每条边的中点，重新逆时针或顺时针排序，总数变为2*n个点，如果存在对称轴，则必在经过i和i+n（1<=i<=n)；再判断每一对点是否关于其对称（可以根据其到i点的距离是否相等&&到i+n点距离是否相等判断）；

#include <iostream>
#include <cmath>
using namespace std;
const double eps=1e-5;
struct rec
{
    double x,y;
}f[40005],a[20005];
int n,m;
bool flag;
inline double dis(int i,int j)
{
    double x=f[i].x-f[j].x;
    double y=f[i].y-f[j].y;
    return sqrt(x*x+y*y);
}
bool check(int i,int j,int x,int y)
{
    if(fabs(dis(i,x)-dis(j,x))>eps)
        return 0;
    if(fabs(dis(i,y)-dis(j,y))>eps)
        return 0;
    return 1;
}

void ff(int x,int y)
{
    int i,j;
    i=j=x;
    while(1)
    {
        i++;
        j--;
        if(!j)
            j=m;
        if(i==y)
        {
            flag=1;
            return ;
        }
        if(!check(i,j,x,y))
            return;
        
    }
}
int main()
{
    int i,j,k;
    while(~scanf("%d",&n))
    {
        for(i=1;i<=n;i++)
        {
            scanf("%lf%lf",&a[i].x,&a[i].y);
        }
        j=0;
        a[n+1]=a[1];
        for(i=1;i<=n;i++)
        {
            j++;
            f[j]=a[i];
            j++;
            f[j].x=(a[i].x+a[i+1].x)/2;
            f[j].y=(a[i].y+a[i+1].y)/2;
        }
        flag=0;
        m=2*n;
        f[m+1]=f[1];
    /*    for(i=1;i<=m;i++)
        {
            cout<<f[i].x<<' '<<f[i].y<<endl;
        }*/
        for(k=1;k<=n;k++)
        {
            ff(k,k+n);
            if(flag)
                break;
        }
        if(flag)
            puts("YES");
        else
            puts("NO");
    }
    return 0;
}