#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, 9998 + d % 2);
if (d >= dist[s][t][d % 2] && (int)adj[s].size() > 0) {
std::cout << "TAK\n";
} else {
std::cout << "NIE\n";
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
180 ms |
4436 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
188 ms |
4380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
1116 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
13 ms |
1372 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
1884 KB |
Output is correct |
2 |
Correct |
7 ms |
2904 KB |
Output is correct |
3 |
Correct |
40 ms |
3052 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
90 ms |
9400 KB |
Output is correct |
2 |
Correct |
8 ms |
2652 KB |
Output is correct |
3 |
Correct |
233 ms |
16332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
521 ms |
20204 KB |
Output is correct |
2 |
Correct |
21 ms |
16216 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1146 ms |
67292 KB |
Output is correct |
2 |
Correct |
68 ms |
16980 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1008 ms |
102712 KB |
Output is correct |
2 |
Correct |
205 ms |
95060 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1154 ms |
102616 KB |
Output is correct |
2 |
Correct |
368 ms |
86808 KB |
Output is correct |