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.
AC代码:(三种情况、一维的bfs一一枚举就可以)
Select Code
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
//#include <bits/stdc++.h>
using namespace std;
int vis[100000+10];
struct node
{
int x;
int step;
}s, t;
int n, m;
void bfs()
{
int i;
queue<node>q;
s.x = n, s.step = 0;
q.push(s);
vis[s.x] = 1;
while(!q.empty())
{
s = q.front();
q.pop();
if(s.x==m)
{
printf("%d\n",s.step);
return;
}
for(i = 0;i<3;i++)
{
t = s;
switch(i)
{
case 0:
t.x = s.x+1;
if(t.x>=0&&t.x<=100000&&!vis[t.x])
{
vis[t.x] = 1;
t.step = s.step+1;
q.push(t);
}
break;
case 1:
t.x = s.x-1;
if(t.x>=0&&t.x<=100000&&!vis[t.x])
{
vis[t.x] = 1;
t.step = s.step+1;
q.push(t);
}
break;
case 2:
t.x = s.x*2;
if(t.x>=0&&t.x<=100000&&!vis[t.x])
{
vis[t.x] = 1;
t.step = s.step+1;
q.push(t);
}
break;
}
}
}
printf("-1\n");
return;
}
int main()
{
scanf("%d %d",&n, &m);
memset(vis, 0, sizeof(vis));
bfs();
return 0;
}