# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1111537 |
2024-11-12T09:22:26 Z |
YSH2020 |
Drivers (BOI24_drivers) |
C++17 |
|
1 ms |
504 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, u; cin >> n >> m >> u;
vector <vector<pair<int, int>>> edges;
vector<pair<int, int>> empty;
for (int i= 0; i < n+5; i++) edges.push_back(empty);
for (int i = 0; i < m; i++) {
int x, y, z; cin >> x >> y >> z;
edges[x].push_back({y, z});
edges[y].push_back({x, z});
}
while (u--) {
int x, y, z; cin >> x >> y >> z;
int visit[n+5]; for (int i=1; i<=n;i++) visit[i] = 0;
queue<int> tmp;
tmp.push(x);
while (visit[y] == 0 and tmp.size() > 0) {
auto cur = tmp.front();
tmp.pop();
if (visit[cur] == 1) continue;
visit[cur] = 1;
for (auto i:edges[cur]) {
if (i.second <= z and visit[i.first] == 0) tmp.push(i.first);
}
}
if (visit[y] == 0) cout << "NE" << '\n';
else cout << "TAIF" << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |