PTA 【L2】紧急救援

详解代码，反正是Dijkstra的应用，问题很多
当时蚌埠住了

//#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << "*" << x << endl;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lowbit(x) x &(-x);
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef unsigned int ui;        /// 0~(2^32)-1
typedef unsigned long long ull; ///0~(2^64)-1
const int inf = 0x3f3f3f3f;
const double eps = 1e-9;
const int P = 131; ///或者P=13331
const int N =1e6+100;
const int M = 1e9 + 7;
const int mod =86400000;
#define int ll
int n,m,s,d,tot;
int peonum[N],head[N],path[N],road[N],dis[N],peo[N];
bool vis[N];
struct Edge
{
    int to,val,nex;
} e[N];
void add(int u,int v,int w)
{
    e[++tot].to=v;
    e[tot].val=w;
    e[tot].nex=head[u];
    head[u]=tot;
}
void print(int x)///dfs正序输出
{
    if(x==s)
    {
        printf("%lld",x);
        return;
    }
    print(path[x]);
    printf(" %lld",x);
}
void dijkstra(int u)
{
    priority_queue<pii,vector<pii>,greater<pii>>p;
    fill(dis+1,dis+1+n,inf);
    dis[u]=0;
    road[u]=1;///
    peonum[u]=peo[u];
    p.push({0,u});
    while(p.size())
    {
        int x=p.top().second;
        p.pop();///
        if(vis[x])
            continue;///
        vis[x]=1;///
        for(int i=head[x]; i; i=e[i].nex)
        {
            int y=e[i].to,z=e[i].val;
            if(dis[y]>dis[x]+z)
            {
                dis[y]=dis[x]+z;
                path[y]=x;
                road[y]=road[x];
                peonum[y]=peonum[x]+peo[y];///必要条件下直接摇人
                p.push({dis[y],y});///记得push
            }
            else if(dis[y]==dis[x]+z)
            {
                road[y]+=road[x];///多条道路，道路+=
                if(peonum[y]<peonum[x]+peo[y])///非必要条件下，选择性摇人
                {
                    peonum[y]=peonum[x]+peo[y];
                    path[y]=x;
                }
            }
        }
    }
}///【数组开大点，寄】
void AC()
{
    cin>>n>>m>>s>>d;
    for(int i=0; i<n; i++)///我焯了啊【for(int i=1;i<=n;i++)这样扣两个样例】
    {
        cin>>peo[i];
        path[i]=i;
    }
    for(int i=1; i<=m; i++)
    {
        int u,v,w;
        cin>>u>>v>>w;
        add(u,v,w);
        add(v,u,w);
    }
    dijkstra(s);///没引用艹
//    for(int i = 1; i <= n; i++)
//        cout<<dis[i]<<endl;
    cout<<road[d]<<" "<<peonum[d]<<endl;
    print(d);
}
signed main()
{
    IOS;
    // freopen("T:\\in.txt", "r", stdin);
    // freopen("T:\\out.txt", "w", stdout);
    int _ = 1;
    while (_--)
        AC();
    fclose(stdin);
    fclose(stdout);
    return 0;
}
///      |\_/|
///      | @ @   Woof!
///      |   <>              _
///      |  _/\------____ ((| |))
///      |               `--' |
///  ____|_       ___|   |___.'
/// /_/_____/____/_______|
/// I am here to guard this code, woof!