Submission

Score: 100

User: njoop

Problemset: เดินทางข้ามชุมชน

Language: cpp

Time: 0.254 second

Submitted On: 2025-04-15 12:10:33

#include <bits/stdc++.h>
#define tii tuple<int, int, int, int>
using namespace std;

int n, m, q, rt[100010], ans[300010], w, u, v;
priority_queue<tii, vector<tii>, greater<tii>> pq;

int fr(int no) {
    if(rt[no] == no) return no;
    else return rt[no] = fr(rt[no]);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m >> q;
    for(int i=1; i<=n; i++) {
        rt[i] = i;
    }
    while(m--) {
        cin >> u >> v >> w;
        pq.push({w, -1, u, v});
    }
    for(int i=1; i<=q; i++) {
        cin >> u >> v >> w;
        pq.push({w, i, u, v});
    }
    while(pq.size()) {
        int cw = get<0>(pq.top()), ct = get<1>(pq.top()), cu = get<2>(pq.top()), cv = get<3>(pq.top());
        pq.pop();
        if(ct != -1) {
            if(fr(cu) == fr(cv)) ans[ct] = 1;
            else ans[ct] = 0;
            continue;
        }
        if(fr(cu) == fr(cv)) continue;
        rt[fr(cu)] = fr(cv);
    }
    for(int i=1; i<=q; i++) {
        if(ans[i]) cout << "Yes\n";
        else cout << "No\n";
    }
    return 0;
}