UVA 10801 Lift Hopping

题意：给n个电梯，电梯可在m个层停下，每个电梯的速度不一样，给出起点0，终点Goal，求从起点到终点花的最少时间。

这道题实际是求最短路的问题，也是隐式图的搜索，与658 - It's not a Bug, it's a Feature!是同一类问题。我们设从0层开始，先找出从0层所能到达的各个层（状态），放入队列，然后从队列中找出用时最少的状态继续进行找，直至找到Goal层，结束或队列空结束，算法思想类似dijkstra。

程序代码：

#include<iostream> #include<string> #include<sstream> #include<queue> #include<vector> #include<cstring> #include<cstdio> #include<cmath> using namespace std; typedef struct { int tElev; int numElev; int fElev[110]; } Elev; typedef struct { int tim, flo, ele; } Node; struct cmp { bool operator()(const Node a, const Node b) { return a.tim > b.tim; } }; Elev nElev[10]; int nCase, Goal, sucess, tMin; int vis[10][110]; priority_queue<Node, vector<Node>, cmp> Q; int Judge(int i, int v) { for(int j = 0; j < nElev[i].numElev; j++) if(nElev[i].fElev[j] == v) return 1; return 0; } void bfs() { int flag; Node u, t; sucess = 0; memset(vis, 0, sizeof(vis)); while(!Q.empty()) Q.pop(); u.tim = 0; u.flo = 0; u.ele = -1; Q.push(u); while(!Q.empty()) { u = Q.top(); Q.pop(); if(u.flo == Goal) { sucess = 1; tMin = u.tim; return ; } if(vis[u.ele][u.flo]) continue; if(u.ele != -1) vis[u.ele][u.flo] = 1; for(int i = 0; i < nCase; i++) { if(Judge(i, u.flo)) { for(int j = 0; j < nElev[i].numElev; j++) { t.flo = nElev[i].fElev[j]; t.tim = u.tim + nElev[i].tElev * fabs(nElev[i].fElev[j] - u.flo); if(u.ele != i && u.ele != -1) t.tim += 60; t.ele = i; Q.push(t); } } } } } int main() { string input; //freopen("input.txt", "r", stdin); while(scanf("%d %d", &nCase, &Goal) == 2) { for(int i = 0; i < nCase; scanf("%d", &nElev[i++].tElev)); cin.ignore(); for(int i = 0; i < nCase; i++) { getline(cin, input); istringstream in(input); nElev[i].numElev = 0; while(in>>nElev[i].fElev[nElev[i].numElev]) nElev[i].numElev++; } bfs(); if(sucess) printf("%d/n", tMin); else printf("IMPOSSIBLE/n"); } return 0; }