[杂题 简单复杂度分析]HDU5762. Teacher Bo

m很小啊……暴力就好了

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>

using namespace std;

const int N=200010;

int t,n,m,x[N],y[N],vis[N];

int main(){
  scanf("%d",&t);
  while(t--){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
    for(int i=0;i<=m*2;i++) vis[i]=0;
    int ANSED=0;
    for(int i=1;i<=n && !ANSED;i++)
      for(int j=i+1;j<=n;j++){
    if(vis[abs(x[i]-x[j])+abs(y[i]-y[j])]){
      ANSED=1; break;
    }
    vis[abs(x[i]-x[j])+abs(y[i]-y[j])]=1;
      }
    if(ANSED) puts("YES");
    else puts("NO");
  }
  return 0;
}