HDU 1548 A strange lift
来源:互联网 发布:伤害跳跃网络吧 编辑:程序博客网 时间:2024/05/20 06:51
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13222 Accepted Submission(s): 5065
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"?
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.
5 1 53 3 1 2 50
3
刚开始一直提交双向图的dijkstra 错了!#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 99999
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int edge[205][205];
int lowcost[205],vis[205];
int n,a,b;
void Dj(int a)
{
cle(vis);
vis[a]=1;
for(int i=1;i<=n;i++)
lowcost[i]=edge[a][i];
int Min,k;
while(1)
{
Min=INF;
for(int i=1;i<=n;i++)
if(lowcost[i]<Min&&!vis[i])
{
k=i;Min=lowcost[i];
}
if(Min==INF)break;
vis[k]=1;
for(int j=1;j<=n;j++)
{
if(lowcost[j]>lowcost[k]+edge[k][j])
lowcost[j]=lowcost[k]+edge[k][j];
}
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(cin>>n&&n)
{
cin>>a>>b;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
edge[i][j]=INF;
// edge[j][i]=INF;
}
edge[i][i]=0;
}
int ki;
for(int i=1;i<=n;i++)
{
cin>>ki;
if(i+ki<=n)
{
if(edge[i][ki+i]>1) edge[i][i+ki]=1;
//if(edge[i+ki][i]>1)edge[i+ki][i]=1;
}
if(i-ki>=1)
{
if(edge[i][i-ki]>1)edge[i][i-ki]=1;
//if(edge[i-ki][i]>1)edge[i-ki][i]=1;
}
}
Dj(a);
if(lowcost[b]!=INF)cout<<lowcost[b]<<endl;
else cout<<-1<<endl;
}
return 0;
}
- A strange lift hdu 1548
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- Hdu-1548 A strange lift
- HDU 1548 A strange lift
- HDU-1548-A strange lift
- hdu 1548 A strange lift
- HDU 1548-A strange lift
- HDU 1548 A strange lift
- hdu 1548 A strange lift
- hdu 1548 A strange lift
- HDU 1548 A strange lift
- hdu 1548 a strange lift
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- hdu 1548 A strange lift
- hdu 1548 A strange lift
- HDU 2923 Einbahnstrasse (Flord)
- HDU 2112 Today (Dijkstra)
- HDU 3790 最短路径问题
- 最短路小结--模板
- POJ 1125 Stockbroker Grapevine
- HDU 1548 A strange lift
- Bellman-ford模板
- HDU 1317 XYZZY
- HDU 1535 Invitation Cards
- HDU 3339 In Action
- IOS获取系统通讯录联系人信息
- HDU 2647 Reward(拓扑排序)
- 栈的应用--括号匹配的检验(C++)
- HDU 5055 Bob and math problem