UVA 10801 Lift Hopping (最短路)

分析：题目规定了换乘的时间，所以这题就与根据时间的流逝没有关系的，变成了一个最短路问题，每个状态有两个属性，一个是所在电梯 i ，所在楼层 j ，以为本题的数据较小。可以用 i * 100 + j 来表示状态。然后就是求个最短路就行了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <set>
#define FRER() freopen("in.txt","r",stdin)
#define FREW() freopen("out.txt","w",stdout)
#define go int T;cin>>T;for(int kase=1;kase<=T;kase++)
#define debug cout<<"****************"<<endl
#define mod 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
template <class T> T gcd(T a,T b){return !b?a:gcd(b,a%b);}
const int N = 10007 , M = 100007 , inf = 0x3f3f3f3f;
int n,m,nEdge;
int speed[N];
vector<int>F[N];
int d[N];
int head[N],nxt[M],to[M],w[M],vis[N];
int mmp[N][N];
void addEdge(int u,int v,int c){
    to[nEdge] = v;nxt[nEdge] = head[u];w[nEdge] =c;head[u] = nEdge++;
    to[nEdge] = u;nxt[nEdge] = head[v];w[nEdge] =c;head[v] = nEdge++;
}
int dijstra(int s){
    priority_queue<pii,vector<pii>,greater<pii> >q;
    memset(vis, 0, sizeof(vis));
    memset(d, inf, sizeof(d));
    d[s] = 0;
    q.push(pii(d[s],s));
    while(!q.empty()){
        pii now = q.top();q.pop();
        int u = now.second;
        //cout<<u<<endl;
        if(vis[u]) continue;
        vis[u] = 1;
        if(u%100 == m) return d[u];
        for(int e = head[u];~e;e=nxt[e]){
            int v = to[e];
            if(d[u]+w[e]<d[v]){
                d[v] = d[u]+w[e];
                q.push(pii(d[v],v));
            }
        }
    }
    return inf;
}
int main(){
    //FRER();
    //FREW();
    while(cin >> n >> m){
        nEdge = 0;
        memset(head, -1, sizeof(head));
        memset(mmp, 0, sizeof(mmp));
        memset(d, inf, sizeof(d));
        for(int i = 0 ; i < n ; i ++) F[i].clear();
        for(int i = 0 ; i < n ; i ++) cin >> speed[i] ;
        for(int i = 0 ; i < n ; i ++){
            int f;
            char c;
            while(~scanf("%d%c",&f,&c)) {
                mmp[i][f]=1;
                F[i].push_back(f);
                if(c=='\n') break;
            }
        }
        for(int i=0;i<n;i++){
            int len = (int)F[i].size();
            for(int j=0;j<len;j++){
                for(int k=j+1;k<len;k++){
                    addEdge(i*100+F[i][j], i*100+F[i][k], speed[i]*(F[i][k]-F[i][j]));
                }
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(i==j)continue;
                for(int k=0;k<100;k++){
                    if(mmp[i][k]&&mmp[j][k]){
                        addEdge(i*100+k, j*100+k, 60);
                    }
                }
            }
        }
        int ans = inf;
        for(int i=0;i<n;i++){
            if(F[i][0]==0) ans = min(ans,dijstra(i*100));
        }
        ans == inf ? cout << "IMPOSSIBLE" << endl : cout << ans <<endl;
    }
}