hdu 1548
2015-07-13 11:23
399 查看
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14947 Accepted Submission(s): 5654
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
//这题是电梯up down,up层数i+ki down i-ki 注意边界 求a->b最少操作次数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14947 Accepted Submission(s): 5654
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
//这题是电梯up down,up层数i+ki down i-ki 注意边界 求a->b最少操作次数
#include <stdio.h> #include <string.h> #include <queue> using namespace std; int n,start,stop; int p[210]; int vis[210]; struct Node { int floor; int step; }; int bfs(int flo) { queue <Node> q; memset(vis,0,sizeof(vis)); Node a; a.floor=flo,a.step=0; q.push(a); while(!q.empty()) { Node b=q.front(); q.pop(); vis[b.floor]=1; if(b.floor==stop) return b.step; for(int i=0;i<2;i++) //0 up 1 down { Node c=b; if(i==0) c.floor=c.floor+p[c.floor]; else c.floor=c.floor-p[c.floor]; if(!vis[c.floor]&&c.floor>=1&&c.floor<=n) { c.step++; q.push(c); vis[c.floor]=1; } } } return -1; } int main() { while(~scanf("%d",&n)&&n) { scanf("%d%d",&start,&stop); for(int i=1;i<=n;i++) scanf("%d",&p[i]); printf("%d\n",bfs(start)); } return 0; }
相关文章推荐
- svn 和 git的简单使用
- storyboard 和xib的本地化的应用
- DEV-aspxgridview中的editform中上传的方法
- Linux内核学习笔记——内核内存管理方式
- MQTT协议笔记之mqtt.io项目TCP协议支持
- #笔记#圣思园 JavaWeb 第32讲——Servlet多线程同步问题,Cookie
- 关于__block和__weak的详解
- GRE写作必备句型
- system()函数
- 常用的eclipse快捷键-也适合sts
- Coloring Android Apps with Palette(译文)
- 成都优步uber司机第三组奖励政策
- 与另一个进程被死锁在 锁 | 通信缓冲区 资源上,并且已被选作死锁牺牲品。请重新运行该事务。
- MQTT协议笔记之订阅
- Nmap 6.49 Beta4 发布了
- 如何取得一定范围内的随机数
- poj 1013——用运算模拟变换操作
- How to install g++-4.6-arm-linux-gnueabihf
- MySQL的mysql_insert_id和LAST_INSERT_ID
- [NSNull rangeOfCharacterFromSet:]错误提示;