Alpine valley

input/code.cpp: In function 'void dfs(int, int, int)':
input/code.cpp:16:30: warning: unused variable 'w' [-Wunused-variable]
   16 |         int j = p.first; int w = p.second;
      |                              ^
In file included from /usr/include/c++/11/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:33,
                 from input/code.cpp:1:
input/code.cpp: In function 'int main()':
input/code.cpp:58:24: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   58 |         assert(depth[b]=depth[a]+1);
      |                ~~~~~~~~^~~~~~~~~~~

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

const int N = 1e5+7;
vector<pair<int, ll>> v[N];
bool is_shop[N];
bool has_shop[N];
int e[N][20];
int depth[N];

void dfs(int i, int pr, int d){
    e[i][0] = pr;
    depth[i] = d;
    for(auto p : v[i]){
        int j = p.first; int w = p.second;
        if(j == pr) continue;
        dfs(j, i, d+1);
        if(has_shop[j]) has_shop[i] = true;
    }
}



int main(){
    cin.tie(0)->sync_with_stdio(0);

    int N, S, Q, E;
    cin >> N >> S >> Q >> E;
    vector<pair<int, int>> roads(N+3);
    for(int i = 1; i < N; i++){
        int A, B; ll W;
        cin >> A >> B >> W;
        v[A].push_back(make_pair(B, W));
        v[B].push_back(make_pair(A, W));
        roads[i] = make_pair(A, B);
    }
    for(int i = 0; i < S; i++){
        int x; cin >> x;
        is_shop[x] = true;
        has_shop[x] = true;
    }

    dfs(E, E, 0);

    for(int b = 1; b < 20; b++){
        for(int i = 1; i <= N; i++){
            e[i][b] = e[e[i][b-1]][b-1];
        }
    }

    for(int i = 0; i < Q; i++){
        int I, R;
        cin >> I >> R;
        int a = roads[I].first;
        int b = roads[I].second;
        if(depth[a] > depth[b]) swap(a, b);
        assert(depth[b]=depth[a]+1);

        bool impossible = false;
        if(depth[R] >= depth[b]){
            int k = depth[R] - depth[b];
            int r = R;
            int jmp = 0;
            while(k){
                if(k & 1) r = e[r][jmp];
                jmp++;
                k >>= 1;
            }
            
            if(r == b) impossible = true;
        }
        if(!impossible){
            cout << "escaped\n";
            continue;
        }

        if(!has_shop[b]){
            cout << "oo\n";
            continue;
        }

        ll ans = -1;
        priority_queue<pair<ll, int>> q;
        vector<bool> visited(N+3);
        q.push(make_pair(0, R));
        while(q.size() > 0){
            auto p = q.top(); q.pop();
            int x = p.second;
            if(visited[x]) continue;
            visited[x] = true;
            int cost = -p.first;
            if(is_shop[x]){
                ans = cost;
                break;
            }

            for(auto pp : v[x]){
                int y = pp.first;
                int w = pp.second;
                if(x == b && y == a) continue;
                if(visited[y]) continue;
                q.push(make_pair(-(cost + w), y));
            }
        }

        cout << ans << "\n";
    }





}

Test 1

Group: 2, 4

Verdict: ACCEPTED

Test 2

Group: 2, 4

Verdict: ACCEPTED

Test 3

Group: 1, 4

Verdict: ACCEPTED

Test 4

Group: 1, 4

Verdict: WRONG ANSWER

Test 5

Group: 1, 4

Verdict: WRONG ANSWER

Test 6

Group: 1, 3, 4

Verdict: ACCEPTED

Test 7

Group: 2, 4

Verdict: WRONG ANSWER

Test 8

Group: 2, 4

Verdict: WRONG ANSWER

Test 9

Group: 2, 4

Verdict: WRONG ANSWER

Test 10

Group: 2, 4

Verdict: ACCEPTED

Test 11

Group: 2, 4

Verdict: WRONG ANSWER

Test 12

Group: 2, 4

Verdict: WRONG ANSWER

Test 13

Group: 2, 3, 4

Verdict: ACCEPTED

Test 14

Group: 2, 3, 4

Verdict: ACCEPTED

Test 15

Group: 2, 3, 4

Verdict: ACCEPTED

Test 16

Group: 2, 4

Verdict: ACCEPTED

Test 17

Group: 3, 4

Verdict: ACCEPTED

Test 18

Group: 3, 4

Verdict: ACCEPTED

Test 19

Group: 3, 4

Verdict: ACCEPTED

Test 20

Group: 3, 4

Verdict: ACCEPTED

Test 21

Group: 3, 4

Verdict: ACCEPTED

Test 22

Group: 3, 4

Verdict: ACCEPTED

Test 23

Group: 4

Verdict: WRONG ANSWER

Test 24

Group: 4

Verdict: WRONG ANSWER

Test 25

Group: 4

Verdict: WRONG ANSWER

Test 26

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 4

Verdict: WRONG ANSWER

Test 29

Group: 4

Verdict: WRONG ANSWER

Test 30

Group: 4

Verdict: WRONG ANSWER

Test 31

Group: 4

Verdict: WRONG ANSWER

Test 32

Group: 4

Verdict: WRONG ANSWER

Test 33

Group: 4

Verdict: WRONG ANSWER

Test 34

Group: 4

Verdict: WRONG ANSWER

Test 35

Group: 4

Verdict: WRONG ANSWER

Test 36

Group: 4

Verdict: WRONG ANSWER

Test 37

Group: 4

Verdict: WRONG ANSWER

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED