Catch That Cow【bfs判断方向是否可行的条件】

Catch That Cow

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

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.
   
   
   
   

    
    思路：  BFS
   
   
   
   

    
    /*//  Runtime Error (ACCESS_VIOLATION)  
①除以零
②数组越界：int a[3]; a[10000000]=10;
③指针越界：int * p; p=(int *)malloc(5 * sizeof(int)); *(p+1000000)=10;
④使用已经释放的空间：int * p; p=(int *)malloc(5 * sizeof(int));free(p); *p=10;
⑤数组开得太大，超出了栈的范围，造成栈溢出：int a[100000000];
*/
   
   
   
   

    
    代码
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
#define M 100000+10
using namespace std;
int v[M],step[M];
void bfs(int st,int ed)
{

    
    	int now,next,exist=0;

    
    	queue<int >num;

    
    	v[st]=1;step[st]=0;

    
    	num.push(st);

    
    	while(!num.empty())

    
    	{

    
    		now=num.front();

    
    		num.pop();

    
    		if(now==ed)

    
    		{

    
    			exist=1;

    
    			break;

    
    		}

    
    			next=now-1;  // 每一个方向都有一种判定条件  

    
    			if(!v[next]&&next>=0)
    
    	// 以后写的时候 ，，要逐个分析，，每个方向可能相同，（即可以合并），不同的 要分开来写

    
    			{

    
    				v[next]=1;

    
    				step[next]=step[now]+1;

    
    				num.push(next);

    
    			}

    
    			next=now+1;

    
    			if(!v[next]&&next<=ed) 

    
    			{

    
    				

    
    				v[next]=1;

    
    				step[next]=step[now]+1;

    
    				num.push(next);

    
    			}

    
    		next=now*2;

    
    		if(!v[next]&&next<=M)

    
    		{

    
    			v[next]=1;

    
    	 
    
    		step[next]=step[now]+1;

    
    			num.push(next);

    
    		}

    
    	}

    
    	if(exist) printf("%d\n",step[ed]);
}
int main()
{

    
    	int st,ed;
 
    
    	while(~scanf("%d%d",&st,&ed))

    
    	{

    
    		memset(v,0,sizeof(v));

    
    		memset(step,0,sizeof(step));

    
    		bfs(st,ed);

    
    	}

    
    	return 0;
}