oj.uz

답안 #980146

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980146 2024-05-12T00:14:34 Z nhuang685 Tales of seafaring (POI13_mor) C++17
40 / 100
 1168 ms 102996 KB 
#include <bits/stdc++.h>

int main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);

  int n, m, k;
  std::cin >> n >> m >> k;

  std::vector<std::vector<int>> adj(n);
  for (int i = 0; i < m; ++i) {
    int a, b;
    std::cin >> a >> b;
    --a;
    --b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  std::vector<std::vector<std::array<short, 2>>> dist(n, std::vector<std::array<short, 2>>(n));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      dist[i][j][0] = dist[i][j][1] = 10000;
    }
  }
  auto sp = [&](int st) {
    // std::vector<std::array<int, 2>> dist(n, {(int)2e9, (int)2e9});
    dist[st][st][0] = 0;
    std::queue<std::pair<int, bool>> q;
    q.emplace(st, 0);
    while (!q.empty()) {
      auto [node, par] = q.front();
      q.pop();
      for (int i : adj[node]) {
        if (dist[st][i][!par] > dist[st][node][par] + 1) {
          dist[st][i][!par] = dist[st][node][par] + 1;
          q.push({i, !par});
        }
      }
    }
  };
  for (int i = 0; i < n; ++i) {
    sp(i);
  }
  while (k--) {
    int s, t, d;
    std::cin >> s >> t >> d;
    --s;
    --t;
    d = std::min(d, 9999);
    if (d >= dist[s][t][d % 2] && (int)adj[s].size() > 0) {
      std::cout << "TAK\n";
    } else {
      std::cout << "NIE\n";
    }
  }
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 181 ms 4504 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1116 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 1940 KB Output is correct
2 Incorrect 7 ms 2908 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 9400 KB Output is correct
2 Incorrect 7 ms 2740 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 548 ms 20124 KB Output is correct
2 Correct 26 ms 16220 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1125 ms 67288 KB Output is correct
2 Correct 63 ms 16980 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 986 ms 102996 KB Output is correct
2 Incorrect 210 ms 95060 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1168 ms 102656 KB Output is correct
2 Incorrect 356 ms 86820 KB Output isn't correct
3 Halted 0 ms 0 KB -