Submission #6673212

---

Source Code Expand

#include<iostream>
#include<queue>
using namespace std;
int step,t[6]={1,-1,5,-5,10,-10};
struct node{
    int x,s;
    node(){}
    node(int x,int s):x(x),s(s){}
};
node a,b;
void bfs(){
    queue<node> q;
    q.push(a);
    while(!q.empty()){
        node u=q.front(),d;
        int i,f=0;
        q.pop();
        for(i=0;i<6;i++){
            d.x=u.x+t[i];
            d.s=u.s+1;
            if(d.x==b.x){
                step=d.s;
                f=1;
                break;
            }
            q.push(d);
        }
        if(f){
            break;
        }
    }
}
int main(int argc, char const *argv[]){
    cin>>a.x>>b.x;
    if(a.x==b.x){
        cout<<0<<endl;
        return 0;
    }
    bfs();
    cout<<step<<endl;
    return 0;
}

Submission Info

Judge Result