Catch that cow bfs + dfs

最新推荐文章于 2020-03-20 22:28:17 发布

raptor.

最新推荐文章于 2020-03-20 22:28:17 发布

阅读量2.2k

点赞数 1

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

本文链接：https://blog.csdn.net/C18854805113/article/details/76557719

版权

搜索专栏收录该内容

22 篇文章 0 订阅

订阅专栏

Catch That Cow

Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 142 Accepted Submission(s) : 35

Problem 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: <i>N</i> and <i>K</i>

Output

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

Sample Input

Sample Output

没错又是这道题搜索的题好像没什么好说的看能看懂自己写又写不大出来写了个dfs一直RE

long long dfs(int n,int m)
{
if(n>=m)
return n-m;
if(m%2==0)
{
if(m==2*n)
return 1;
else if(2*n<m)
return dfs(2*n,m)+1;
else return min(2*n+1-m,m-n);
}
else return min(dfs(n+1,m),dfs(n-1,m))+1;
}

这样数据越来越大越来越慢

把起始位置之后才解决掉让牛捉人一路搜到底

对于bfs 队列的应用是我比较头疼的地方

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int vis[100001];
int n,m;
/*long long  dfs(int n,int m)
{
    if(n>=m)
    return n-m;
    if(m%2==0)
    {
        if(m==2*n)
            return 1;
        else if(2*n<m)
            return dfs(n,m/2)+1;
        else return min(n+1-m/2,m-n);
    }
    else return min(dfs(n,m-1),dfs(n,m+1))+1;
    }*/
struct node
{
     int x;
     int step;
};
 int bfs()
 {
     int i;
     queue<node>Q;
     while(!Q.empty())Q.pop();
     node now,next;
     now.x=n;
     now.step=0;
     vis[now.x]=1;
     Q.push(now);
     while(!Q.empty())
     {
        now=Q.front();
        Q.pop();
        for(i=0;i<3;i++){
             if(i==0)
                next.x=now.x-1;
             else if(i==1)
                next.x=now.x+1;
             else
                next.x=2*now.x;
             next.step=1+now.step;
             if(next.x==m)
                 return next.step;
             if(!vis[next.x]&&next.x>=0&&next.x<=100000)
             {
                 vis[next.x]=1;
                 Q.push(next);
             }
         }
     }
     return 0;
 }
 int main()
 {
     int ans;
     while(cin>>n>>m)
     {
         memset(vis,0,sizeof(vis));
         if(n>=m)cout<<n-m<<endl;
         else cout<<bfs()<<endl;
         }
     return 0;
 }