BZOJ 1646[Usaco2007 Open]Catch That Cow 抓住那只牛 双向bfs版

[Usaco2007 Open]Catch That Cow 抓住那只牛

Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 1157  Solved: 557
[Submit][Status][Discuss]

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?

    农夫约翰被通知，他的一只奶牛逃逸了！所以他决定，马上幽发，尽快把那只奶牛抓回来．

    他们都站在数轴上．约翰在N(O≤N≤100000)处，奶牛在K(O≤K≤100000)处．约翰有

两种办法移动，步行和瞬移：步行每秒种可以让约翰从z处走到x+l或x-l处；而瞬移则可让他在1秒内从x处消失，在2x处出现．然而那只逃逸的奶牛，悲剧地没有发现自己的处境多么糟糕，正站在那儿一动不动．

    那么，约翰需要多少时间抓住那只牛呢？

Input

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

    仅有两个整数N和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
Farmer John starts at point 5 and the fugitive cow is at point 17.

Sample Output

4

OUTPUT DETAILS:

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.

很明显是一个bfs

极有逼格的B.J.当然要用极有逼格的双向bfs（痛苦地调了好久，但是得到一个很高的rank，还是值的，蛤蛤蛤）

还有一些小细节要注意，看代码吧

#include<iostream> 
#include<cstdio> 
#include<cmath> 
#include<cstring> 
#include<cstdlib> 
#include<algorithm> 
#include<iomanip> 
#include<map> 
#include<set> 
#include<vector> 
#include<queue> 
using namespace std; 
inline int read() 
{ 
    int x=0,f=1;char ch=getchar(); 
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} 
    while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();} 
    return x*f; 
} 
const int N=1e5+100; 
bool mark[N<<1],flag=1; 
int n,m,q[N<<2],dis[N<<1],ans; 
int main() 
{ 
    n=read();m=read();  if(n>m){printf("%d\n",n-m);return 0;} 
    int hd=0,tl=2; 
    q[++hd]=n;mark[n]=0;q[tl++]=m;mark[m]=1; 
    dis[1]=dis[2]=0; 
    while(hd<tl) 
    { 
        int t=q[hd];hd++; 
        if(!mark[t]) 
        { 
            if(t-1>=0&&!dis[t-1]&&!mark[t-1]) 
            {dis[t-1]=dis[t]+1;mark[t-1]=0;q[tl++]=t-1;} 
            else if(t-1>=0&&mark[t-1]) 
            {ans=dis[t]+dis[t-1]+1;break;} 
            if(t+1<=n+m&&!dis[t+1]&&!mark[t+1]) 
            {dis[t+1]=dis[t]+1;mark[t+1]=0;q[tl++]=t+1;} 
            else if(t+1<=n+m&&mark[t+1]) 
            {ans=dis[t]+dis[t+1]+1;break;} 
            if(t<<1<=n+m&&!dis[t<<1]&&!mark[t<<1]) 
            {dis[t<<1]=dis[t]+1;mark[t<<1]=0;q[tl++]=t<<1;} 
            else if(t<<1<=n+m&&mark[t<<1]) 
            {ans=dis[t]+dis[t<<1]+1;break;} 
        } 
        else
        { 
            if(t-1>=0&&!dis[t-1]) 
            {dis[t-1]=dis[t]+1;mark[t-1]=1;q[tl++]=t-1;} 
            else if(t-1>=0&&!mark[t-1]) 
            {ans=dis[t]+dis[t-1]+1;break;} 
            if(t+1<=n+m&&!dis[t+1]) 
            {dis[t+1]=dis[t]+1;mark[t+1]=1;q[tl++]=t+1;} 
            else if(t+1<=n+m&&!mark[t+1]) 
            {ans=dis[t]+dis[t+1]+1;break;} 
            if(!(t&1)&&flag) 
            { 
                if(t==0)flag=0; 
                if(!dis[t>>1]) 
                {dis[t>>1]=dis[t]+1;mark[t>>1]=1;q[tl++]=t>>1;} 
                else if(!mark[t>>1]) 
                {ans=dis[t]+dis[t>>1]+1;break;} 
            } 
        } 
    } 
    printf("%d\n",ans); 
}