广搜（模板题）

最新推荐文章于 2022-05-16 09:52:59 发布

码十八的小代码

最新推荐文章于 2022-05-16 09:52:59 发布

阅读量250

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/qq_57504845/article/details/119101347

版权

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

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.

求最短，最小时一定要用广搜，广搜搜索到即为最小。

#include<iostream>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
int book[1001000];
int n,k;
struct bu
{
	int x,t;
};
int bfs()
{
	queue<bu>que;
	bu ss;
	ss.x=n;
	ss.t=0;
	book[ss.x]=1;
	que.push(ss);
	while(!que.empty())
	{
		ss=que.front();
		que.pop();
		if(ss.x==k)
		{
			return ss.t;
		}
		
		for(int i=0;i<=2;i++)
		{
			int tx;
			bu du;
			if(i==0) tx=ss.x+1;
			else if(i==1) tx=ss.x-1;
			else if(i==2) tx=2*ss.x;
			if(tx<0||tx>100000)
				continue;
			if(book[tx]==1)
				continue;
			
			book[tx]=1;
			du.x=tx;
			du.t=ss.t+1;
			que.push(du);
		}
		
	}
}
int main()
{
	while(~scanf("%d%d",&n,&k))	
	{
		int ans;
		memset(book,0,sizeof(book));
		ans=bfs();
		cout<<ans<<endl;
	}
	return 0;	
	
}