POJ 3278 catch the cow (width first search, queue implementation)

POJ 3278 Catch the cow

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

const int MAXN=1e5+10;
bool visit[MAXN];
struct Status{
    
    int position;
    int time;
    Status(int p,int t):position(p),time(t){
    }
};
int BFS(int n,int k){
    
    queue<Status>myQueue;
    myQueue.push(Status(n,0));
    while (!myQueue.empty()){
    
        Status current=myQueue.front();
        if(current.position==k) return current.time;   // Has arrived , It takes time to return 
        myQueue.pop();
        for(int i=0;i<3;++i){
    
            Status next=current;
            if(i==0) next.position-=1;
            if(i==1) next.position+=1;
            if(i==2) next.position*=2;
            next.time+=1;
            if(next.position<0||next.position>1e5||visit[next.position]) continue;   // If you have visited or the location is out of bounds, skip 
            myQueue.push(next);           // Press in the next possible state 
            visit[next.position]=true;        // Mark visited 
        }
    }
    
}
int main() {
    
    int n,k;
    scanf("%d%d",&n,&k);
    fill(visit,visit+MAXN,false);
    printf("%d\n",BFS(n,k));
    system("pause");
    return 0;
}