Peli

#include <bits/stdc++.h>
using namespace std;

int dist[2510][2510][2]; //parillinen, pariton

vector<int> v[2510];

int main() {
    iostream::sync_with_stdio(0);
    cin.tie(NULL);

    //ifstream in("input.txt");
    //cin.rdbuf(in.rdbuf());
    int n,m,q;

    cin >> n >> m >> q;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++) {
            dist[i][j][0] = dist[i][j][1] = 1000000000;
        }
        dist[i][i][0] = 0;
    }
    
    for (int i = 0; i < m; i++)
    {
        int a,b; cin >> a >> b;
        dist[a][b][1] = 1;
        dist[b][a][1] = 1;
        v[b].push_back(a);
        v[a].push_back(b);
    }
    for (int dis = 2; dis <= n; dis++) {
        for (int a = 1; a <= n; a++) {
            for (int b : v[a]) {
                for (int c = 1; c <= n; c++) {

                    if (dist[b][c][0] <= dis - 1) {
                        dist[a][c][1] = min(dist[a][c][1], dist[b][c][0] + 1);
                    }

                    if (dist[b][c][1] <= dis - 1) {
                        dist[a][c][0] = min(dist[a][c][0], dist[b][c][1] + 1);
                    }
                }
            }
        }
    }
    for (int i = 0; i < q; i++)
    {
        int a,b,x; cin >> a >> b >> x;

        if (dist[a][b][0] <= x && (x - dist[a][b][0]) % 2 == 0) {
            cout << "YES\n";
        }
        else if (dist[a][b][1] <= x && (x - dist[a][b][1]) % 2 == 0) {
            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