A strange lift
2016-04-03 14:21
295 查看
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 题意:电梯问题,给出N层楼,在每层楼移动的层数,计算从A层到B层最少的移动次数,如果不能到达输出-1; 解题思路:广度优先搜索; 感悟:比较正常的广搜(不用剪枝,^0^),但是用floor,和next命名的时候莫名其妙的CE了 代码: #include
#include
#include
#include
#include
#include
#define maxn 205
using namespace std;
int A,B,n,flo,a,f;
int k[maxn],t[maxn];
bool visit[maxn];
int check(int a)
{
if(a<0||a>n||visit[a])
return 1;
else
return 0;
}
int bfs(int A,int B)
{
queueQ;
Q.push(A);
visit[A]=true;
while(!Q.empty())
{
flo=Q.front();
Q.pop();
if(flo==B)
{
f=1;
return t[flo];
}
//上楼
a=flo+k[flo];
if(!check(a))
{
Q.push(a);
t[a]=t[flo]+1;
visit[a]=true;
}
//下楼
a=flo-k[flo];
if(!check(a))
{
Q.push(a);
t[a]=t[flo]+1;
visit[a]=true;
}
}
}
int main()
{
//freopen("in.txt", "r", stdin);
while(~scanf("%d",&n)&&n)
{
memset(visit,false,sizeof(visit));
memset(t,0,sizeof(t));
f=0;
scanf("%d%d",&A,&B);
flo=A;
for(int i=1;i<=n;i++)
scanf("%d",&k[i]);
bfs(A,B);
if(f)
printf("%d\n",t[B]);
else
printf("-1\n");
}
}
相关文章推荐
- 经典算法——二进制中1的个数
- lintcode-medium-Palindrome Linked List
- 使用Oracle11g自带的SQL Developer报错:Unable to find a Java Virtual Machine
- PAT乙级1005-德才论
- 动态规划之Palindrome
- IP协议及IP数据报解析
- 演示程序之打游戏 -- 慕司板IAP15
- 多分类问题中混淆矩阵(Confusion Matrix)的Matlab画法
- 【java开发系列】— JDOM创建、改动、删除、读取XML文件
- java项目日志
- Cocos2d-x 3.9教程:1.场景的切换
- C++ Standard-Library Random Numbers
- 三星Mega 6.3(i9200)删除kingroot
- 在线编程--用递归函数和栈操作逆序栈
- 适配器模式
- sourceinsight显示中文乱码解决
- 物联网用到自己的新家里:改造家里的灯光照明系统
- eclipse xdebug调试
- service builder不会自动建表/更新字段
- 【简单DP】 数字三角形