Submission

Score: 100

User: C12

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

Language: cpp

Time: 0.145 second

Submitted On: 2026-01-22 11:37:42

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define ll long long
#define ull unsigned long long
#define mp make_pair
 
#define mpiii(a,b,c) make_pair(a,make_pair(b,c));
int32_t mod = 1e9+7;

vector<ll>p;

int dsu(int i){
    if(p[i] != i) p[i] = dsu(p[i]);
    return p[i];
}

void solve(){
    ll n,m,q;
    ll u,v,w,idx;
    tuple<ll,ll,ll,ll> x;

    cin >> n >> m >> q;
    
    vector<tuple<ll,ll,ll,ll>>edge;
    vector<bool>ans(q);

    for(int i = 0;i < n;i++){
        p.push_back(i);
    }
    
    for(int i = 0;i < m;i++){
        cin >> u >> v >> w;
        edge.push_back(make_tuple(w,-1,u,v));
    }

    for(int i = 0;i < q;i++){
        cin >> u >> v >> w;
        edge.push_back(make_tuple(w,i,u,v));
    }

    sort(edge.begin(),edge.end());

    for(int i = 0;i < edge.size();i++){
        x = edge[i];
        w = get<0>(x);
        idx = get<1>(x);
        u = get<2>(x);
        v = get<3>(x);

        if(idx != -1){
            ans[idx] = (dsu(u) == dsu(v));
            // cout << dsu(u) << ' ' << dsu(v) << "\n";
        }
        else if(dsu(u) != dsu(v)){
            p[dsu(u)] = p[v];
        }
    }

    for(int i = 0;i < q;i++){
        if(ans[i] == 0){
            cout << "No\n";
        }
        else{
            cout << "Yes\n";
        }
    }

    return;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    // ll q;
 
    // cin >> q;
    
    // while(q--) 
    solve();

    return 0;
}
/*
5 3 3 3
3 3 3 3 3
1
3
3

*/