HDOJ 1548 A strange lift
来源:互联网 发布:贵州省大数据培训平台 编辑:程序博客网 时间:2024/06/07 03:37
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"?
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<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\n",d[e]); } return 0;}
0 0
- hdoj 1548 A strange lift
- HDOJ 1548 A strange lift
- HDOJ A strange lift
- hdoj 1548 A strange lift(bfs)
- HDOJ 1548 A strange lift (bfs)
- HDOJ 1548 A strange lift (BFS)
- hdoj 1548 A strange lift (BFS)
- HDOJ 1548 A strange lift (BFS)
- HDU/HDOJ 1548 A strange lift BFS,DFS
- (BFS)A strange lift--HDOJ
- 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
- OPENGL ES资源帖子
- timer.hpp
- JAVA进阶路线图
- HDU 2042 不容易系列之二(水~)
- Android自学笔记之 MultiAutoTextView的功能、特殊属性、用法(与AutoTextView的区别和近似)
- HDOJ 1548 A strange lift
- Android eventbus开源框架(模仿)
- D、作弊揭发者-------(计蒜之道 测试赛)
- maven构建多模块的web项目
- HDOJ 1869 六度分离
- Android & IOS视频录制技术方案
- solr5.2.1环境搭建
- Java Integer和int类型变量的两两相等性比较
- Kylin任务调度模块