集合间最短路 （dij+二进制划分集合）

题意：有n个点，m条边，给出k个点，从k个点中选出两个点使得这两点间的距离最小，求这个最小距离。

题解：把这k个点分成两个集合，按照该点 第 i 位是否为1进行划分，每次划分都要跑一次dij，这样循环跑logn次就能将所有点集情况都遍历到。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<vector> 
using namespace std;
#define inf 0x7f7f7f7f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a));
#define lowbit(x)  x&-x;  
#define debugint(name,x) printf("%s: %d\n",name,x);
#define debugstring(name,x) printf("%s: %s\n",name,x);
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 1e5+5;
const int mod = 1e9+7;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

ll dis[505];
int mp[505][505],vis[505],num[505],n,m;
queue<int>q;

void dij(){
    while(!q.empty()) q.pop();
    for(int i = 1; i <= n; i++){
        if(dis[i] == 0) 
            q.push(i);
    }
    mem(vis, 0);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        vis[u] = 0;
        for(int i = 1; i <= n; i++){
            if(mp[u][i] + dis[u] < dis[i]){
                dis[i] = dis[u] + mp[u][i];
                if(!vis[i]){
                    vis[i] = 1;
                    q.push(i);
                }
            }
        }
    }
}
int main() {
    int t;
    cin>>t;
    while(t--){
        int u,v,w;
        scanf("%d%d",&n,&m);
        mem(mp,inf);
        for(int i = 1; i <= m; i++){
            scanf("%d%d%d",&u,&v,&w);
            mp[u][v] = min(mp[u][v],w);
        }
        int k;
        scanf("%d",&k);
        mem(num,0);
        ll ans = 1e18;
        for(int i = 1; i <= k; i++)
            scanf("%d",&num[i]);
        for(int i = 0; i <= 10; i++){
            mem(dis,inf);
            for(int j = 1; j <= k; j++){
                if(num[j]&(1<<i)){  //1
                    dis[num[j]] = 0;
                }
            }
            dij();
            for(int j = 1; j <= k; j++)
                if(dis[num[j]] && !(num[j]&(1<<i))) 
                    ans = min(ans,dis[num[j]]);
            mem(dis,inf);
            for(int j = 1; j <= k; j++){
                if(!(num[j]&(1<<i))){ //0
                    dis[num[j]] = 0;
                }
            }
            dij();
            for(int j = 1; j <= k; j++)
                if(dis[num[j]] && (num[j]&(1<<i))) 
                    ans = min(ans,dis[num[j]]);
        }
        printf("%lld\n",ans);
    }
}