https://vjudge.net/contest/402204#problem/C
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.
Sponsor
代码:
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include<time.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
const int maxn=200000;
ll n,m,s,k;
int ans;
int x[400001];
struct node{
int x;
int t;
}p;
queue<node>q;
void bfs()
{
p.x=n;
p.t=0;
while(!q.empty())
{
q.pop();
}
q.push(p);
while(!q.empty())
{
p=q.front();
q.pop();
if(p.x==m)
{
ans=p.t;
break;
}
if(p.x>=0&&p.x<=maxn&&x[p.x*2]==0)
{
x[p.x*2]=1;q.push({p.x*2,p.t+1});
}
if(p.x>=0&&p.x<=maxn&&x[p.x+1]==0)
{
x[p.x+1]=1;q.push({p.x+1,p.t+1});
}
if(p.x>=0&&p.x<=maxn&&x[p.x-1]==0)
{
x[p.x-1]=1;q.push({p.x-1,p.t+1});
}
}
}
int main()
{
scanf("%lld %lld",&n,&m);
bfs();
cout<<ans<<endl;
return 0;
}