Catch That Cow 广搜 BPS-CSDN博客

本文链接：https://blog.csdn.net/weidaoRan/article/details/47957347

三种走法

*2，-1，+1；

如果人在牛右边，就只能-1；

题目如下：

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 61948		Accepted: 19376

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

代码如下：

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>

using namespace std;

int N,K,via[1000001],step[1000001],a[1000001];//注意数组大小

int next[3][2]={{1,1},{1,-1},{2,0}};//3个方向

void BPS(int i)//广搜   核心代码
{
    int rear=0,front=0,x,k,q;
    a[rear++]=i;
    via[i]=1;
    step[i]=0;
    while(front<rear)
    {
      q=a[front++];
      for(k=0;k<3;k++)
      {
          x=next[k][1]+q*next[k][0];
          if(!via[x]&&x>0&&x<=100000)
          {
              if(x==K)
              {
                  step[x]=step[q]+1;
                  return ;
              }
              else
              {
                 via[x]=1;
                 a[rear++]=x;
                 step[x]=step[q]+1;
              }
          }
      }
    }
}

main()
{
  while(cin>>N>>K){
  memset(via,0,sizeof(via));
  memset(step,0,sizeof(step));
  memset(a,0,sizeof(a));
  if(N<K)
  {
      BPS(N);
      cout<<step[K]<<endl;
  }
  else//我说过的那种情况
    cout<<N-K<<endl;
  }
  return 0;
}