Peli

#include <bits/stdc++.h>
 
#define forn(i, n) for (int i = 0; i<n; i++)
#define FOR(i, k, n) for (int i = k; i < n; i++)
#define N 1<<17
#define pb push_back
typedef long long ll;
using namespace std;
 
int n, m, q;
 
vector<int> arr[2501];
map<tuple<int, int, int>, bool> mem; // <a, b, (is odd)>, (can find)
 
bool haku(int a, int b, int e, int x) {
    if (mem.find({a, b, x}) != mem.end()) {
        // cout << "mem: " << a << ", " << b << ", " << (x) << " -> " << mem[{a, b, x&1}] << endl;
        return mem[{a, b, x}];
    }
    if (a == b && !(x&1)) {
        mem[{a, b, x}] = 1;
        return 1;
    }
    if (x <= 0) {
        return 0;
    }
    for (int i : arr[a]) {
        if (i == e) continue;
        if (i == b) {
            if (x&1) {
                mem[{a, b, x}] = 1;
                return 1;
            }
        }
        if (haku(i, b, a, x-1)) {
            mem[{a, b, x}] = 1;
            return 1;
        }
    }
    return 0; 
}
 
int main() {
    cin >> n >> m >> q;
 
    forn(i, m) {
        int a,b;
        cin >> a >> b;
        arr[a].pb(b);
        arr[b].pb(a);
    }
 
    forn(i, q) {
        int a,b,x;
        cin >> a >> b >> x;
        if (haku(a, b, 0, x)) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
 
    return 0;
}

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: RUNTIME ERROR

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: RUNTIME ERROR