#include #include #include #include using namespace std; int l; pair start, des; bool visited[300][300]; int dx[]={-2, -2, -1, -1, 1, 1, 2, 2}; int dy[]={1, -1, 2, -2, 2, -2, 1, -1}; int bfs() { visited[start.first][start.second]=1; queue>> q; q.push({0, {start.first, start.second}}); int ans=1e9; while(!q.empty()) { int d=q.front().first; int x=q.front().second.first; int y=q.front().second.second; q.pop(); if(d>=ans) continue; for(int i=0;i<8;i++) { //start보다 x나 y가 3이상 차이나면서 더 멀어지려 할 때 cut if(dx[i]>0) { if(x>des.first && x-des.first>=3) continue; } else { if(x=3) continue; } if(dy[i]>0) { if(y>des.second && y-des.second>=3) continue; } else { if(y=3) continue; } int nx=x+dx[i]; int ny=y+dy[i]; if(nx<0 || nx>=l) continue; if(ny<0 || ny>=l) continue; if(!visited[nx][ny]) { if(nx==des.first && ny==des.second) ans=min(ans, d+1); else { visited[nx][ny]=1; q.push({d+1, {nx, ny}}); } } } } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin>>t; while(t--) { cin>>l; cin>>start.first>>start.second>>des.first>>des.second; if(start.first==des.first && start.second==des.second) { cout<<"0\n"; continue; } memset(visited, 0, sizeof(visited)); int ans=bfs(); cout<

코드 #2027