（Dijkstra）【UVA - 11374】Airport Express

题目链接：https://vjudge.net/problem/UVA-11374

题目意思就是有n个站点，要从s前往e，有经济路线和商务路线，只能坐一次商务路线，求花费的最优解。

只要枚举选择哪一条商务路线就好了，所以两遍Dijkstra，一遍是从起点开始，一遍是从终点开始。如果需要使用由a站到b站的商务车票，则总开销就是起点到a的开销+商务路线开销+b到终点的开销。经过的站点就注意哪里需要倒序输出就行。格式卡了好几次。。每组数据后要换行，行末不能有多余空格。

要去青岛了，也没个底。。最近也没写几道题，唉

/*
* @Author: SamsonHo
* @Date:   2018-10-20-23.06.40
* @URL:https://vjudge.net/problem/UVA-11374
*/
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXN = 1e5+10;
int g[505][505],dis1[505],dis2[505],pre1[505],pre2[505],vis[505];
int n,kase = 0;
stack<int> st;
void Dijkstra(int s,int dis[],int pre[])
{
    for(int i = 0; i <= n; ++i)
    {
        dis[i] = INF;
        vis[i] = 0;
        pre[i] = -1;
    }
    dis[s] = 0;
    pre[s] = -1;
    for(int i = 1; i <= n; ++i)
    {
        int Min = INF,pos = -1;
        for(int j = 1; j <= n; ++j)
        {
            if(!vis[j] && dis[j] < Min)
            {
                Min = dis[j];
                pos = j;
            }
        }
        if(pos == -1)   break;
        vis[pos] = 1;
        for(int j = 1; j <= n; ++j)
        {
            if(!vis[j] && dis[j]>dis[pos]+g[pos][j])
            {
                dis[j] = g[pos][j]+dis[pos];
                pre[j] = pos;
            }
        }
    }
}
int main(void)
{
    int u,v,c,eco,com,s,e;
    while(~scanf("%d%d%d",&n,&s,&e))
    {
        for(int i = 0; i <= n; ++i)
            for(int j = 0; j <= n; ++j)
                g[i][j] = i==j?0:INF;
        scanf("%d",&eco);
        for(int i = 1; i <= eco; ++i)
        {
            scanf("%d%d%d",&u,&v,&c);
            g[u][v] = g[v][u] = c;
        }
        Dijkstra(s,dis1,pre1);
        Dijkstra(e,dis2,pre2);
        scanf("%d",&com);
        int pos = -1,tmp,a,b,ans = dis1[e]; //先将ans初始化为不需要使用车票的花费
        for(int i = 1;i <= com; ++i)
        {
            scanf("%d%d%d",&u,&v,&c);
            tmp = dis1[u]+dis2[v]+c;
            if(ans > tmp)
            {
                ans = tmp;
                pos = u;
                a = u,b = v;
            }
            tmp = dis1[v]+dis2[u]+c;
            if(ans > tmp)
            {
                pos = v;
                ans = tmp;
                a = v,b = u;
            }
        }
        if(kase++)    puts("");
        if(pos == -1) //不需要使用商务路线
        {
            while(!st.empty())  st.pop();
            for(int i = e; i != -1; i = pre1[i])
                st.push(i);
            while(!st.empty())
            {
                printf("%d",st.top());
                st.pop();
                if(st.empty())
                    printf("\n");
                else
                    printf(" ");
            }
            puts("Ticket Not Used");
        }
        else
        {
            while(!st.empty())  st.pop();
            for(int i = a; i!=-1; i = pre1[i])
                st.push(i);
            int flag = 1;
            while(!st.empty())
            {
                if(flag)    flag = 0;
                else    printf(" ");
                printf("%d",st.top());
                st.pop();
            }
            for(int i = b; i != -1; i = pre2[i])
                printf(" %d",i);
            puts("");
            printf("%d\n",pos);
        }
        printf("%d\n",ans);
    }
}