zoukankan      html  css  js  c++  java
  • HDOJ 1548 A strange lift

    A strange lift

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


    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<vector>
    #include<cstdio>
    using namespace std;
    const int maxn=205,inf=1<<29;
    int n,m,s,e;
    int vis[maxn],d[maxn],Map[maxn][maxn];
    void Dijkstra()
    {
        fill(vis,vis+maxn,0);
        fill(d,d+maxn,inf);
        d[s]=0;
        while(1)
        {
            int v=-1;
            for(int i=1;i<=n;i++)
                if(!vis[i]&&(v==-1||d[v]>d[i])) v=i;
            if(v==-1) break;
            vis[v]=1;
            for(int i=1;i<=n;i++) d[i]=min(d[i],d[v]+Map[v][i]);
        }
    }
    int main()
    {
        while(cin>>n,n)
        {
            fill(&Map[0][0],&Map[maxn][0],inf);
            cin>>s>>e;
            for(int i=1;i<=n;i++)
            {
                int w;
                cin>>w;
                if(i+w<=n) Map[i][i+w]=1;
                if(i-w>=1) Map[i][i-w]=1;
            }
            Dijkstra();
            d[e]=d[e]==inf?-1:d[e];
            printf("%d
    ",d[e]);
        }
        return 0;
    }

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    分布式缓存memcached介绍,win7环境安装,常用命令set,get,delete,stats, java访问
    【转】移除HTML5 input在type="number"时的上下小箭头
    ES6特性的两点分析
    hexo_config.yml配置内容
    JS性能分析(测试代码运行时间)
    github修改仓库项目的语言类型
    JavaScript回文数
    JS设计模式
    webpac入门
    居中问题
  • 原文地址:https://www.cnblogs.com/Thereisnospon/p/4771093.html
Copyright © 2011-2022 走看看