阳历莓果

#include<bits/stdc++.h>
using namespace std;
bool vis[25][25];
struct ss
{
    long long x,y,pos;
    ss(long long x0=0,long long y0=0,long long pos0=0)
    {
        x=x0,y=y0,pos=pos0;
    }
};
long long ans;
void bfs(long long a,long long b);
int main(){
	for(int o=0;o<=1;o++)
    {
        memset(vis,0,sizeof(vis));
        ans=0x7fffffffffff;
        long long a,b;
        cin>>a>>b;
        bfs(a,b);
        cout<<ans<<'\n';
    }
	
	
	
	return 0;
}
void bfs(long long a,long long b)
{
    queue<ss>q;
    q.push(ss(a,b,0));
    while(!q.empty())
    {
        long long x,y,pos;
        x=q.front().x;
        y=q.front().y;
        pos=q.front().pos;
        q.pop();
        if(x==1&&y==1)
        {
            //cout<<pos<<'\n';
            
            ans=min(ans,pos);
            continue;
        }
        if(x<1||y<1||x>a||y>b)
        {
            continue;
        }
        if(vis[x][y])
            continue;
        vis[x][y]=1;
        q.push(ss(x+1,y+2,pos+1));
        q.push(ss(x-1,y+2,pos+1));
        q.push(ss(x+2,y+1,pos+1));
        q.push(ss(x+2,y-1,pos+1));
        q.push(ss(x-1,y-2,pos+1));
        q.push(ss(x-2,y+1,pos+1));
        q.push(ss(x+1,y-2,pos+1));
        q.push(ss(x-2,y-1,pos+1));
        q.push(ss(x+3,y+3,pos+1));
        q.push(ss(x-3,y+3,pos+1));
        q.push(ss(x+3,y-3,pos+1));
        q.push(ss(x-3,y-3,pos+1));
    }
}