2017多校第9场 HDU 6166 Senior Pan 堆优化Dij

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100010;
const LL inf = 0x3f3f3f3f3f3f3f3f;
struct edge{
    int to,val,next;
}E[maxn];
int head[maxn],edgecnt,a[maxn];
bool vis[maxn];
LL dis[maxn];
void initedge(){
    edgecnt=0;
    memset(head,-1,sizeof(head));
}
void add(int u, int v, int w){
    E[edgecnt].to=v,E[edgecnt].val=w,E[edgecnt].next=head[u],head[u]=edgecnt++;
}
struct node{
    int x;
    LL step;
    node(int x, LL step):x(x),step(step){}
    bool operator < (const node &rhs) const{
        return step>rhs.step;
    }
};
priority_queue<node>q;
LL Dijstra(){
    while(!q.empty()){
        node now=q.top(); q.pop();
        if(vis[now.x]) return now.step;
        int u=now.x;
        for(int i=head[u]; ~i; i=E[i].next){
            int to = E[i].to;
            if(dis[to]>dis[u]+E[i].val){
                dis[to]=dis[u]+E[i].val;
                q.push(node(to,dis[to]));
            }
        }
    }
    return inf;
}
void init(){
    memset(vis, 0, sizeof(vis));
    for(int i=0; i<maxn; i++) dis[i]=inf;
    while(!q.empty()) q.pop();
}
LL work(int k)
{
    LL ans = inf;
    for(int i=0; i<20; i++){
        init();
        for(int j=1; j<=k; j++){
            if(a[j]&(1<<i)){
                q.push(node(a[j],0)),dis[a[j]]=0;
            }
            else{
                vis[a[j]]=1;
            }
        }
        ans = min(ans, Dijstra());
        init();
        for(int j=1; j<=k; j++){
            if(a[j]&(1<<i)){
                vis[a[j]]=1;
            }
            else{
                q.push(node(a[j],0)),dis[a[j]]=0;
            }
        }
        ans = min(ans, Dijstra());
    }
    return ans;
}
int T,n,m,k,ks;
int main()
{
    ks = 0;
    scanf("%d", &T);
    while(T--)
    {
        initedge();
        scanf("%d %d",&n,&m);
        for(int i=1; i<=m; i++){
            int u, v, w;
            scanf("%d %d %d", &u,&v,&w);
            add(u, v, w);
        }
        scanf("%d", &k);
        for(int i=1; i<=k; i++) scanf("%d", &a[i]);
        LL ans = work(k);
        printf("Case #%d: %lld\n", ++ks, ans);
    }
    return 0;
}