[bfs] poj3278 Catch that Cow

Catch That Cow
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 45556 Accepted: 14277
Description
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN (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 orX+ 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 andK
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.

翻译：
农夫知道一头牛的位置，想要抓住它。农夫和牛都位于数轴上，农夫起始位于点N(0<=N<=100000)，牛位于点K(0<=K<=100000)。农夫有两种移动方式：
1、从X移动到X-1或X+1，每次移动花费一分钟。
2、从X移动到2*X，每次移动花费一分钟。
假设牛没有意识到农夫的行动，站在原地不动。农夫最少要花多少时间才能抓住牛？
样例说明：农夫从5到17的最快走法是这样: 5 - 10 - 9 - 18 - 17 ，总共4分钟。

一道老题目了，去年就作为例题学过，今天重新敲一遍，代码结构简洁清楚了很多，一些模型也比以前掌握的好多啦~

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

int N,K;
int vis[100010];

struct node
{
    int x,steps;
};
node p[100010];


int main()
{
    int ans = 0;
    while(cin>>N>>K)
    {
        node a,next;
        a.x = N,a.steps = 0;
        memset(vis,0,sizeof(vis));
        vis[N] = 1;
        queue<node> Q;
        Q.push(a);
        while(!Q.empty())
        {
            a=Q.front();
          //  cout<<a.x<<" "<<a.steps<<endl;
            if (a.x == K)
            {
                ans = a.steps;
                break;
            }

            else
            {
                if( a.x*2<=100000 && !vis[a.x*2])
                {
                    next.x = a.x*2;
                    next.steps = a.steps +1;
                    vis[a.x*2] = 1;
                    Q.push(next);
                }
                if ( a.x+1<=100000 &&!vis[a.x+1] )
                {
                    next.x = a.x+1;
                    next.steps = a.steps+1;
                    vis[a.x+1] = 1;
                    Q.push(next);
                }
                if ( a.x-1>=0 && !vis[a.x-1])
                {
                    next.x = a.x-1;
                    next.steps = a.steps+1;
                    vis[a.x-1] = 1;
                    Q.push(next);
                }

                Q.pop();
            }

        }
        printf("%d\n",ans);
    }
    return 0;
}