#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int INF = 10001;
void solve() {
int n, m, k;
cin >> n >> m >> k;
vector<int> adj[n];
for(int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
adj[--a].push_back(--b);
adj[b].push_back(a);
}
short dist[n][n][2];
memset(dist, 0x3f, sizeof(dist));
for(int i = 0; i < n; i++) {
queue<array<int, 2>> q;
q.push({i, 0});
dist[i][i][0] = 0;
while(!q.empty()) {
auto [u, p] = q.front();
q.pop();
for(int v: adj[u]) {
if(dist[i][v][p ^ 1] < INF) continue;
dist[i][v][p ^ 1] = dist[i][u][p] + 1;
q.push({v, p ^ 1});
}
}
}
while(k--) {
int a, b, c;
cin >> a >> b >> c;
--a; --b;
if(dist[a][b][c & 1] > INF || dist[a][b][c & 1] > c) {
cout << "NIE" << '\n';
} else {
cout << "TAK" << '\n';
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("io.out", "w", stdout);
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
}
Compilation message
mor.cpp: In function 'void solve()':
mor.cpp:23:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
23 | auto [u, p] = q.front();
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
1116 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
13 ms |
1480 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
1884 KB |
Output is correct |
2 |
Correct |
8 ms |
3140 KB |
Output is correct |
3 |
Incorrect |
40 ms |
3156 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
89 ms |
9632 KB |
Output is correct |
2 |
Correct |
8 ms |
2652 KB |
Output is correct |
3 |
Incorrect |
232 ms |
16356 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
501 ms |
33784 KB |
Output is correct |
2 |
Correct |
20 ms |
16220 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1134 ms |
80560 KB |
Output is correct |
2 |
Correct |
70 ms |
19212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1018 ms |
117596 KB |
Output is correct |
2 |
Correct |
211 ms |
98700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1186 ms |
117360 KB |
Output is correct |
2 |
Correct |
368 ms |
97876 KB |
Output is correct |