BestCoder Round #61 (div.2) HDU5523 Game
2015-11-01 00:11
183 查看
Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 164 Accepted Submission(s): 76
Problem Description
XY is playing a game:there are N pillar in a row,which numbered from 1 to n.Each pillar has a jewel.Now XY is standing on the S-th pillar and the exit is in the T-th pillar.XY can leave from the exit only after they get all the jewels.Each time XY can move
to adjacent pillar,or he can jump to boundary ( the first pillar or the N-th pillar) by using his superpower.However,he needs to follow a rule:if he left the pillar,he no can not get here anymore.In order to save his power,XY wants to use the minimum number
of superpower to pass the game.
Input
There are multiple test cases, no more than 1000 cases.
For each case,the line contains three integers:N,S and T.(1≤N≤10000,1≤S,T≤N)
Output
The output of each case will be a single integer on a line: the minimum number of using superpower or output -1 if he can't leave.
Sample Input
4 1 4 4 1 3
Sample Output
0 1
Source
BestCoder Round #61 (div.2)
出题人:
无解的情况只有起点和终点位置一样且N不为1。
终点和起点都在边界上答案为0,
如果起点在边界上或者起点终点相邻答案为1,
其他答案为2.
相关文章推荐
- 20151031知识整理
- 压缩SWF文件大小!减少40%体积!
- [angularjs之我见] AngularJs 的DI实现
- Leap Motion 使用OpenCV获取和显示图像
- HDU 5523 Game
- HDU5525(乘法原理)
- iOS 多线程: 正确认识 GCD 队列类型
- cf591B Rebranding
- HDU 5525 Product
- 我们在删除SQL Sever某个数据库表中数据的时候,希望ID重新从1开始,而不是紧跟着最后一个ID开始需要的命令
- 单例模式的实现
- 1.php 入门软件配置,基本的数据类型
- HDU 5521-Meeting(最短路)
- BestCoder Round #61 (div.2) HDU5522 Numbers
- QP之QEP原理
- cf591A Wizards' Duel
- C++(也许算是吧)+Linux 简易web服务器实现(with EPOLL&THREAD POLL)(1)
- NSString属性什么时候用copy,什么时候用strong?
- 格雷码与二进制码之间的转换
- c++数据生成器