Submission

Score: 0

User: navysrimuang

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-19 12:59:33

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

struct DSU{
	vector<int> par,sz;	
	DSU(int n){
		par.resize(n); sz.resize(n,1);
		iota(par.begin(),par.end(),0);
	}

	int find(int x){
		if(par[x] == x) return x;
		else return par[x] = find(par[x]);
	}

	bool unite(int a,int b){
		int ra = find(a);
		int rb = find(b);
		if(ra == rb) return 0;

		if(sz[ra] < sz[rb]) swap(ra,rb);
		par[rb] = ra;
		sz[ra] += sz[rb];
		return 1;
	}
};

int main(){

	cin.tie(0)->sync_with_stdio(0);
	int n,m,q;
	cin >> n >> m >> q;
	vector<tuple<ll,int,int>> edges;
	for(int i = 0;i<m;i++){
		int a,b;
		ll c;
		cin >> a >> b >> c;
		edges.push_back({c,a,b});
	}	
	sort(edges.begin(),edges.end());	
	//  cout << "here\n";
	while(q--){
		int cmp = 0;
		int ss,ee;
		ll k;
		cin >> ss >> ee >> k;
		DSU dsu(n);
		for(auto [w,a,b] : edges){
			if(w > k) break;
			if(dsu.unite(a,b)){
				cmp++;
			}
			if(cmp == n-1) break;
		}
		if(cmp == n-1) cout << "Yes\n";
		else cout << "No\n";
	}
	return 0;
}