Poj 3278 Catch That Cow 裸bfs

xiaoyu2012888

于 2014-03-28 21:17:29 发布

阅读量463

点赞数

分类专栏： BFS 文章标签： C++ BFS POJ

BFS 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 42411		Accepted: 13189

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和k

通过 n+1或n-1 或n*2 这3种操作，使得n==k

输出最少的操作次数

解题思路：

说实话，要不是人家把这题归类到BFS，我怎么也想不到用广搜的= = 自卑ing。。。

水题水题，三入口的BFS

注意的地方有二：

1、由于用于广搜的队列数组和标记数组相当大，如果定义这两个数组时把它们扔到局部去，编译是可以的，但肯定执行不了，提交就等RE吧= =

大数组必须开为 全局。。。常识常识。。。

2、剪枝。直接广搜一样等着RE吧= =

不剪枝的同学试试输入n=0 k=100000。。。。。。铁定RE

怎么剪枝看我程序

#include <stdio.h>
#include <queue>
#include <string.h>

using namespace std;
int a[1000005];
void bfs(int N, int K)
{
	queue<int> q;
	q.push(N);

	while(q.size())
	{
		int p = q.front();
		q.pop();

		if(p == K)
			break;

		else
		{
			if(p <= K && a[p+1] == 0)
			{
				q.push(p+1);
				a[p+1] = a[p] + 1;
			}

			if(p <= K && a[2*p] == 0)
			{
				q.push(2 * p);
				a[2*p] = a[p] + 1;
			}

			if(p-1 >= 0 && a[p-1] == 0)
			{
				q.push(p-1);
				a[p-1] = a[p] + 1;
			}
		}

	}
}


int main()
{
	int N, K;
	while(scanf("%d%d",&N,&K) != EOF)
	{
		memset(a, 0, sizeof(a));
		bfs(N,K);
		printf("%d\n",a[K]);
	}
}