Catch That Cow(bfs)

Problem:Catch That Cow

Description:
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

Note:
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.

Language:C++

#include <iostream>
#include <cstring>
#include <queue>

using namespace std;

struct node
{
  int x;
  int cnt;
}head,tail;

int N,K;
char vis[100010];
int step[3][2]={{2,0},{1,-1},{1,1}};

void bfs()
{
  queue<node>q;
  head.x=N;
  head.cnt=0;
  memset(vis,0,sizeof(vis));
  vis[N]=1;

  q.push(head);
  while(!q.empty())
  {
    head=q.front();
    q.pop();

    if(head.x==K)
    {
      cout<<head.cnt<<endl;
      return;
    }

    for(int i=0;i<3;i++)
    {
      int tx=head.x*step[i][0]+step[i][1];
      if(tx>=0&&tx<=100010&&!vis[tx])
      {
        vis[tx]=1;
        tail.x=tx;
        tail.cnt=head.cnt+1;
        q.push(tail);
      }
    }
  }
}

int main()
{
  while(cin>>N>>K)  bfs();

  return 0;
}