Peli

#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
const int O = 2501;

vector<int> T[O];
int N, M, Q;

bool f(int a, int d, int x) {
    set<int> v, w;
    v.insert(a);
    for (int i=0; i < x; ++i) {
        for (int j : v) {
            for (int k : T[j]) {
                w.insert(k);
            }
        }
        swap(v,w);
        w.clear();
    }
    return v.count(d);
}

int main() {
    cin >> N >> M >> Q;
    for (int i=0; i < M; ++i) {
        int a, b;
        cin >> a >> b;
        T[a].push_back(b);
        T[b].push_back(a);
    }
    for (int i=0; i < Q; ++i) {
        int a, b, x;
        cin >> a >> b >> x;
        if (f(a,b,x)) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED