新年好（堆优化dijkstra+暴力）

#include<iostream>
#include<cstring>
#include<queue>
#define x first
#define y second
#define PII pair<int,int>
using namespace std;
const int N=50010,M=200010,inf=0x3f3f3f3f;
int h[N],e[M],w[M],ne[M],idx,n,m;
int source[6],d[6][N];
int st[N];
int dist[6][N];
void add(int a,int b,int c)
{
    ne[idx]=h[a];
    e[idx]=b;
    w[idx]=c;
    h[a]=idx++;
}
void dijkstra(int start,int dist[])
{
    memset(dist,0x3f,N*4);
    dist[start]=0;
    memset(st,0,sizeof st);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
    q.push({0,start});
    while(q.size())
    {
        auto t=q.top();
        q.pop();
        int ver=t.y,distance=t.x;
        if(st[ver])continue;
        st[ver]=true;
        for(int i=h[ver];i!=-1;i=ne[i])
        {
            int j=e[i];
            if(dist[j]>distance+w[i])
            {
                dist[j]=distance+w[i];
                q.push({dist[j],j});
            }
        }
    }
}

int dfs(int u,int start,int distance)
{
    if(u==6)return distance;
    int res=inf;
    for(int i=1;i<=5;i++)
    {
        int j=source[i];
        if(!st[i])
        {
            st[i]=true;
            res=min(res,dfs(u+1,i,distance+dist[start][j]));
            st[i]=false;
        }
    }
    return res;
}
int main()
{
    memset(h,-1,sizeof h);
    cin>>n>>m;
    source[0]=1;
    for(int i=1;i<=5;i++)
    cin>>source[i];
    int a,b,c;
    while(m--)
    {
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
        add(b,a,c);
    }
    for(int i=0;i<6;i++)dijkstra(source[i],dist[i]);
    memset(st,0,sizeof st);
    int res=dfs(1,0,0);
    cout<<res<<endl;
    return 0;
}