백준 알고리즘 18404번 : 현명한 나이트

링크

https://www.acmicpc.net/problem/18404

sol1) BFS + 구현

#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define fastio cin.tie(0)->sync_with_stdio(0)
#define sz(v) (int)(v).size()
#define all(v) v.begin(), v.end()
#define rall(v) (v).rbegin(), (v).rend()
#define compress(v) sort(all(v)), (v).erase(unique(all(v)), (v).end())
#define OOB(x, y) ((x) < 0 || (x) >= n || (y) < 0 || (y) >= m)
#define debug(x) cout << (#x) << ": " << (x) << '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using ldb = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vs = vector<string>;
using tii = tuple<int,int,int>;
template<typename T> using wector = vector<vector<T>>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;

wector<int> adj(501,vector<int>(501,0));
wector<int> dist(501,vector<int>(501,-1));
int dx[] = {-2,-2,-1,-1,1,1,2,2};
int dy[] = {-1,1,-2,2,-2,2,-1,1};

int main() {
  fastio;
  int n,m,x,y; cin >> n >> m >> x >> y; --x,--y;
  vector<pii> v(m);
  queue<pii> Q;
  for(int i = 0; i < m; i++) cin >> v[i].X >> v[i].Y, --(v[i].X),--(v[i].Y);
  dist[x][y] = 0;
  Q.push({x, y});
  while(!Q.empty()){
    auto [curX, curY] = Q.front(); Q.pop();
    for(int i = 0; i < 8; i++){
      auto nx = curX + dx[i];
      auto ny = curY + dy[i];
      if(nx < 0 || nx >= n || ny < 0 || ny >= n) continue;
      if(dist[nx][ny] != -1) continue;
      dist[nx][ny] = dist[curX][curY] + 1;
      Q.push({nx, ny});
    }
  }
  for(auto [toX, toY] : v) cout << dist[toX][toY] << " ";
  return 0;
}

문제에서 나온대로 그대로 BFS를 구현해주면 됩니다.