POJ3278 - Catch That Cow (Java代码+注释）

最新推荐文章于 2023-02-02 11:15:00 发布

Mosyi_

最新推荐文章于 2023-02-02 11:15:00 发布

阅读量135

点赞数

文章标签： java 算法深度优先

本文链接：https://blog.csdn.net/Mosyi_/article/details/127639077

版权

题目描述

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?

Farmer John 已获悉一头逃亡奶牛的位置，并希望立即抓住她。他从数轴上的点 N (0 ≤ N ≤ 100,000) 开始，而奶牛在同一数轴上的点 K (0 ≤ K ≤ 100,000) 处。 Farmer John 有两种交通方式：步行和传送。

步行：FJ可以在一分钟内从任意点 X 移动到点 X - 1 或 X + 1
传送：FJ可以在一分钟内从任意点 X 移动到点 2 × X。

如果母牛没有意识到它的追赶，根本不动，农夫约翰需要多长时间才能找回它？

Input

Line 1: Two space-separated integers: N and K

仅一行,输入N (0 ≤ N ≤ 100,000) 和 K (0 ≤ K ≤ 100,000) .

Output

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

仅一行,输出FJ抓到奶牛所需分钟数.

Sample

Input

5 17

Output

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.

5->10->9->19->17,花费4元

bfs

static class TaskA {
        public static int[] step = new int[1000005];//统计步数
        public static boolean[] d = new boolean[1000005];//标记有无走过
        public static int bfs(int n,int k){
            Queue<Integer> q = new LinkedList();
            q.add(n);
            d[n] = true;
            while (!q.isEmpty()){
                int x = q.element();
                q.remove();
                for (int i = 0; i < 3; i++) {//有三种选择：向左一个单位、向右一个单位、向右到2*x
                    int next = 0;
                    if(i == 0)
                        next = x + 1;
                    if(i == 1)
                        next = x - 1;
                    if(i == 2)
                        next = x * 2;
                    if(next < 0 || next > 100000 || d[next]){//未超限并且下一个位置没有走过
                        continue;
                    }
                    q.add(next);
                    d[next] = true;
                    step[next] = step[x] + 1;
                    if(next == k){
                        return step[k];
                    }
                }
            }
            return -1;
        }
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            if(n >= k){//如果n大于k只能向左运动
                out.println(n - k);
            }else{
                out.println(bfs(n,k));
            }
        }
    }