Security Guards（bfs+预处理）Gym - 101954B

In the course of the last few weeks, Binary Casino has been afflicted by a local crime wave which is primarily focused on casinos in the neighborhood. Although there are surveillance cameras installed in Binary Casino, thieves usually manage to sneak out with relative ease as there is almost nobody patrolling in the casino.

After the theft of all Friday's earnings, the manager of Binary Casino has lost his patience and decided to reinforce security of the casino by hiring a vast number of security guards. However, nobody in the casino was capable of coming up with a plan on how to distribute guards across the whole casino to maximize security. Security guards are thus scattered across the casino in no systematic way. Fortunately, their locations can be described by integer coordinates in a 2D plane.

Because of the uneven distribution of security guards, in case of a reported robbery it is very hard for security supervisors to determine which guard is closest to the location of the incident. The task is even harder due to the constrained space in the casino which consists of endless aisles of slot machines. This limitation forces each guard to travel from one location to another in a sequence of steps. In each step, he/she can change each of his/her coordinates by 11, 00 or −1−1. The distance between two locations is equal to the minimum number of steps the guard has to do to get from one location to the other one.

The task is, for a given locations of guards and a set of locations of security incidents, to compute for each incident its smallest distance to any of the guards. This will allow security supervisors to alert appropriate guards and will greatly increase the casino security.

Input

The first line of input contains two integers NN and QQ (1≤N,Q≤3⋅1051≤N,Q≤3⋅105), the number of guards and the number of security incidents, respectively. After that, NN lines follow. Each of these lines contains two integers XX and YY (0≤X,Y≤50000≤X,Y≤5000) which describe coordinates of a guard in a 2D plane. Next, QQ lines follow. Each of these lines contains two integers AA and BB (0≤A,B≤50000≤A,B≤5000) which describe coordinates of a security incident.

Output

For each of QQ security incidents output a line containing shortest distance to any of the security guards, measured in steps.

Examples

Input

2 3
0 1
4 0
5 0
4 3
1 2

Output

1
3
1

Input

2 4
0 0
3 3
1 1
0 3
1 2
3 3

Output

1
3
2
0

题意：N个消防队，位于二维平面坐标上，Q个地方发生了火灾，求离此火灾位置最近的消防队的距离

最近距离的定义建立在8个方向上。

分析：需要预处理一下，不然会超时，接下来就是普通的bfs.

AC代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 5010;
#define LL long long
#define INF 0x3f3f3f3f
int N,Q;
int dis[maxn][maxn];
typedef struct node{
    int x,y,w;
}node;
queue<node> que;
int dx[]={0,1,1,1,0,-1,-1,-1};
int dy[]={1,1,0,-1,-1,-1,0,1};
void bfs(){
    while(!que.empty()){
        node p=que.front();
        que.pop();
        for(int i=0;i<8;i++){
            int xx=p.x+dx[i];
            int yy=p.y+dy[i];
            if(xx<0||xx>5000||yy<0||yy>5000) continue;
            if(dis[xx][yy]==-1){
                dis[xx][yy]=p.w+1;
                que.push(node{xx,yy,p.w+1});
            }
        }
    }
}
int main(){
    scanf("%d%d",&N,&Q);
    memset(dis,-1,sizeof(dis));
    while(!que.empty()) que.pop();
    for(int i=0;i<N;i++){
        node tmp;
        scanf("%d%d",&tmp.x,&tmp.y);
        tmp.w=0;
        que.push(tmp);
//        cout<<"!!!!!!!!"<<endl;
        dis[tmp.x][tmp.y]=0;
    }
    bfs();
    for(int i=0;i<Q;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        printf("%d\n",dis[a][b]);
    }

    return 0;
}
/*
2 3
0 1
4 0
5 0
4 3
1 2
*/