zoukankan      html  css  js  c++  java
  • Hdu 1548 A strange lift(BFS)


    A strange lift

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


    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 is on floor A,and you want to go to floor B,how many times at least he havt 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
     
    
    
    Recommend
    8600
    //广搜,可以看成是图的可达最短,可达的话、次数累加,不可达就输-1;


    #include
    <iostream> #include <stdio.h> #include <algorithm> #include <queue> #include <string.h> using namespace std; int a[203]; int N,A,B; int r[203]; int b[203]; int bf() { queue<int>Q; Q.push(A); int i; for(i=1;i<=N;i++) r[i]=10000; memset(b,0,sizeof(b)); r[A]=0; int t=A-a[A]; if(t>=1) { Q.push(t); r[t]=r[A]+1; } t=A+a[A]; if(t<=N) { Q.push(t); r[t]=r[A]+1; } b[A]=1; while(!Q.empty()) { t=Q.front();//printf(" t=%d ",t); if(t==B) return r[t]; Q.pop(); int temp=t-a[t]; if(temp>=1&&!b[temp]) { b[temp]=1; Q.push(temp); r[temp]=r[temp]<r[t]+1?r[temp]:r[t]+1; } temp=t+a[t]; if(temp<=N&&!b[temp]) { b[temp]=1; Q.push(temp); r[temp]=r[temp]<r[t]+1?r[temp]:r[t]+1; } } return -1; } int main() { int i; while(scanf("%d",&N),N) { scanf("%d%d",&A,&B); for(i=1;i<=N;i++) scanf("%d",&a[i]); printf("%d\n",bf()); } return 0; }
  • 相关阅读:
    FastAdmin 开发时对数据库进行版本管理 (非 think-migration)
    使用 mysqldump 备份时的一些参数
    软件开源后可能遇到的问题
    基于 FastAdmin 开发后台流程 (持续更新)
    FastAdmin 怎么把模块设置默认的首页?
    FastAdmin 离线安装 ueditor 出现 rule 错误
    Windows nginx php cgi-fcgi 配置 xdebug
    FastAdmin 插件刷新缓存出现 200 红色提示框解决 always_populate_raw_post_data
    参与开源项目给我带来了什么?
    为什么要求将问题发到社区?
  • 原文地址:https://www.cnblogs.com/372465774y/p/2578585.html
Copyright © 2011-2022 走看看