[USACO 2007 Ope S]Catch That Cow [DFS]

题目描述

 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?

输入描述:

Line 1: Two space-separated integers: N and K

输出描述:

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

示例1
输入
5 17
输出
4
说明
Farmer John starts at point 5 and the fugitive cow is at point 17.
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点，他们是在一条一维数轴上。然后这个牛不会动，人有三个操作，位置加一减一，或者乘2，每个操作耗时1分钟，问你这个人需要多少分钟才能抓到这头牛。

解题思路：

 直接上广搜，肯定能抓到，只是时间问题。从N点开始出发，每次标记一下到达的点，如果之前已经到达过了，那就不用管。然后记录一下最短到达时间。如果找到K点了，那就输出答案。

解题代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
#define ll long long
const int maxn=1e5+10;
const int inf=0x3f3f3f3f;
int n,m,dis[maxn];
void init(){
	memset(dis,-1,sizeof(dis));
}
bool check(int x){
	if(x>=0&&x<=100000)
		return true;
	return false;
}
void bfs(int s){
	queue<int> qu;
	while(!qu.empty()) qu.pop();
	qu.push(s);
	dis[s]=0;
	while(!qu.empty()){
		int u=qu.front();qu.pop();
		if(u==m){
			return ;
		}
		if(check(u*2)&&dis[u*2]==-1){
			dis[u*2]=dis[u]+1;
			qu.push(u*2);
		} 
		if(check(u+1)&&dis[u+1]==-1){
			dis[u+1]=dis[u]+1;
			qu.push(u+1);
		} 
		if(check(u-1)&&dis[u-1]==-1){
			dis[u-1]=dis[u]+1;
			qu.push(u-1);
		} 
	}
}
int main(){
	int i,j,ans;
	scanf("%d%d",&n,&m);
	init();
	bfs(n);
	printf("%d\n",dis[m]);
	return 0;
}