BFS B - Catch That Cow

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

• Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
• Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

Input
Line 1: Two space-separated integers: N and K
Output
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input
5 17
Sample Output
4
Hint
The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.

#include <stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1000000;
int N,K;
int vis[maxn];
struct mmp
{
	int x,step;
};
queue<mmp>qu;
void BFS()
{
	while(!qu.empty())
	{
		mmp p2=qu.front();
		qu.pop();
		int x=p2.x;
		int step=p2.step;
		if(x==K)
		{
			printf("%d",step);
			return ;
		}
		if(x>=1&&vis[x-1]==0)
		{
			mmp p3;
			p3.x=x-1;
			p3.step=step+1;
			vis[x-1]=1;
			qu.push(p3);
		}
			if(x<=K&&vis[x+1]==0)
		{
			mmp p4;
			p4.x=x+1;
			p4.step=step+1;
			vis[x+1]=1;
			qu.push(p4);
		}	
			if(x<=K&&vis[x*2]==0)
		{
			mmp p5;
			p5.x=x*2;
			p5.step=step+1;
			vis[x*2]=1;
			qu.push(p5);
		}	
			

	}
}
int main()
{

	while(scanf("%d%d",&N,&K)!=EOF)
	{
	
	while(!qu.empty())
	qu.pop();
	memset(vis,0,sizeof(vis));
	mmp p1;
	p1.x=N;
	p1.step=0;
	vis[N]=1;
	qu.push(p1);
	BFS();
	
	}

	return 0;
}