题意:给定一个图,然后有q次询问,每次询问给出一条边,问如果假如这条边最小生成树是否改变。
思路:对于kru来说,如果这条边的两个端点不是一个爹那么这条边就会加入最小生成树。所以我们把这q条边全部加入图,如果他会加入最小生成树就标记一下然后跳过。
/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
struct node {
int u, v, w, is;
} e[400005];
int fa[200005];
int ans[200005];
bool cmp(node a, node b) {
return a.w < b.w;
}
int find(int x) {
if (x == fa[x]) {
return x;
} else {
fa[x] = find(fa[x]);
return fa[x];
}
}
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, q;
cin >> n >> m >> q;
for (int i = 1; i <= n; i++) {
fa[i] = i;
}
for (int i = 1; i <= m; i++) {
cin >> e[i].u >> e[i].v >> e[i].w;
e[i].is = 0;
}
for (int i = 1; i <= q; i++) {
cin >> e[i + m].u >> e[i + m].v >> e[i + m].w;
e[i + m].is = i;
}
sort(e + 1, e + m + q + 1, cmp);
for (int i = 1; i <= m + q; i++) {
int x = find(e[i].u);
int y = find(e[i].v);
if (x != y) {
if (e[i].is) {
ans[e[i].is] = 1;
} else {
fa[x] = y;
}
}
}
for (int i = 1; i <= q; i++) {
if (ans[i] == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
return 0;
}