2016 Multi-University Training Contest 3 1011 Teacher Bo

最新推荐文章于 2017-08-24 21:01:11 发布

弱菜zc

最新推荐文章于 2017-08-24 21:01:11 发布

阅读量456

点赞数

本文链接：https://blog.csdn.net/zchahaha/article/details/52042292

版权

多校联合训练专栏收录该内容

42 篇文章 0 订阅

订阅专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5762

题目：

Problem Description

Teacher BoBo is a geography teacher in the school.One day in his class,he marked

N points in the map,the

i -th point is at

(Xi,Yi) .He wonders,whether there is a tetrad

(A,B,C,D)(A<B,C<D,A≠CorB≠D) such that the manhattan distance between A and B is equal to the manhattan distance between C and D.

If there exists such tetrad,print "YES",else print "NO".

Input

First line, an integer

T . There are

T test cases.

(T≤50)

In each test case,the first line contains two intergers, N, M, means the number of points and the range of the coordinates.

(N,M≤105) .

Next N lines, the

i -th line shows the coordinate of the

i -th point.

(Xi,Yi)(0≤Xi,Yi≤M) .

Output

T lines, each line is "YES" or "NO".

Sample Input

Sample Output

  
  
   
   YES
NO

考虑一种暴力,每次枚举两两点对之间的曼哈顿距离,并开一个桶记录每种距离是否出现过,如果某次枚举出现了以前出现的距离就输 $Y E S$ ,否则就输 $N O$ .

注意到曼哈顿距离只有 $O (M)$ 种,根据鸽笼原理,上面的算法在 $O (M)$ 步之内一定会停止.所以是可以过得.

一组数据的时间复杂度 $O(\min{N^2,M})$ .

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define N 210000
using namespace std;

int x[N],y[N],mp[N],n,m;

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
            scanf("%d%d",&x[i],&y[i]);
        int cnt=0,flag=1;
        memset(mp,0,sizeof(mp));
        for(int i=0;i<n&&flag;i++)
            for(int j=0;j<i&&flag;j++)
            {
                int t=abs(x[i]-x[j])+abs(y[i]-y[j]);
                if(mp[t])
                {
                    flag=0;
                    break;
                }
                else    mp[t]=1;
            }
        if(flag)    cout<<"NO"<<endl;
        else    cout<<"YES"<<endl;
    }
}