A strange lift

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 56 Accepted Submission(s) : 15

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

用广搜，注意标记

#include<cstdio>
#include<cstring>
#include<queue>
#include<cstdlib>
using namespace std;
int map[205];
int floor[205];
int n;
struct Node
{int x,step;
}info;
bool f(int x)
{if(x<1||x>n){return false;}return true;
}
int bfs(int sx,int sy)
{info.x=sx,info.step=0;queue<Node>q;q.push(info);while(!q.empty()){Node pos=q.front();q.pop();if(pos.x==sy){return pos.step;}info.x=pos.x+floor[pos.x];if(f(info.x)&&!map[info.x]){map[info.x]=1;                //标记info.step=pos.step+1;q.push(info);}info.x=pos.x-floor[pos.x];if(f(info.x)&&!map[info.x]){map[info.x]=1;                          //标记info.step=pos.step+1;q.push(info);}}return -1;
}
int main()
{int A,B;while(scanf("%d",&n)!=EOF&&n){memset(map,0,sizeof(map));scanf("%d%d",&A,&B);map[A]=1;for(int i=1;i<=n;i++){scanf("%d",&floor[i]);}printf("%d\n",bfs(A,B));}return 0;
}

转载于:https://www.cnblogs.com/gantaiyuan/p/3211963.html

hdu 1548 A strange lift相关推荐

hdu 1548 A strange lift （BFS）
解题思路:BFS 注意点:每次查询结束后,要清空队列 #include <iostream> #include <queue> #include <cstring> ...
A strange lift HDU - 1548（基础广搜）
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 ...
HDU A strange lift
A strange lift Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Tota ...
SDAU 搜索专题 13 A strange lift
1:问题描述 Problem Description There is a strange lift.The lift can stop can at every floor as you want, ...
HDU1548：A strange lift(Dijkstra或BFS)
题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=1548 题意:电梯每层有一个数,例如第n层有个数k, 那么这一层只能上k层或下k层,但是不能低于一层或高 ...
poj 1564 Sum It Up | zoj 1711 | hdu 1548 (dfs + 剪枝 or 判重)
Sum It Up Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Sub ...
【HDU - 2899】 Strange fuction（二分或三分，求导）
题干: Now, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100) Can you fi ...
hdu 1548 升降梯
题目大意:有一个升降机,它有两个按钮UP和DOWN,给你一些数i表示层数,并且每层对应的Ki,如果按UP按钮,会从第i层升到第i+Ki层:如果按了DOWN则会从第i层降到第i-Ki层:并规定能到的层数 ...
杭电OJ分类题目（4）-Graph
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(4) HDU Graph Theory - U ...

hdu 1548 A strange lift