题目链接
有M次询问,又有询问的总的点数之和是小于等于5e5的,所以,其实就是一个虚树的模板了,直接用栈维护一个虚树即可。
期间写的时候出现了一点问题:初始化的时候,不只是要初始那些输入的K个结点,还有K个结点的lca的衍生结点也是需要初始化的,所以初始化不到位会MLE和TLE的,这里不要忘。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 250007;
int N, Q, qid[maxN << 1], LOG2[maxN];
struct Build_Graph
{
int head[maxN], cnt;
struct Eddge
{
int nex, to, val;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxN << 1];
inline void addEddge(int u, int v, int w)
{
edge[cnt] = Eddge(head[u], v, w);
head[u] = cnt++;
}
inline void _add(int u, int v, int w) { addEddge(u, v, w); addEddge(v, u, w); }
inline void init()
{
cnt = 0;
for(int i=1; i<=N; i++) head[i] = -1;
}
} Old, Now;
int dfn[maxN], tot, deep[maxN], fa[maxN][19];
inline bool cmp(int e1, int e2) { return dfn[e1] < dfn[e2]; }
ll up_toroot[maxN] = {0};
void pre_dfs(int u, int father)
{
fa[u][0] = father; deep[u] = deep[father] + 1; dfn[u] = ++tot;
for(int i=0; (1 << (i + 1)) < N; i++) fa[u][i + 1] = fa[fa[u][i]][i];
for(int i=Old.head[u], v; ~i; i=Old.edge[i].nex)
{
v = Old.edge[i].to;
if(v == father) continue;
up_toroot[v] = Old.edge[i].val;
if(u ^ 1) up_toroot[v] = min(up_toroot[v], up_toroot[u]);
pre_dfs(v, u);
}
}
inline int LCA(int u, int v)
{
if(deep[u] < deep[v]) swap(u, v);
int det = deep[u] - deep[v];
for(int i=LOG2[det]; i>=0; i--)
{
if((det >> i) & 1) u = fa[u][i];
}
if(u == v) return u;
for(int i=LOG2[N]; i>=0; i--)
{
if(fa[u][i] ^ fa[v][i])
{
u = fa[u][i];
v = fa[v][i];
}
}
return fa[u][0];
}
int Stap[maxN << 1], Stop;
inline void Insert(int u)
{
if(Stop <= 1) { Stap[++Stop] = u; return; }
if(u == Stap[Stop]) return;
int lca = LCA(u, Stap[Stop]);
if(lca == Stap[Stop]) { Stap[++Stop] = u; return; }
while(Stop > 1 && dfn[lca] <= dfn[Stap[Stop - 1]])
{
Now.addEddge(Stap[Stop - 1], Stap[Stop], 0);
Stop--;
}
if(lca ^ Stap[Stop])
{
Now.addEddge(lca, Stap[Stop], 0);
Stap[Stop] = lca;
}
Stap[++Stop] = u;
}
bool used[maxN];
ll dp[maxN];
ll dfs(int u)
{
dp[u] = 0;
for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
{
v = Now.edge[i].to;
dp[u] += min(up_toroot[v], dfs(v));
}
if(used[u]) dp[u] = up_toroot[u];
Now.head[u] = -1;
return dp[u];
}
inline void init()
{
Old.init(); Now.init(); tot = 0;
for(int i = 1, j = 2, k = 0; i <= N; i++)
{
if(i == j) { k++; j <<= 1; }
LOG2[i] = k;
}
}
int main()
{
scanf("%d", &N);
init();
for(int i=1, u, v, w; i<N; i++)
{
scanf("%d%d%d", &u, &v, &w);
Old._add(u, v, w);
}
deep[0] = 0;
pre_dfs(1, 0);
scanf("%d", &Q);
for(int q=1, sz; q<=Q; q++)
{
scanf("%d", &sz);
for(int i=1; i<=sz; i++) scanf("%d", &qid[i]);
Stap[Stop = 1] = 1;
sort(qid + 1, qid + sz + 1, cmp); Now.cnt = 0;
for(int i=1; i<=sz; i++) { Insert(qid[i]); used[qid[i]] = true; }
while(Stop > 1)
{
Now.addEddge(Stap[Stop - 1], Stap[Stop], 0);
Stop--;
}
printf("%lld\n", dfs(1));
for(int i=1; i<=sz; i++) used[qid[i]] = false;
}
return 0;
}