제출 #905198

#제출 시각아이디문제언어결과실행 시간메모리
905198VMaksimoski008Valley (BOI19_valley)C++14
23 / 100
93 ms16792 KiB
#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, q, e; vector<vector<pii> > graph; vector<int> stores, in, out; vector<ll> dist; int timer = 0; void euler(int u, int p) { in[u] = timer++; for(auto &[v, w] : graph[u]) { if(v == p) continue; euler(v, u); } out[u] = timer; } void dfs(int u, int p) { for(auto &[v, w] : graph[u]) { if(v == p) continue; dist[v] = dist[u] + w; dfs(v, u); } } bool check(int S, int U) { return (in[S] <= in[U] && out[S] >= out[U]); } int32_t main() { setIO(); cin >> n >> s >> q >> e; graph.resize(n+1); in.resize(n+1); out.resize(n+1); dist.resize(n+1); stores.resize(s); vector<pii> edges; for(int i=0; i<n-1; i++) { int a, b, w; cin >> a >> b >> w; edges.push_back({ a, b }); graph[a].push_back({ b, w }); graph[b].push_back({ a, w }); } for(int &x : stores) cin >> x; euler(1, 0); while(q--) { int I, R; cin >> I >> R; int A = edges[I-1].first; int B = edges[I-1].second; if(in[A] < in[B]) swap(A, B); if(check(A, R) == check(A, e)) { cout << "escaped\n"; continue; } cout << "0\n"; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

valley.cpp: In function 'void euler(int, int)':
valley.cpp:39:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |     for(auto &[v, w] : graph[u]) {
      |               ^
valley.cpp: In function 'void dfs(int, int)':
valley.cpp:48:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |     for(auto &[v, w] : graph[u]) {
      |               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...