Peli

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;

vector<int> adj[2510];
int dp[2510][2510];

bool search(int a, int b, int x) {
    if (x < 0) return false;

    if (dp[a][b] != 0 && x - dp[a][b] == 0) {
        return true;
    }
    if (a == b && x == 0) {
        return true;
    }


    bool flag = false;
    for (int u : adj[a]) {
        flag = search(u, b, x-1);

        if (flag) {
            break;
        };
    }

    if (flag) {
        dp[a][b] = x;
        dp[b][a] = x;
    }

    return flag;
}

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

    for (int i=0; i<m; i++) {
        int a, b;
        cin >> a >> b;

        adj[a].push_back(b);
        adj[b].push_back(a);
    }

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

        bool ans = search(a, b, x);
        if (ans) {
            cout << "YES" << endl;
        } else {
            cout << "NO" << endl;
        }
    }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 2

Verdict: RUNTIME ERROR

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: RUNTIME ERROR