Submission #6754073

---

Source Code Expand

// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
int dir[8]={1,-1,5,-5,10,-10};
struct ss{
    int x,y;
};
int n,m;
queue<ss> q;
int bfs(int x,int y)
{
    ss s;
    s.x=x;
    s.y=y;
    q.push(s);
    while(!q.empty())
    {
        ss now=q.front();
        q.pop();
        if(now.x==m)
        {
            return now.y;
        }
        for(int i=0;i<6;i++)
        {
            int tx=now.x+dir[i];
            ss s;
            s.x=tx;
            s.y=now.y+1;
            q.push(s);
        }
    }
}
int main()
{
    cin>>n>>m;
    cout<<bfs(n,0)<<endl;
    return 0;
}

Submission Info

Judge Result