Submission

Score: 50

User: tHeNyXs

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

Language: cpp

Time: 1.095 second

Submitted On: 2026-03-06 06:08:46

#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
const int N = 1e5+5;
vector<pii> graph[N];
vector<int> dist(N, -1);
int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n, m, q; cin >> n >> m >> q;
    for (int i = 0; i < m; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        graph[u].emplace_back(v, w);
        graph[v].emplace_back(u, w);
    }
    
    while (q--) {
        int a, b, k; cin >> a >> b >> k;
        queue<int> q;
        q.emplace(a);
        bool flag = false;
        vector<bool> vis(N+1, false);
        while (!q.empty()) {
            int u = q.front(); q.pop();
            if (u == b) {
                flag = true;
                break;
            }
            if (vis[u]) continue;
            vis[u] = true;
            for (auto[v, w] : graph[u]) {
                if (w > k) continue;
                q.emplace(v);
            }
        }
        cout << (flag ? "Yes\n" : "No\n");
    }

    return 0;
}