poj3278 Catch That Cow(BFS)

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 49456		Accepted: 15497

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.

/*
此题好崩溃。。。基础的广搜题。。。。一个上午，，，写了三种方式的代码，，一直错。。。。。群里有个孩子帮我看了一下，发现这个范围应该是<MAX,而不是k。可能会超出k的范围。。。。。。。。。。。。。。。。。。。。。。wa了十几次
Time:2014-12-29 14:01
*/
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int MAX=200000+10;
struct Point{
    int pos;
    int steps;
};
int n,k;
bool vis[MAX];
queue<Point>q;
int main(){
        scanf("%d%d",&n,&k);
        Point cur,temp;
        memset(vis,0,sizeof(vis));
        cur.pos=n,cur.steps=0;
        while(!q.empty())q.pop();
        q.push(cur);vis[n]=true;
        while(!q.empty()){
            cur=q.front(); q.pop();

            //printf("pos=%d steps=%d\n",cur.pos,cur.steps);
            for(int i=0;i<3;i++){
                if(i==0)temp.pos=cur.pos<<1;
                else if(i==1)temp.pos=cur.pos+1;
                else temp.pos=cur.pos-1;
                if(temp.pos>=0&&temp.pos<MAX&&!vis[temp.pos]){
                    temp.steps=cur.steps+1;
                    vis[temp.pos]=true;
                    q.push(temp);
                }
                if(cur.pos==k){
                    printf("%d\n",cur.steps);
                    break;
                }
            }
        }
return 0;
}