uva11374 dij单源最短路+枚举

//uva11374 dij单源最短路+枚举
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define maxn 510
#define INF 9999999
using namespace std;

struct Edge
{
    int u,v,dis;
};
struct Node
{
    int d,u;
    bool operator<(const Node &x)const{
        return d>x.d;
    }
};
struct Dijkstra
{
    int n,m;
    vector<Edge>edge;
    vector<int>G[maxn];
    bool vis[maxn];
    int d[maxn],p[maxn];

    void init(int n)
    {
        this->n=n;
        edge.clear();
        for(int i=0;i<=n;i++) G[i].clear();
    }

    void add(int u,int v,int c){
        edge.push_back((Edge){u,v,c});
        m=edge.size();
        G[u].push_back(m-1);
    }

    void dij(int s)
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i<=n;i++) d[i]=INF;
        d[s]=0;
        priority_queue<Node>Q;
        Q.push((Node){0,s});
        while(!Q.empty()){
            Node x=Q.top();Q.pop();
            int u=x.u;
            if (vis[u]) continue;
            vis[u]=true;
            for(int i=0;i<G[u].size();i++)
            {
                Edge &e=edge[G[u][i]];
                if (d[e.v]>d[u]+e.dis){
                    d[e.v]=d[u]+e.dis;
                    p[e.v]=G[u][i];
                    Q.push((Node){d[e.v],e.v});
                }
            }
        }
    }
}Dij1,Dij2;

int nextint(){int x;scanf("%d",&x);return x;}

int  n,st,ed,m1,m2;

void read()
{
    m1=nextint();
    for(int i=0;i<m1;i++)
    {
        int u,v,c;
        u=nextint();v=nextint();c=nextint();
        Dij1.add(u,v,c);Dij2.add(u,v,c);
        Dij1.add(v,u,c);Dij2.add(v,u,c);
    }
    Dij1.dij(st);Dij2.dij(ed);
}
void solve()
{
    int mind=Dij1.d[ed];
    bool ch=false;
    Edge e;

    int m2=nextint();
    for(int i=0;i<m2;i++)
    {
        int u,v,c;
        u=nextint();v=nextint();c=nextint();
        if (Dij1.d[u]+c+Dij2.d[v]<mind){
            mind=Dij1.d[u]+c+Dij2.d[v];
            e=(Edge{u,v,c});
            ch=true;
        }
        if (Dij1.d[v]+c+Dij2.d[u]<mind){
            mind=Dij1.d[v]+c+Dij2.d[u];
            e=(Edge{v,u,c});
            ch=true;
        }
    }
    vector<int>path,ans;
    path.clear();ans.clear();
    int u,v;
    if (ch)
    {
        u=e.u;
        while(u!=st)
        {
            path.push_back(u);
            u=Dij1.edge[Dij1.p[u]].u;
        }
        path.push_back(st);
        for(int i=path.size()-1;i>=0;i--) ans.push_back(path[i]);

        v=e.v;
        while(v!=ed)
        {
            ans.push_back(v);
            v=Dij2.edge[Dij2.p[v]].u;
        }
        ans.push_back(ed);
    }
    else{
        v=st;
        while(v!=ed)
        {
            ans.push_back(v);
            v=Dij2.edge[Dij2.p[v]].u;
        }
        ans.push_back(ed);
    }

    for(int i=0;i<ans.size();i++)
    {
        if (i>0) printf(" ");
        printf("%d",ans[i]);
    }
    printf("
");
    if (ch) printf("%d
",e.u);else printf("Ticket Not Used
");
    printf("%d
",mind);

    return ;
}
int main()
{
    int cas=0;
    while(cin>>n>>st>>ed && n>0)
    {
        cas++;
        if (cas>1) printf("
");
        Dij1.init(n);Dij2.init(n);
        read();
        solve();
    }
}