#include <bits/stdc++.h>
#define FOR(i,x,n) for(int i=x; i<n; i++)
#define F0R(i,n) FOR(i,0,n)
#define ROF(i,x,n) for(int i=n-1; i>=x; i--)
#define R0F(i,n) ROF(i,0,n)
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define FILL(a, b) memset(a, b, sizeof(a));
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
const int MAXN = 5000+2;
int n, m, k, u, v, to, st, fn, len;
VI adj[MAXN];
short int fastest_route[MAXN][MAXN][2];
void Input() {
cin >> n >> m >> k;
F0R (i, m) {
cin >> u >> v;
adj[--u].pb(--v);
adj[v].pb(u);
}
}
void Bfs(int now_on) {
queue <PII> keep;
PII add, on;
keep.push({now_on, 0});
while (!keep.empty()) {
on = keep.front(); keep.pop();
on.S++;
F0R (i, adj[on.F].size()) {
to = adj[on.F][i];
if (fastest_route[now_on][to][on.S & 1] == 0) {
fastest_route[now_on][to][on.S & 1] = on.S;
keep.push({to, on.S});
}
}
}
return;
}
int main() {
IOS;
Input();
F0R (i, n) Bfs(i);
/*
F0R (i, 8) {
F0R (j, 8) cout << fastest_route[i][j][0] << "/" << fastest_route[i][j][1] << ' ';
cout << endl;
}
// **/
F0R (i, k) {
cin >> st >> fn >> len;
if (fastest_route[st - 1][fn - 1][len & 1] != 0
&& fastest_route[st - 1][fn - 1][len & 1] <= len) {
cout << "TAK" << endl;
}
else cout << "NIE" << endl;
}
}
Compilation message
mor.cpp: In function 'void Bfs(int)':
mor.cpp:3:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
3 | #define FOR(i,x,n) for(int i=x; i<n; i++)
| ^
mor.cpp:4:18: note: in expansion of macro 'FOR'
4 | #define F0R(i,n) FOR(i,0,n)
| ^~~
mor.cpp:48:3: note: in expansion of macro 'F0R'
48 | F0R (i, adj[on.F].size()) {
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
2506 ms |
5032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
2612 ms |
5100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
620 KB |
Output is correct |
2 |
Correct |
1 ms |
620 KB |
Output is correct |
3 |
Correct |
3 ms |
620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
2668 KB |
Output is correct |
2 |
Correct |
7 ms |
1388 KB |
Output is correct |
3 |
Correct |
26 ms |
3296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
61 ms |
4412 KB |
Output is correct |
2 |
Correct |
37 ms |
6124 KB |
Output is correct |
3 |
Correct |
91 ms |
6252 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
232 ms |
15468 KB |
Output is correct |
2 |
Correct |
26 ms |
5740 KB |
Output is correct |
3 |
Correct |
398 ms |
23932 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3036 ms |
28408 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3012 ms |
81328 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3077 ms |
101208 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3095 ms |
100572 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |