# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111534 | YSH2020 | Drivers (BOI24_drivers) | C++17 | 1 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, u; cin >> n >> m >> u;
vector <vector<pair<int, int>>> edges{n+5};
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';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |