HDU 1548 A strange lift

电梯每层上有两个按钮 up，down 对应一个数ki。

若按 up 则上升 ki 层， down则下降 ki 层。

求how many times at least he have to press the button "UP" or "DOWN"?。

 

只是统计按键的次数，按一次，count 增一， 因此是无权图，简单bfs即可。

 

00445101

2010-07-01 23:40:54

Accepted

1007

31 MS

276 KB

Visual C++

Slave_wc

 

#include <cstdio> #include <cstring> #include <queue> using namespace std; #define MAXN 220 int k[MAXN][2]; bool hash[MAXN]; struct Dij { int id; int count; }; Dij now, next; void Bfs(int st, int ed, int n) { memset(hash, false, sizeof(hash)); queue<Dij> Q; now.id = st; now.count = 0; hash[st] = true; Q.push(now); while (!Q.empty()) { now = Q.front(); Q.pop(); if (now.id == ed) { printf("%d/n", now.count); return ; } for (int j = 0; j < 2; j++) { next = now; next.id += k[now.id][j]; next.count++; if (next.id < 1 || next.id > n || hash[next.id]) { continue; } hash[now.id] = true; Q.push(next); } } puts("-1"); } int main() { int n, st, ed, i, a; while (scanf("%d", &n) != EOF) { if (n == 0) { break; } scanf("%d %d", &st, &ed); for (i = 1; i <= n; i++) { scanf("%d", &a); k[i][0] = a; k[i][1] = -a; } Bfs(st, ed, n); } return 0; }