Catch That Cow (bfs)

Catch That Cow
Time Limit: 2000 ms Memory Limit: 65536 KiB
Submit Statistic
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: 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

poj3278 có liên tiếp nhắc nhở đề mục thỉnh đi trước liên tiếp chỗ đệ trình trình tự, AC sau đệ trình đến SDUTOJ trung, để tuần tra lưu trữ.
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

#include <stdio.h>
#include <memory.h>
int vis[100001],quee[100001],num[100001];
void bfs(int n,int k0)
{
int k=0,kk=0,i,next;
memset(quee,0,sizeof(quee));
memset(num,0,sizeof(num));
quee[kk++]=n;
vis[n]=1;
num[n]=0;
while(k<kk)
{
int now=quee[k++];
for(i=1; i<=3; i++) // ba loại hành tẩu phương pháp
{
if(i==1) next=now-1;
if(i==2) next=now+1;
if(i==3) next=now*2;
if(next<0||next>100000)
{
continue;
}
if(!vis[next]) // sở hữu điểm quan trọng không bị phỏng vấn quá liền đều có thể đi đến
{
vis[next]=1;
num[next]=num[now]+1;
quee[kk++]=next;
}
if(next==k0)
{
printf( "%d\n",num[next]);
return;
}
}
}
}
int main()
{
int n,k;
scanf( "%d%d",&n,&k);
bfs(n,k);
return 0;
}

Biểu hiện tính toán quá trình

#include<iostream>
#include<queue>
usingnamespacestd;
intnum[100001],vis[100001];
intn,k;
structnode
{
intmethod,pre;
}p[100001];
voiddfs(intt)
{
if(t!=n)dfs(p[t].pre);
if(t==n)return;
if(p[t].method==1)
{
inta=p[t].pre;
cout<<a<<"+1"<<endl;
}
if(p[t].method==2)
{
inta=p[t].pre;
cout<<a<<"-1"<<endl;
}
if(p[t].method==3)
{
inta=p[t].pre;
cout<<a<<"*2"<<endl;
}
}
voidbfs(intn)
{
queue<int>qu;
num[n]=0;
qu.push(n);
while(!qu.empty())
{
intnow=qu.front();
qu.pop();
if(now==k)
{
cout<<num[now]<<endl;
dfs(k);
return;
}
for(inti=1;i<=3;i++)
{
intnext;
if(i==1)next=now+1;
if(i==2)next=now-1;
if(i==3)next=now*2;
if(next<0||next>100000)
continue;
if(!vis[next])
{
vis[next]=1;
p[next].pre=now;
p[next].method=i;
num[next]=num[now]+1;
qu.push(next);
}
}
}
}
intmain()
{
cin>>n>>k;
bfs(n);
return0;
}

// phát ra như sau
517
4
5-1
4*2
8*2
16+1