poj 3278 Catch That Cow(BFS)

最新推荐文章于 2024-03-31 12:10:12 发布

亿念之茶

最新推荐文章于 2024-03-31 12:10:12 发布

阅读量530

点赞数

分类专栏： poj代码 BFS

本文链接：https://blog.csdn.net/lh__huahuan/article/details/47312337

版权

poj代码同时被 2 个专栏收录

20 篇文章 0 订阅

订阅专栏

BFS

8 篇文章 0 订阅

订阅专栏

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 61200		Accepted: 19106

点击打开链接

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

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.

题意：

农夫抓牛：农夫在N点 (0 ≤ N ≤ 100,000)，牛在K点 (0 ≤ N ≤ 100,000)，其中农夫抓牛过程中的方式有：

1.步行：从当前点X到X-1或者X+1；

2.远程：从当前点X到2*X点；

求农夫找到牛的最少步数

题意分析：

本题是一个广搜，利用队列，注意边界

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
using namespace std;
#define MAX 100005
queue<int>q;

int step[MAX];
int vis[MAX];

int BFS(int st,int ed)
{
  while(!q.empty())
  q.pop();
  
  q.push(st);
  vis[st]=1;
  
  int temp=0;
  while(!q.empty())
  {
  	int x=q.front();
  	q.pop();
  	
  	for(int i=0;i<3;i++)
	{
	  if(i==0)//向前走
	  	temp=x+1;
	  else if(i==1)//向后走
	    temp=x-1;
	  else if(i==2)//跳着走
	    temp=x*2;
	  
	  if(temp>=0&&temp<=MAX-5&&!vis[temp])//注意边界，并且是没有被访问的点
	  {
	    step[temp]=step[x]+1;//此处当注意
	  	if(temp==ed)//边界
	  	return step[temp];
	  	vis[temp]=1;
	  	q.push(temp);
	  }
	} 
  }
}

int main()
{
	int N,K;
   while(~scanf("%d%d",&N,&K))
   {
   	memset(vis,0,sizeof(vis));
   	memset(step,0,sizeof(step));
	if(N>=K)//注意
   	printf("%d\n",N-K);
   	else
   	printf("%d\n",BFS(N,K));
   }
  return 0;	
}