UVa 1595 Symmetry

/*
找出一组对称的点（记为0，n）的对称轴，然后以这个对称轴为标准判断其他点是否以这个对称轴对称，判断的
方法是：记录每个点到对称轴的距离，判断距离相等的两个点的纵坐标是否相等
*/
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long llu;

const double eps = 1e-10;
const double PI = acos(-1.0);
const int INF = 0x7fffffff;

const int maxn = 1000 + 10;
struct Point
{
    int x,y;
} p[maxn];
int dis[maxn];//点到对称轴的距离
int vis[maxn];
int n;

bool sym(int axis, int flag)
{
    //先找出每个点到对称轴的距离
    memset(vis,0,sizeof(vis));
    if(!flag) for(int i = 0; i < n; ++i) dis[i] = abs(axis - p[i].x);
    else
    {
        if(n % 2 != 0) return false;
        for (int i = 0; i < n; i++)
        {
            if (p[i].x > axis) dis[i] = p[i].x - axis - 1;
            else dis[i] = axis - p[i].x;
        }
    }
    for(int i = 0; i < n; ++i) if(!flag && axis == p[i].x) vis[i] = 1;//该点在对称轴上
    for(int i = 0; i < n; ++i)
    {
        for(int j = i+1; j < n; ++j)
        {
            if(p[i].y == p[j].y && dis[i] == dis[j]) {vis[i] = vis[j] = 1; break;}
        }
    }
    for(int i = 0; i < n; ++i)
        if(!vis[i]) return false;
    return true;
}
bool solve()
{
    for(int i = 0; i < n; ++i)
    for(int i = 0; i < n; ++i)
    {
        if(p[0].y == p[i].y)
        {
            int flag = 0;
            int axis = p[0].x + p[i].x;
            if(axis % 2 == 0)
                axis /= 2;
            else
            {
                flag = 1;
                axis /= 2;
            }
            if(sym(axis,flag)) return true;
        }
    }
    return false;
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
#endif // ONLINE_JUDGE
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(dis,0,sizeof(dis));
        for(int i = 0; i < n; ++i)
            scanf("%d%d",&p[i].x,&p[i].y);
        if( solve() ) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}

细节处理方面参考了：http://blog.csdn.net/sinat_17231979/article/details/38867111