题目概述
给出
n
个整点
解题报告
疯狂水博客,哇,根本不会啊,来,让我们记录个
然后你就过了(雾),因为曼哈顿距离只有 2m 个,所以效率是 O(m) 的。
示例程序
#include<cstdio>
#include<algorithm>
#define fr first
#define sc second
using namespace std;
const int maxn=1e5,maxm=2*1e5;
int te,n,m;pair<int,int> p[maxn+5];
bool vis[maxm+5];
#define Eoln(x) ((x)==10||(x)==13||(x)==EOF)
inline char readc()
{
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
if (l==r) return EOF; else return *l++;
}
inline int readi(int &x)
{
int tot=0,f=1;char ch=readc(),lst='+';
while ('9'<ch||ch<'0') {if (ch==EOF) return EOF;lst=ch;ch=readc();}
if (lst=='-') f=-f;
while ('0'<=ch&&ch<='9') tot=(tot<<3)+(tot<<1)+ch-48,ch=readc();
return x=tot*f,Eoln(ch);
}
inline int abs(int x) {if (x<0) return -x;return x;}
inline int getdis(int i,int j) {return abs(p[i].fr-p[j].fr)+abs(p[i].sc-p[j].sc);}
int main()
{
freopen("program.in","r",stdin);
freopen("program.out","w",stdout);
for (readi(te);te;te--)
{
readi(n);readi(m);m<<=1;
for (int i=0;i<=m;i++) vis[i]=false;
for (int i=1;i<=n;i++) readi(p[i].fr),readi(p[i].sc);
for (int i=1;i<=n-1;i++)
for (int j=i+1;j<=n;j++)
if (vis[getdis(i,j)]) {printf("YES\n");goto ok;} else vis[getdis(i,j)]=true;
printf("NO\n");ok:;
}
return 0;
}