POJ 3278 Catch That Cow

最新推荐文章于 2024-09-04 11:33:10 发布

ACM2272902662

最新推荐文章于 2024-09-04 11:33:10 发布

阅读量481

点赞数 1

分类专栏： POJ

本文链接：https://blog.csdn.net/yongxingao/article/details/8228930

版权

POJ 专栏收录该内容

182 篇文章 0 订阅

订阅专栏

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 33045		Accepted: 10160

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

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.

Source

USACO 2007 Open Silver

考察点:BFS

#include <iostream>
#include <cstring>
using namespace std;
int status[100010];
int queue[100010];
int step[100010];
int main()
{
    void bfs(int n,int k);
    int i,j,n,m,s,t;
    int k;
    cin>>n>>k;
    memset(step,0,sizeof(step));
    memset(status,0,sizeof(status));
    bfs(n,k);
    cout<<step[k]<<endl;
    return 0;
}
void bfs(int n,int k)
{
    int base,top,i,j;
    int xend,x;
    base=top=0;
    queue[top++]=n;
    step[n]=0;
    status[n]=1;
    while(base<top)
    {
        x=queue[base]; base+=1;
        for(i=0;i<=2;i++)
        {
            if(i==0)
            {
                xend=x-1;
            }else if(i==1)
            {
                xend=x+1;
            }else
            {
                xend=2*x;
            }
            if(xend>=0&&xend<=100000&&status[xend]==0)
            {
                status[xend]=1;
                step[xend]=step[x]+1;
                queue[top++]=xend;
                if(xend==k)
                {
                    break;
                }
            }
        }
        if(i!=3)
        {
            break;
        }
    }
}