Catch That Cow
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6552 Accepted Submission(s): 2070
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?
* 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
4HintThe 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,坑爹的是vis没初始化,poj上居然过了,无语。
另外,网上的题解说要剪枝,不剪照样0ms。
代码:
#include<cstdio>
#include<cstring>
int q[100005];
int vis[100005];
int dis[100005];
int bfs(int s,int v)
{
memset(vis,0,sizeof(vis));
int front=0,rear=1;
dis[s]=0;
vis[s]=1;
q[0]=s;
if(s==v)
return 0;
while(front<rear)
{
int temp=q[front++];
if(temp-1>=0&&!vis[temp-1])
{
dis[temp-1]=dis[temp]+1;
//printf("%d %d\n",temp-1,dis[temp-1]);
if(temp-1==v)
return dis[temp-1];
vis[temp-1]=1;
q[rear++]=temp-1;
}
if(temp+1<=100000&&!vis[temp+1])
{
dis[temp+1]=dis[temp]+1;
//printf("%d %d\n",temp+1,dis[temp+1]);
if(temp+1==v)
return dis[temp+1];
vis[temp+1]=1;
q[rear++]=temp+1;
}
if(temp*2<=100000&&!vis[temp*2])
{
dis[temp*2]=dis[temp]+1;
//printf("%d %d\n",temp*2,dis[temp*2]);
if(temp*2==v)
return dis[temp*2];
vis[temp*2]=1;
q[rear++]=temp*2;
}
}
}
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
{
int ans=bfs(a,b);
printf("%d\n",ans);
}
return 0;
}