Catch That Cow(BFS)

#include <iostream>
#include <queue> 
#include <algorithm>
using namespace std;
const int N = 100010;
int s, e;
bool vis[N];
struct node{
    int p, d;
    node(int pp, int dd){
        p = pp, d = dd;
    }
};
queue<node> q;
int main(){
    cin >> s >> e;
    q.push(node(s, 0));
    while(!q.empty()){
        node now = q.front();
        q.pop();
        vis[now.p] = true;
        if(now.p == e){
            cout << now.d << endl;
            break;
        }
        if(now.p + 1 <= 100000 && !vis[now.p + 1]){
            q.push(node(now.p + 1, now.d + 1));
            vis[now.p + 1] = true;
        }
        if(now.p - 1 >= 0 && !vis[now.p - 1]){
            q.push(node(now.p - 1, now.d + 1));
            vis[now.p - 1] = true;
        }
        if(now.p * 2 <= 100000 && !vis[now.p * 2]){
            q.push(node(now.p * 2, now.d + 1));
            vis[now.p * 2] = true;
        }
    }
    return 0;
}