HRBUST 1012 Catch That Cow （BFS）

信鸦

于 2017-04-17 13:58:47 发布

阅读量490

点赞数

分类专栏：搜索文章标签： bfs

本文链接：https://blog.csdn.net/NEET_Champloo/article/details/70210271

版权

搜索专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Catch That Cow

Time Limit: 2000 MS

Memory Limit: 65536 K

Total Submit: 1914(545 users)

Total Accepted: 800(504 users)

Rating:

Special Judge: No

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

For each test case :
Line 1: Two space-separated integers: N and K
Process to the end of file.

Output

For each test case :
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

Sample Input

 5 17
 100 100

Sample Output

 4
 0
 

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int m,n;
int vis[200001];
int xx(int a)
{
    queue<int>k;
    k.push(a);
    while(!k.empty())
    {
        vis[a]=1;
        int a1=k.front();
        k.pop();
        if(a1==n)
        {
            return vis[n]-1;
        }
        for(int i=0; i<3; i++)
        {
            int a2;
            if(i==0)
            {
                a2=a1+1;
            }
            if(i==1)
            {
                a2=a1-1;
            }
            if(i==2)
            {
                a2=a1*2;
            }
            if(!vis[a2]&&a2>=0&&a2<100001)
            {
                vis[a2]=vis[a1]+1;
                k.push(a2);
            }
        }
    }
}
int main()
{

    while(scanf("%d%d",&m,&n)==2)
    {
        memset(vis,0,sizeof(vis));
        printf("%d\n",xx(m));
    }
}