HDU 2717 Catch That Cow BFS

Catch That Cow

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13023    Accepted Submission(s): 4009

Problem 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

  
  

   
   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.
   
   
   
    
  
  

 

Source

USACO 2007 Open Silver

 

Recommend

teddy   |   We have carefully selected several similar problems for you:   2102  1372  1240  1072  1180 

 

简单的BFS，就是模板题，但是要注意初始化时清空队列。

ac代码：

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

struct node{
	int x;
	int ceng;
};

int n,k,jdg[200005],ans;
queue<node> Q;

void init()
{
	while(!Q.empty())
	{
		Q.pop();
	}
	ans=0;
	memset(jdg,0,sizeof(jdg));
}
int judge(node m)
{
	if(m.x>=0&&m.x<=200000&&!jdg[m.x])
		return 1;
	
	return 0;
}
void bfs(int x)
{
	node tmp;
	tmp.x=x;
	jdg[x]=1;
	tmp.ceng=0;
	Q.push(tmp);
	while(!Q.empty())
	{
		tmp=Q.front();
		Q.pop();
		if(tmp.x==k)
		{
			ans=tmp.ceng;
			
			return ;
		}
		
		node m;
		m.ceng=tmp.ceng+1;
		
		m.x=tmp.x-1;
		if(judge(m))
		{
			jdg[m.x]=1;
			Q.push(m);
		}
		
		m.x=tmp.x+1;
		if(judge(m))
		{
			jdg[m.x]=1;
			Q.push(m);
		}
		
		m.x=tmp.x*2;
		if(judge(m))
		{
			jdg[m.x]=1;
			Q.push(m);
		}
	}
}
int main()
{
	while(~scanf("%d %d",&n,&k))
	{
		init();
		bfs(n);
		printf("%d\n",ans);
	}
	
	return 0;
}