[HDOJ6115] Factory（lca, 暴力乱搞）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6115

这题数据太弱了，看到群里说这题暴力就行，就打了一个暴力。

预处理每个点到根的距离，查的时候O(n^2logn)就行了。。。

当然不排除我的暴力姿势好（1e6^3姿势再好也白搭）

/*
━━━━━┒ギリギリ♂ eye！
┓┏┓┏┓┃キリキリ♂ mind！
┛┗┛┗┛┃＼○／
┓┏┓┏┓┃ /
┛┗┛┗┛┃ノ)
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┃┃┃┃┃┃
┻┻┻┻┻┻
*/
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define cl clear
#define BUG puts("here!!!")
#define W(a) while(a--)
#define pb(a) push_back(a)
#define Rint(a) scanf("%d", &a)
#define Rll(a) scanf("%I64d", &a)
#define Rs(a) scanf("%s", a)
#define Cin(a) cin >> a
#define FRead() freopen("in", "r", stdin)
#define FWrite() freopen("out", "w", stdout)
#define Rep(i, len) for(int i = 0; i < (len); i++)
#define For(i, a, len) for(int i = (a); i < (len); i++)
#define Cls(a) memset((a), 0, sizeof(a))
#define Clr(a, x) memset((a), (x), sizeof(a))
#define Full(a) memset((a), 0x7f7f7f, sizeof(a))
#define lrt rt << 1
#define rrt rt << 1 | 1
#define pi 3.14159265359
#define RT return
#define lowbit(x) x & (-x)
#define onenum(x) __builtin_popcount(x)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<LL, LL> pll;
typedef map<string, int> msi;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vl> vvl;
typedef vector<bool> vb;

const int maxn = 200100;
int n, k, CNT, tot;
int dp[2*maxn][22],vis[maxn];
int b[2*maxn], used[maxn], f[2*maxn], pos[maxn];
vector<pii> G[2*maxn];
vi rG[2*maxn];
int val[maxn];

void st(int n,int x[]) {
    for(int i = 1; i <= n; i++) dp[i][0] = x[i];
    int k = int(log(n+1.0)/log(2.0));
    for(int j = 1; j <= k; j++) {
        for(int i = 1; i + (1 << j) - 1 <= n; i++) {
            dp[i][j] = min(dp[i][j-1], dp[i+(1<<(j-1))][j-1]);
        }
    }
}

int query(int l,int r) {
    int k = int(log(r-l+1.0)/log(2.0));
    return min(dp[l][k], dp[r-(1<<k)+1][k]);
}

void dfs(int s) {
    int t;
    used[s] = 1;
    int w = ++CNT;
    b[++tot] = w; f[w] = s;
    pos[s] = tot;
    Rep(i, G[s].size()) {
        t=G[s][i].first;
        if(used[t])  continue;
        val[t] = val[s] + G[s][i].second;
        dfs(t);
        b[++tot] = w;
    }
}
int lca(int a,int b) {
    if(pos[a] > pos[b]) swap(a,b);
    return f[query(pos[a], pos[b])];
}

signed main() {
    // FRead();
    int u, v;
    int n,m,w;
    int T;
    Rint(T);
    W(T) {
        Rint(n); Rint(m);
        Rep(i, maxn) {
            G[i].clear();
            rG[i].clear();
        }
        For(i, 1, n) {
            Rint(u); Rint(v); Rint(w);
            G[u].push_back(make_pair(v,w));
            G[v].push_back(make_pair(u,w));
        }
        For(i, 1, m+1) {
            int cnt;
            Rint(cnt);
            W(cnt) {
                int f;
                Rint(f);
                rG[i].push_back(f);
            }
        }
        val[1] = 0; CNT=0; tot = 0;
        Cls(used);
        dfs(1); st(tot,b);
        Rint(k);
        int ret;
        W(k) {
            int a, b;
            Rint(a); Rint(b);
            ret = 0x3f3f3f3f;
            Rep(i, rG[a].size()) {
                Rep(j, rG[b].size()) {
                    u = rG[a][i]; v = rG[b][j];
                    w = val[u] + val[v] - 2 * val[lca(u,v)];
                    ret = min(w, ret);
                }
            }
            printf("%d
", ret);
        }
    }
    return 0;
}