Peli

#include<bits/stdc++.h>
using namespace std;
 
void init_code(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif 
}

const int inf = 1e9 + 7;
void solve() {
   int n, m, q;
   cin >> n >> m >> q;

   vector<vector<int>> g(n + 1, vector<int> (n + 1, inf));
   for (int i = 1; i <= m; ++i) {
      int a, b;
      cin >> a >> b;
      g[a][b] = 1;
      g[b][a] = 1;
   }

   for (int i = 1; i <= n; ++i) {
      g[i][i] = 0;
   }
   
   vector<vector<int>> dist(n + 1, vector<int> (n + 1, inf));
   dist = g;

   for (int k = 1; k <= n; ++k) {
      for (int i = 1; i <= n; ++i) {
         for (int j = 1; j <= n; ++j) {
            dist[i][j] = min(dist[i][j], dist[i][k] + g[k][j]);
         }
      }
   }

   for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
         cout << dist[i][j] << ' ';
      }
      cout << '\n';
   }

   for (int i = 1; i <= q; ++i) {
      int a, b, x;
      cin >> a >> b >> x;
      int check = (dist[a][b] <= x) && ((x - dist[a][b]) % 2 == 0);
      for (int i = 1; i <= n; ++i) {
         if (((g[a][i] + g[i][b]) <= x) && ((x - g[i][b]) % 2 == 0)) check = 1;
         if (check) 
            break;
      }
      if (check) cout << "YES" << '\n';
      else cout << "NO" << '\n';
   }
}
 
int main() {
   init_code();
   solve();
   return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED