HDU 1548

来源:互联网 发布:fastjson解析嵌套数组 编辑:程序博客网 时间:2024/06/16 18:10

2017.12.6对BFS的系列练习第一题。
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1548
A strange lift

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

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

题目讲的是一台奇怪的电梯,只有上下键,上楼或是下楼的层数由该层的数字ki决定。所以相当于一条线上的BFS,+1/-1作为方向就好了。
AC代码如下:

#include <cstdio>#include <cstring>#include <queue>using namespace std;const int maxn = 205;int floor[maxn];int vis[maxn];int n;int a, b;int df[2] = {1, -1};struct Node{    int f;     int step;};queue<Node> lift;int BFS(){    while(!lift.empty())    lift.pop();    memset(vis, 0, sizeof(vis));    Node beg;    beg.f = a, beg.step = 0;    lift.push(beg);    vis[beg.f] = 1;    while(!lift.empty())    {        Node cur = lift.front();        lift.pop();        if(cur.f == b)    return cur.step;        for(int i = 0; i < 2; i++)        {            Node next;            next.f = cur.f + df[i] * floor[cur.f];            if(next.f < 1 || next.f > n)    continue;            if(vis[next.f])    continue;            next.step = cur.step + 1;            if(next.f == b)    return next.step;            vis[next.f] = 1;            lift.push(next);        }    }    return -1;    }int main(){    while(scanf("%d", &n) != EOF && n)    {        scanf("%d %d", &a, &b);        for(int i = 1; i <= n; i++)            scanf("%d", &floor[i]);        printf("%d\n", BFS());    }    return 0;}