hdu1548 A strange lift(bfs)
Posted 甄情
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu1548 A strange lift(bfs)相关的知识,希望对你有一定的参考价值。
C - A strange lift
Crawling in process...
Crawling failed
Time Limit:1000MS
Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Appoint description:
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 5 3 3 1 2 5 0
Sample Output
3
#include <stdio.h> #include <queue> #include <string.h> using namespace std; int st,ed,n; int a[205]; bool vis[205]; struct node { int pos; int cost; friend bool operator<(node x,node y) { return x.cost>y.cost; } }; int bfs() { priority_queue<node>s; while(!s.empty()) s.pop(); node temp,temp1; temp.pos=st,temp.cost=0; s.push(temp); while(!s.empty()) { temp=temp1=s.top();s.pop(); if(temp.pos==ed) return temp.cost; if(vis[temp.pos]) continue; vis[temp.pos]=true; temp.pos+=a[temp.pos]; temp.cost++; if(temp.pos<=n) s.push(temp); temp=temp1; temp.pos-=a[temp.pos]; temp.cost++; if(temp.pos>=1) s.push(temp); } return -1; } int main() { while(~scanf("%d",&n)&&n) { memset(vis,0,sizeof(vis)); scanf("%d %d",&st,&ed); for(int i=1;i<=n;i++) scanf("%d",&a[i]); printf("%d\n",bfs()); } return 0; }
以上是关于hdu1548 A strange lift(bfs)的主要内容,如果未能解决你的问题,请参考以下文章
HDU 1548 A strange lift (暴力搜索)