Catch That Cow

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 74038   Accepted: 23331 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 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. Source

#include<stdio.h>
#include<string.h>
int visit[100010];
int n,k;
struct node
{
int x;
    int step;
}q[100010];
int bfs( int x)
{
    struct node a,t;
    int i,head,tail;
    head = 0;
    tail = 0;
    a.x=x;
    a.step = 0;
    visit[x] = 1;
    q[tail++]=a;
    while(head<tail)
    {
       a=q[head++];
       if(a.x==k)
         return a.step;
         t.x=a.x+1;
         if(t.x>=0&&t.x<=100000&&visit[t.x]==0)
         {
            t.step=a.step+1;
            visit[t.x]=1;
             q[tail++] = t;
         }
         t.x=a.x*2;
         if(t.x>=0&&t.x<=100000&&visit[t.x]==0)
         {
            t.step=a.step+1;
            visit[t.x]=1;
             q[tail++] = t;
         }
         t.x=a.x-1;
         if(t.x>=0&&t.x<=1000001&&visit[t.x]==0)
         {
            t.step=a.step+1;
            visit[t.x]=1;
             q[tail++] = t;
         }
    }
}
int main()
{
    int ans;
   while(~ scanf("%d%d",&n,&k))
   {
      memset(visit,0,sizeof(visit));
      ans = bfs(n);
      printf("%d\n",ans);
   }

}