hud 1548 A strange lift
来源:互联网 发布:日韩男士帽子 知乎 编辑:程序博客网 时间:2024/05/20 17:42
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20288 Accepted Submission(s): 7480
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"?
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.
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 53 3 1 2 50
Sample Output
3
#include<stdio.h>#include<iostream>#include<queue>#include<string.h>const int inf=9999999;using namespace std;int n,a,b;int k[220],book[220],dis[220],e[220][220];void dijkstra(){ int i,j; memset(book,0,sizeof(book)); book[a]=1; memset(dis,0,sizeof(dis)); for(i=1; i<=n; i++) dis[i]=e[a][i]; dis[a]=0; int min,u; for(i=1; i<=n-1; i++) { min=inf+1; u=0; for(j=1; j<=n; j++) { if(book[j]==0&&dis[j]<min) { min=dis[j]; u=j; } }// if(min==inf)// break;// if(u==0)// break; book[u]=1; for(int v=1; v<=n; v++) { if(e[u][v]<inf&&book[v]==0&&dis[v]>dis[u]+e[u][v]) { dis[v]=dis[u]+e[u][v]; } } }}int main(){ while(~scanf("%d",&n),n) { int i,j; scanf("%d%d",&a,&b); for(i=1;i<=n;i++) for(j=1;j<=n;j++) { if(i==j) e[i][j]=0; else e[i][j]=inf; } for(i=1;i<=n;i++) { scanf("%d",&k[i]); if(i-k[i]>=1) e[i][i-k[i]]=1; if(i+k[i]<=n) e[i][i+k[i]]=1; } dijkstra(); if(dis[b]<inf) printf("%d\n",dis[b]); else printf("-1\n"); } return 0;}
0 0
- hud 1548 A strange lift
- hud 1548 A strange lift
- A strange lift hdu 1548
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- Hdu-1548 A strange lift
- HDU 1548 A strange lift
- HDU-1548-A strange lift
- hdu 1548 A strange lift
- HDU 1548-A strange lift
- HDU 1548 A strange lift
- hdu 1548 A strange lift
- hdu 1548 A strange lift
- HDU 1548 A strange lift
- hdu 1548 a strange lift
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- sr/lib/gcc/x86_64-linux-gnu/4.4.5/../../../../lib/crt1.o: In function `_start'问题解决
- SQLite基础
- Unable to satisfy the following requirements解决方案
- 抽空写的网站抓图片c++,增加了简单的多线程和互斥
- JNI官方规范中文版——在程序中集成JVM需要注意的JNI特征
- hud 1548 A strange lift
- Android属性动画——实现布局的下拉展开
- 支持向量机 SVM 讲义(五)
- 介绍Json
- oracle笔记
- java多线程基础(6)-调度方式之暂停当前线程方式5-等待(wait)
- leetcode 332. Reconstruct Itinerary
- Hibernate框架笔记
- JNI官方规范中文版——如何在JNI中使用己有的C/C++库