Graph （spfa 位运算分集合）

思路：

#include <vector>
#include <queue>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define LL long long
#define N 100005
#define M 300005
#define inf 0x7fffffff
using namespace std;

struct edge{
    int to, nxt, w;
}ed[M];

int n,m,K,idc,head[N],st[N],vis[N],dis[N],ans=inf;
queue<int> q;

void inline adde(int u, int v, int w){
    ed[++idc] = (edge){v, head[u], w}, head[u] = idc;
}

void inline spfa(){
    while( !q.empty() ){
        int x = q.front();
        for(register int i=head[x]; i; i=ed[i].nxt)
            if(dis[ed[i].to] > dis[x] + ed[i].w){
                dis[ed[i].to] = dis[x] + ed[i].w;
                if( !vis[ed[i].to] ) q.push(ed[i].to), vis[ed[i].to] = 1;
            }
        vis[x] = 0;
        q.pop();
    }
}

int main(){
    freopen ("graph.in", "r", stdin);
    freopen ("graph.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &K);
    for(int i=1; i<=m; i++){
        int u, v, w;
        scanf("%d%d%d", &u, &v, &w);
        adde(u, v, w);
    }
    for(register int i=1; i<=K; i++) scanf("%d", &st[i]);
    for(register int j=0; j<=17; j++){
        for(register int i=1; i<=n; i++) dis[i] = inf;
        for(register int i=1; i<=K; i++) if( i&(1<<j) ) q.push(st[i]), dis[st[i]] = 0, vis[st[i]] = 1;
        spfa();
        for(register int i=1; i<=K; i++) if( !(i&(1<<j)) ) ans = min(ans, dis[st[i]]);
        for(register int i=1; i<=n; i++) dis[i] = inf;
        for(register int i=1; i<=K; i++) if( !(i&(1<<j)) ) q.push(st[i]), dis[st[i]] = 0, vis[st[i]] = 1;
        spfa();
        for(register int i=1; i<=K; i++) if( i&(1<<j) ) ans = min(ans, dis[st[i]]);
    }
    printf("%d", ans);
    return 0;
}