Poj 3278 Catch That Cow (broad search), poj3278

Source: Internet
Author: User

Poj 3278 Catch That Cow (broad search), poj3278

Catch That Cow
Time Limit:2000 MS   Memory Limit:65536 K
Total Submissions:45087   Accepted:14116

Description

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 ≤N≤ 100,000) on a number line and the cow is at a pointK(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 pointXTo the pointsX-1 orX+ 1 in a single minute
* Teleporting: FJ can move from any pointXTo the point 2 ×XIn 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:NAndK

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

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

The meaning of the question tells you to calculate the movement of the shortest steps from n to k at two points n k to n + 1 or n-1 or n * 2;

Search for the shortest path in three directions

#include<iostream>#include<cstdio>#include<cstring>const int M=200005;using namespace std;typedef class{    public:    int x;    int step;}wz;wz q[M];int vis[M];int n,k;int bfs(){    int front=0,rear=0;    q[rear].x=n;    q[front].x=n;    q[rear++].step=0;    vis[n]=1;    while(front<rear)    {       wz w=q[front++];        if(w.x==k)            return w.step;        if(w.x-1>=0&&!vis[w.x-1])        {            vis[w.x-1]=1;            q[rear].x=w.x-1;            q[rear++].step=w.step+1;        }        if(w.x+1<=k&&!vis[w.x+1])        {            vis[w.x+1]=1;            q[rear].x=w.x+1;            q[rear++].step=w.step+1;        }        if(w.x<=k&&!vis[2*w.x])        {            vis[2*w.x]=1;            q[rear].x=w.x*2;            q[rear++].step=w.step+1;        }    }}int main(){    int i;    while(cin>>n>>k)    {        memset(vis,0,sizeof vis);          cout<<bfs()<<endl;    }    return 0;}



Why is the POJ3278 breadth-first search always "runningtime error "?

The array is out of bounds. Patpat .. Check it by yourself. This mistake is already a blessing on you.
 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.