[kuangbin带你飞]专题一 简单搜索 ：C - Catch That Cow(POJ 3278) (简单bfs)

题目链接：题目
题目描述：
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?
  输入描述：
  Line 1: Two space-separated integers: N and K
  输出描述：
  Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
  样例输入：

5 17

输出描述：

4

代码：

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
typedef long long int ll;
int n,k;
ll cnt;
bool vis[100110];
struct node
{
 int x,step;
};
int bfs()
{
 queue<node> q;
 node a,next;
 a.x=n,a.step=0;
 q.push(a);
 vis[a.x]=true;
 while(!q.empty())
 {
  a=q.front();
  q.pop() ;
  if(a.x==k)return a.step;
  for(int i=0;i<3;i++)
  {
   if(i==0)next.x=2*a.x;
   else if(i==1)next.x=a.x+1;
   else next.x=a.x-1;//三种都要试试 
   next.step=a.step+1;
   if(next.x<0||next.x>100110)continue;
   if(vis[next.x])continue;//不走重复的，以免死循环 
   q.push(next); 
   vis[next.x]=true;
  }
  
 }
} 
int main()
{
 cin>>n>>k;
 cnt=bfs();
 cout<<cnt;
 return 0;
}