搜索-G

• 原题

  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），对所有状况进行一次搜索，最先找到的肯定就是时间最少的。

• AC代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
using namespace std;
struct point
{
    int x, y, step;
} st;
queue <point> q;
int vis[200000];
int n, m;
int flat;
int bfs()
{
    while (!q.empty())
    {
        q.pop();
    }

    memset(vis, 0, sizeof(vis));
    vis[st.x] = 1;
    q.push(st);
    while (!q.empty())
    {

        point now = q.front();
        if(now.x==m)
            return now.step;
        q.pop();
        for (int j = 0; j < 3; j++)
        {
            point next = now;

            if (j == 0)
            {
                next.x = next.x + 1;
            }
            else if (j == 1)
            {
                next.x = next.x - 1;
            }
            else if (j == 2)
            {
                next.x = next.x * 2;
            }
            ++next.step;
            if (next.x == m)
            {
                return next.step;
            }
            if (next.x >= 0 && next.x <= 200000 && !vis[next.x])
            {
                vis[next.x] = 1;
                q.push(next);
            }
        }
    }
return 0;
}
int main()
{
    while (cin>>n>>m)
    {
        st.x = n;
        st.step=0;
        cout<<bfs()<<endl;
    }

    return 0;
}