zoukankan      html  css  js  c++  java
  • HDU 1548 A strange lift 搜索

    A strange lift

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 11341    Accepted Submission(s): 4289


    Problem Description
    There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button "UP" , you will go up Ki floor,i.e,you will go to the i+Ki th floor,as the same, if you press the button "DOWN" , you will go down Ki floor,i.e,you will go to the i-Ki th floor. Of course, the lift can't go up high than N,and can't go down lower than 1. For example, there is a buliding with 5 floors, and k1 = 3, k2 = 3,k3 = 1,k4 = 2, k5 = 5.Begining from the 1 st floor,you can press the button "UP", and you'll go up to the 4 th floor,and if you press the button "DOWN", the lift can't do it, because it can't go down to the -2 th floor,as you know ,the -2 th floor isn't exist.
    Here comes the problem: when you are on floor A,and you want to go to floor B,how many times at least he has to press the button "UP" or "DOWN"?
     

    Input
    The input consists of several test cases.,Each test case contains two lines.
    The first line contains three integers N ,A,B( 1 <= N,A,B <= 200) which describe above,The second line consist N integers k1,k2,....kn.
    A single 0 indicate the end of the input.
     

    Output
    For each case of the input output a interger, the least times you have to press the button when you on floor A,and you want to go to floor B.If you can't reach floor B,printf "-1".
     

    Sample Input
    5 1 5 3 3 1 2 5 0
     

    Sample Output
    3


    #include<iostream>
    #include<cstring>
    #include<queue>
    using namespace std;
    
    #define N 205
    int v[N],c[N];
    int n,a,b,t;
    
    struct node 
    {
        int i,time;
    };
    
    void bfs(int x)
    {
        node now,tmp;
        queue<node>  q;
        now.i=x,now.time=0;
        memset(v,0,sizeof(v));
        q.push(now);
        while(!q.empty())
        {
            now=q.front();
            q.pop();
            if(now.i==b)
            {
                t=0;
                cout<<now.time<<endl;
                return ;
            }
            for(int k=0;k<2;k++)
            {
                if(k==0)   tmp.i=now.i+c[now.i];
                if(k==1)   tmp.i=now.i-c[now.i];
                if(tmp.i>0&&tmp.i<=200&&!v[tmp.i])
                {
                    v[tmp.i]=1;
                    tmp.time=now.time + 1;
                    q.push(tmp);
                }
            }
        }
    }
    
    int main()
    {
        while(cin>>n)
        {
            if(n==0)  break;
            cin>>a>>b;
            for(int k=1;k<=n;k++)
                cin>>c[k];
            t=1;
            bfs(a);
            if(t)  cout<<-1<<endl;
        }
        return 0;
    }


  • 相关阅读:
    欧几里得算法&&扩展欧几里得算法
    POJ-1006 Biorhythms (生物节律)
    第3周实践项目7 删除链表元素最大值
    第3周实践项目1 顺序表的基本运算
    第三周项目4(2)-顺序表应用 将所有奇数移到所有偶数前面
    第3周实践项目5 -顺序表的应用 拆分单链表
    SDUT-2144 图结构练习——最小生成树
    SDUT-3362 数据结构实验之图论六:村村通公路
    Codeforces Round #616 (Div. 2)题解
    1.29 educational round 81
  • 原文地址:https://www.cnblogs.com/yxwkf/p/5286189.html
Copyright © 2011-2022 走看看