Submission

Score: 50

User: havename

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

Language: cpp

Time: 1.092 second

Submitted On: 2026-03-07 09:38:58

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

int main(){
    int n,m,q;
    cin>>n>>m>>q;

    vector<vector<pair<int,ll>>> adj(n+1);

    for(int i=0;i<m;i++){
        int a,b;
        ll w;
        cin>>a>>b>>w;
        adj[a].push_back({b,w});
        adj[b].push_back({a,w});
    }

    while(q--){
        int st,ed;
        ll c;
        cin>>st>>ed>>c;

        queue<int> q;
        vector<int> vis(n+1,0);

        q.push(st);
        vis[st]=1;

        while(!q.empty()){
            int v=q.front();
            q.pop();

            for(auto [to,w]:adj[v]){
                if(!vis[to] && w<=c){
                    vis[to]=1;
                    q.push(to);
                }
            }
        }

        if(vis[ed]) cout<<"Yes\n";
        else cout<<"No\n";
    }
}