7562번_나이트의 이동(BFS)

문제 출처 : https://www.acmicpc.net/problem/7562

<C++Code>

#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
int v[301][301];
int d[301][301];
int x[] = {-2,-1,1,2,2,1,-1,-2};
int y[] = {1,2,2,1,-1,-2,-2,-1};
int main(void)
{
    int k;
    cin>>k;
    while(k--)
    {
        memset(v,-1,sizeof(v));
    int n;
    int si,sj,ei,ej;
    cin>>n;
    cin>>si>>sj;
    cin>>ei>>ej;
    queue<pair<int,int> > q;
    q.push({si,sj});
    v[si][sj]=0;
    while(!q.empty())
    {
        int pox=q.front().first;
        int poy=q.front().second;
        q.pop();
        if(pox==ei&&poy==ej)
        {
            break;
            
        }
        for(int i=0;i<8;i++)
        {
            int nx=pox+x[i];
            int ny=poy+y[i];
            if(nx<0||nx>=n||ny<0||ny>=n) continue;
            if(v[nx][ny]==-1)
            {
                v[nx][ny]=v[pox][poy]+1;
                q.push({nx,ny});
            }
        }
    }
 
    cout<<v[ei][ej]<<endl;
}
    
    
    return 0;
    
}