HDU4522 湫湫系列故事——过年回家

传送门：点我

中文题面。

思路：拿spfa对卧铺和硬铺分别跑spfa，然后找两个的最短路。体感堆优化的dij也可以，不过spfa跑跑就过去了。有个细节是最后得用long long 存数据，其他的没啥。

去重边是拿set存的邻接表。判断是否是数字用的isdigit函数。懒的要命系列。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>  

using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define pill pair<int, int>
#define mst(a, b)    memset(a, b, sizeof a)
#define REP(i, x, n)    for(int i = x; i <= n; ++i)
int vis[],dis[],n,m;
set<int>v1[];
set<int>v2[];
void spfa(int st,int key){
    queue<int>q;
    memset(vis,,sizeof(vis));
    for(int i =  ; i <= n ; i++){
        dis[i] = ;
    }
    q.push(st);
    vis[st] = ;
    dis[st] = ;
    while(!q.empty()){
        int v = q.front();
        vis[v] =  ;
        q.pop();
        if(key == ){
            set<int>::iterator it = v1[v].begin();
            for(;it != v1[v].end(); it++){
                int to = *it;
                if(dis[to] > dis[v] + ){
                    dis[to] = dis[v] + ;
                    if(!vis[to]){
                        q.push(to);
                        vis[to] = ;
                    }
                }
            }
        }
        else{
            set<int>::iterator it = v2[v].begin();
            for(;it != v2[v].end(); it++){
                int to = *it;
                if(dis[to] > dis[v] + ){
                    dis[to] = dis[v] + ;
                    if(!vis[to]){
                        q.push(to);
                        vis[to] = ;
                    }
                }
            }
        }
    }
}
int main(){
    int t;
    for(scanf("%d",&t);t--;){
        char s[];
        scanf("%d %d",&n,&m);
        for(int i =  ; i <= n ; i++){
            v1[i].clear();
            v2[i].clear();
        }
        while(m--){
            int num;
            scanf("%s %d",s,&num);
            int k = , y = -;
            int len = strlen(s);
            for(int i =  ; i < len ; i++){
                if(isdigit(s[i])){
                    k = k *  + (s[i] - '');
                }
                else{
                    if(y == -) y = k;
                    else{
                        v1[y].insert(k);
                        if(num > ){
                            v2[y].insert(k);
                        }
                        y = k;
                    }
                    k = ;
                }
            }
            v1[y].insert(k);
            if(num > ){
                v2[y].insert(k);
            }
        }
        long long ans1 = ,ans2 = ;
        int d1,d2,st,ed;
        scanf("%d %d %d %d",&d1,&d2,&st,&ed);
        spfa(st,);
        ans1 = dis[ed];
        spfa(st,);
        ans2 = dis[ed];
        if(ans1 ==  && ans2 ==  ){
            puts("-1");continue;
        }
        //printf("%d %d\n",ans1,ans2);
        printf("%lld\n",min(ans1*d1*1LL,ans2*d2*1LL));
    }
}