Catch That Cow

原题

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	Output
5 17	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.

解题思路

bfs加剪枝

如果不剪枝的话，每次有三种选择，即有n次，就是3^n次方，超时。

怎么办呢？

我们只需要把重复的记录下来，就可以了。

题解

STL

#include<iostream>
using namespace std;
#include <algorithm>
#include <queue>
void bfs();
int N,k;
bool vis[200005];
struct node{
	int x,s;
}n;
queue<node> q;
void bfs(){
	n.s=0,n.x=N;
	q.push(n);
	vis[N]=1;
	while(q.size()){
		node t=q.front();
		q.pop();
		if(t.x==k) {
			cout<<t.s;
			break;
		}
		for(int i=0;i<3;i++){
			int next=t.x;
			if(i==0&&next) next=t.x-1;
			else if(i==1&&next<k) next=t.x+1;
			else if(i==2&&next<k) next=2*t.x;
			if(!vis[next]) {
				n.s=t.s+1,n.x=next;
				q.push(n);
				vis[next]=1;
			}
		}
	}
}
int main(){
	cin>>N>>k;
	bfs();
	return 0;
}

手写

#include<iostream>
using namespace std;
#include <algorithm>
void bfs();
int N,k;
bool vis[400005];
struct Node{
	int x,s;
}node[400005];
int front=0,tail=0;
void bfs(){
	node[tail].x=N;
	node[tail++].s=0; 
	vis[N]=1;
	while(front<tail){
		Node t=node[front++]; 
	/*	t.x=node[front].x;
		t.s=node[front++].s;*/
		if(t.x==k) {
			cout<<t.s<<endl;
			break;
		}
		for(int i=0;i<3;i++){
			int next=t.x;
			if(i==0&&next) next=t.x-1;
			else if(i==1&&next<k) next=t.x+1;
			else if(i==2&&next<k) next=2*t.x;
			if(!vis[next]) {
				node[tail].x=next;
				node[tail++].s=t.s+1; 
				vis[next]=1;
			}
		}
	}
}
int main(){
	cin>>N>>k;
	bfs();
	return 0;
}