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
题意:给你的当前位置,要你去到给定位置抓住那头牛,你每次走的步数是有限制的。前进+1 -1 *2;
思路:BFS
AC代码:
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int n,k;
const int MAXN=100000+10;
int vis[MAXN];
void bfs(int x)
{
queue<int >q;
q.push(x);
while(!q.empty())
{
x=q.front();
q.pop();
if(x==k)break;
if(x+1<=MAXN-10&&!vis[x+1])
{
vis[x+1]=vis[x]+1;
q.push(x+1);
}
if(x-1>=0&&!vis[x-1])
{
vis[x-1]=vis[x]+1;
q.push(x-1);
}
if(x*2<=MAXN-10&&!vis[x*2])
{
vis[2*x]=vis[x]+1;
q.push(x*2);
}
}
}
int main()
{
memset(vis,0,sizeof(vis));
scanf("%d %d",&n,&k);
vis[n]=1;
if(n>=k)
printf("%d\n",n-k);
else
{
bfs(n);
printf("%d\n",vis[k]-1);
}
return 0;
}