题目链接: http://codeforces.com/problemset/problem/891/C
题目大意: 给出一个n个顶点, m条边的联通无向图, 每条边有权值 wi ,有q组询问, 每次询问原图中的 ki 条边, 求是否存在一种最小生成树包含这 ki 条边。 (n,m,wi,q,∑ki≤5∗105) 。
思路: 考虑离线求解。 先将所有边按从小到大排序, 每次同时考虑一堆权值均为x的边, 根据kruskal算法, 所有 < x的边已经进行了并查集缩点, 再单独考虑所有涉及了这一次权值为x的询问 qi , 把 qi 涉及到的边单独拿出来做并查集合并, 若出现了环则 qi 这条询问判断为不存在, 再把这次的修改还原, 考虑完所有的涉及到的询问后, 把该层权值为x的边端点并查集合并后, 继续考虑下一层权值的边。
#include <map>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
const int N = 5e5 + 10;
#define ll long long
using namespace std;
int n, m, Edge[N][2], w[N], id[N];
int q, fa[N]; bool out[N];
map<int, vector<int> > M1, M2[N];
bool cmp(int i, int j){return w[i] < w[j];}
int top, val[N]; int *stk[N];
int modf(int *x, int y){
stk[++ top] = x, val[top] = (*x);
(*x) = y;
return y;
}
void reload(){
while (top) {(*stk[top]) = val[top]; top --;}
}
int find(int x){
if (x == fa[x]) return x;
return modf(fa + x, find(fa[x]));
}
int main(){
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i ++) scanf("%d%d%d", Edge[i] + 0, Edge[i] + 1, w + i), id[i] = i;
scanf("%d", &q);
for (int i = 1, k; i <= q; i ++){
scanf("%d", &k);
for (int j = 1, x; j <= k; j ++){
scanf("%d", &x);
if (M1[w[x]].size() == 0 || M1[w[x]][M1[w[x]].size() - 1] != i) M1[w[x]].push_back(i);
M2[i][w[x]].push_back(x);
}
}
sort(id + 1, id + m + 1, cmp);
for (int i = 1; i <= n; i ++) fa[i] = i;
for (int i = 1; i <= m; i ++){
int L = i, R = i;
while (w[id[R + 1]] == w[id[L]] && R + 1 <= m) R ++;
for (int j = 0; j < M1[w[id[i]]].size(); j ++){
int qid = M1[w[id[i]]][j];
if (out[qid]) continue;
for (int k = 0; k < M2[qid][w[id[i]]].size(); k ++){
int E = M2[qid][w[id[i]]][k];
int u = Edge[E][0], v = Edge[E][1];
if (find(u) != find(v)){
modf(&fa[find(u)], find(v));
}
else {out[qid] = 1; break;}
}
reload();
}
for (int j = L; j <= R; j ++){
int E = id[j];
int u = Edge[E][0], v = Edge[E][1];
if (find(u) != find(v)) modf(&fa[find(u)], find(v));
}
top = 0;
i = R;
}
for (int i = 1; i <= q; i ++)
puts(out[i] ? "NO" : "YES");
return 0;
}