poj 3278 Catch That Cow 广度优先搜索

D - Catch That Cow

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  POJ 3278

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.

题意；类似于给你一个数问你最少经过几步可以变成另一个数,每次对这个数的变化只能是+1，-1或者*2；

思路:我们可以用广度优先搜索,每次讲他所有的情况+1，-1，*2都存下来并标记 然后继续寻找 一直到找到为止,先找到的一定是最少的

ac代码：

#include<stdio.h>
#include<string.h>
#define MAXN 1000000
struct node
{   int num;
    int s;
}q[MAXN];
int b[MAXN];
int main()
{  int n,k;
   int head,tail;
   while(scanf("%d %d",&n,&k)!=EOF)
   {  int flag=0,t; 
    memset(b,0,sizeof(b));
   head=1;
   tail=1;
   q[tail].num=n;
   q[tail].s=0;
   b[t]=1; 
   tail++;
   if(n==k)
    {
printf("0\n");
continue;
}
while(head<tail)
{    for(int i=1;i<=3;i++)
       {   if(i==1)
            {   
    t=2*q[head].num;
if(t>2*k||t==0)//当t>2*k时不需要再*2；
 continue;
 else 
 {  
  if(b[t]==0)
  {
   b[t]=1;
 q[tail].num=t;
                q[tail].s=q[head].s+1;
tail++;}
                  if(t==k)
                  {  flag=1;
                     break;
  }
  }
}
 if(i==2)
{  t=q[head].num+1;
if(b[t]==0)
{
   b[t]=1;
   q[tail].num=t;
   q[tail].s=q[head].s+1;
   tail++;
}
 if(t==k)
                  {  flag=1;
                     break;
  }
}
if(i==3)
{   t=q[head].num-1;//这里我是最后进行的减一操作,刚开始我是在第二步进行的-1操作,然后当t<0时，直接continue；

会导致下面的的语句全不执行，导致RTE;
   if(t<0)
    continue;
  if(b[t]==0)
  {
     b[t]=1;
    q[tail].num=t;
   q[tail].s=q[head].s+1;
tail++;}
    if(t==k)
                  {  flag=1;
                     break;
  }
}
}
if(flag==1)
break;
head++;
}
      printf("%d\n",q[tail-1].s);
   
   }
   return 0;
}