Peli

#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const int N = 2500;

int n, m, q;
vector<int> V[N];
pair<int,int> D[N][N];
priority_queue<pair<int,int>> Q;

int main() {
  cin >> n >> m >> q;
  for (int i=0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    V[a-1].push_back(b-1);
    V[b-1].push_back(a-1);
  }
  for (int i=0; i < n; ++i) {
    Q.push({0,i});
    D[i][i] = {0,2};
    while (Q.size()) {
      auto [s,j] = Q.top(); Q.pop();
      s = -s + 1;
      for (int k : V[j]) {
        auto& [p1,p2] = D[i][k];
        if (s % 2 == 1 && !p1) {
          p1 = s;
          Q.push({-s,k});
        } else if (s % 2 == 0 && !p2) {
          p2 = s;
          Q.push({-s,k});
        }
      }
    }
  }
  for (int i=0; i < q; ++i) {
    int a, b, x;
    cin >> a >> b >> x;
    --a; --b;
    if ((x % 2 == 1 && D[a][b].first <= x) || (x % 2 == 0 && D[a][b].second <= x) || (a == b && x == 0)) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED