zoukankan      html  css  js  c++  java
  • virtual judge(专题一 简单搜索 C)

    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 - 1 or + 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.
    #include"cstdio"
    #include"queue"
    #include"cstring"
    using namespace std;
    typedef pair<int,int> P;
    const int MAXN=100005;
    int vis[MAXN];
    int n,k;
    int bfs()
    {
        queue<P> que;
        vis[n]=1;
        que.push(P(0,n));
        while(!que.empty())
        {
            P now = que.front();que.pop();
            if(now.second==k)
            {
                return now.first;
            }
            for(int i=-1;i<=1;i++)
            {
                int next;
                if(i==0) next=now.second*2;
                else    next=now.second+i;
                if(next>=0&&next<=MAXN&&!vis[next])//注意条件不能少,且顺序不能颠倒
                {
                    vis[next]=1;
                    que.push(P(now.first+1,next));
                }
            }
        }
        return -1;
    }
    int main()
    {
        while(scanf("%d%d",&n,&k)!=EOF)
        {
            memset(vis,0,sizeof(vis));
            printf("%d
    ",bfs());
        }
        return 0;
    }
  • 相关阅读:
    RSS简易阅读器vb.net源代码
    [建议]有关图片地址的建议
    [音乐欣赏]wind flowers
    有个叫计算机的比我笨
    一个朋友画的建筑设计手绘图与其想到的
    [推荐]华建小翻--QQ里的一个不错的服务商
    爆强的广告
    [学习日记]重构简易RSSREADER的UML类图
    [音乐欣赏]红颜
    [音乐欣赏]花与琴的流星
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5001925.html
Copyright © 2011-2022 走看看