#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, s, e, q, timer = 0;
vector<vector<pii> > graph;
vector<int> stores;
vector<int> in, out;
void dfs(int u, int p) {
in[u] = timer++;
for(auto &[v, w] : graph[u]) {
if(v == p) continue;
dfs(v, u);
}
out[u] = timer;
}
bool anc(int u, int v) {
return (in[u] <= in[v] && out[u] <= out[v]);
}
int32_t main() {
setIO();
cin >> n >> s >> q >> e;
graph.resize(n+1);
stores.resize(s);
in.resize(n+1);
out.resize(n+1);
vector<pii> edges(n+1);
for(int i=0; i<n-1; i++) {
int a, b, w;
cin >> a >> b >> w;
graph[a].push_back({ b, w });
graph[b].push_back({ a, w });
edges[i+1] = { a, b };
}
for(int &x : stores) cin >> x;
dfs(1, 0);
while(q--) {
int edge, city;
cin >> edge >> city;
int A = edges[edge].first;
int B = edges[edge].second;
if(in[A] < in[B]) swap(A, B);
if(anc(A, city) == anc(A, e)) {
cout << "escaped\n";
continue;
}
cout << 0 << '\n';
}
return 0;
}
Compilation message
valley.cpp: In function 'void dfs(int, int)':
valley.cpp:38:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
38 | for(auto &[v, w] : graph[u]) {
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
61 ms |
12880 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |