Problem 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
poj3278 有链接提示的题目请先去链接处提交程序,AC后提交到SDUTOJ中,以便查询存档。
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.
#include <bits/stdc++.h>
using namespace std;
const int maxn=100001;
int visit[maxn];
struct node
{
int step,sta;
}x,z;
int bfs(int n,int k)//n为FJ位置,k为牛的位置
{
queue<node> q;
visit[n]=1;
x.sta=n;
x.step=0;
q.push(x);
while(!q.empty()){
x=q.front();
q.pop();
for(int i=0;i<3;i++){ //FJ的三种走法
if(i==0) z.sta=x.sta-1;
else if(i==1) z.sta=x.sta+1;
else z.sta=x.sta*2;
if(z.sta<0||z.sta>maxn) continue;//出界
if(!visit[z.sta]){//如果此点未被访问
z.step=x.step+1;
q.push(z);
visit[z.sta]=1;
}
if(z.sta==k) return z.step;
}
}
}
int main()
{
int n,k;
while(cin>>n>>k){
memset(visit,0,sizeof(visit));
//如果人在牛后边,只能倒退回去
if(n>=k) cout<<n-k<<endl;
//否则,bfs();
else cout<<bfs(n,k)<<endl;
}
return 0;
}