Peli

#include <bits/stdc++.h>

using namespace std;
using ll = int64_t;

struct Data {
    vector<ll> adj;
};
vector<Data> liz;

// optimal solution is 100% a graph matrix
// but like no?

int main() {
    ll n, m, q;
    cin >> n >> m >> q;
    liz.resize(n + 1);
    for(ll i = 0; i < m; i++) {
        ll a, b;
        cin >> a >> b;
        liz[a].adj.push_back(b);
        liz[b].adj.push_back(a);
    }

    for(ll i = 0; i < q; i++) {
        ll a, b, t;
        cin >> a >> b >> t;

        // lol
        priority_queue<pair<ll, ll>> q;
        q.emplace(0, a);

        bool found = false;
        while(!q.empty()) {
            auto f = q.top();
            q.pop();

            if(f.first == t && f.second == b) {
                cout << "YES\n";
                found = true;
                break;
            }

            if(f.first != t) {
                for(auto e : liz[f.second].adj) {
                    q.emplace(f.first + 1, e);
                }
            }
        }
        if(!found)
            cout << "NO\n";
    }

    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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