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
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
5 17
4
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.
题解:很入门的一道搜索题目,就是一条横轴上,从n点倒k点,每次只能走加一步或减一步或当前步数的两倍。我们可以用bfs把每次可能走到的位置压入队列,然后一次次取出再走就行。因为数据不大,直接开个数组来判断是否走过就行。
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
bool b[400001]; //用来判断是否走过当前位置
int n,m,S;
struct f {
int node,s; //node为当前位置,s表示已走步数
};
void bfs() {
queue<f> q;
f x,y;
x.node=n;
x.s=0;
q.push(x);
memset(b,0,sizeof(b));
b[n]=1;
while(!q.empty()) {
x=q.front();
q.pop();
if(x.node==m){
S=x.s;
return ;
}
if(x.node-1>=0&&b[x.node-1]==0){ //向左走
y.node=x.node-1;
y.s=x.s+1;
b[y.node]=1;
q.push(y);
}
if(x.node+1<400000&&b[x.node+1]==0){ //向右走
y.node=x.node+1;
y.s=x.s+1;
b[y.node]=1;
q.push(y);
}
if(x.node*2<=400000&&b[x.node*2]==0){ //走两倍
y.node=x.node*2;
y.s=x.s+1;
b[y.node]=1;
q.push(y);
}
}
}
int main() {
cin>>n>>m;
bfs();
cout<<S;
}