POJ 3278 Catch That Cow【BFS】

最新推荐文章于 2024-07-24 11:36:30 发布

原创最新推荐文章于 2024-07-24 11:36:30 发布 · 365 阅读

0 ·

CC 4.0 BY-SA版权

10.BFS 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个有趣的算法问题——如何在最短时间内用两种移动方式（步行和瞬间传送）捕捉到一只静止不动的牛。提供了完整的C++代码实现，并采用广度优先搜索（BFS）策略来解决此问题。

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 79281		Accepted: 25001

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

G++过不了，换成c++就行了；

AC代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
 
using namespace std;

struct Node{
	int u,n;
	Node(int a=0,int b=0): u(a),n(b){} 
}; 
const int MAXN=1e5+100;
bool vis[MAXN+11];

int BFS(int S,int E) { 
    queue<Node> Q;
	Node s(S,0); Q.push(s); vis[S]=true;
	while(!Q.empty()) {
		Node F=Q.front(); Q.pop();
		if(F.u==E) return F.n;
		Node a(F.u*2,F.n+1),b(F.u-1,F.n+1),c(F.u+1,F.n+1);
		if(a.u>=0&&a.u<MAXN&&!vis[a.u]) {
			Q.push(a); vis[a.u]=true;
		}
	    if(b.u>=0&&b.u<MAXN&&!vis[b.u]) {
	    	Q.push(b); vis[b.u]=true; 
		}
		if(c.u>=0&&c.u<MAXN&&!vis[c.u]) {
		    Q.push(c); vis[c.u]=true;	
		}
	}	
}
int main()
{
	int N,K;
	while(~scanf("%d%d",&N,&K)) { 
	    if(N>=K) {
	    	printf("%d\n",N-K); continue;
		}
	    memset(vis,false,sizeof(vis));
		printf("%d\n",BFS(N,K));
	}
	return 0;
}