蒟蒻求救！

#include<bits/stdc++.h>
#define Fr(i,a,b) for(int i=(a);i<=(int)(b);++i)
#define Dr(i,a,b) for(int i=(a);i>=(int)(b);--i)
using namespace std;
#define Inf 0x3f3f3f3f
#define M 105
int x,y;
int mv[12][2]={{-1,2},{-1,-2},{1,-2},{1,-2},{2,2},{-2,-2},{2,-2},{-2,2},{2,1},{2,-1},{-2,1},{-2,-1}};
struct node{
    int stp,x,y;
};
bool vis[55][55];
int solve(int ax,int ay){
    memset(vis,0,sizeof(vis));
    queue<node>Q;
    while(!Q.empty())Q.pop();
    if(ax==1&&ay==1)return 0;
    Q.push((node){0,ax,ay});
    vis[ax][ay]=1;
    while(!Q.empty()){
        node now=Q.front();
        Q.pop();
        if(now.x==1&&now.y==1)return now.stp;
        Fr(i,0,11){
            node nxt;
            nxt.x=now.x+mv[i][0],nxt.y=now.y+mv[i][1],nxt.stp=now.stp+1;
            if(nxt.x<1||nxt.y<1||nxt.x>50||nxt.y>50)continue;
            if(vis[nxt.x][nxt.y])continue;
            vis[nxt.x][nxt.y]=1;
            Q.push(nxt);
        }
    }
    return 0;
}
int main() {
    scanf("%d %d",&x,&y);
    cout<<solve(x,y)<<endl;
    scanf("%d %d",&x,&y);
    cout<<solve(x,y)<<endl;
}