【杭电】2717-bfs

Catch That Cow

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

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 

广搜，+1 -1 *2都遍历一遍，最先到达的步数最少

code：

#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
#define max 100010
int n,k;
int stp[2*max];
void bfs(int n)
{
	int next,t;
	queue<int>q;
	q.push(n);
	while(!q.empty())
	{
		t=q.front();
		q.pop();
		if(t==k)
		break;
		for(int i=1;i<=3;i++)
		{
			if(i==1) next=t-1;
			else if(i==2) next=t+1;
			else next=2*t;
			if(next>=0&&next<max&&!stp[next])
           {stp[next]=stp[t]+1;q.push(next);
		   }
		}
	}
}
int main()
{
	while(~scanf("%d%d",&n,&k))
	{
		memset(stp,0,sizeof(stp));
		bfs(n);
		printf("%d\n",stp[k]);
	}
	return 0;
}