oj.uz

Submission #964458

# Submission time Handle Problem Language Result Execution time Memory
964458 2024-04-17T00:15:58 Z irmuun Valley (BOI19_valley) C++17
36 / 100
 3000 ms 12248 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,s,q,e;
    cin>>n>>s>>q>>e;
    vector<array<ll,3>>adj[n+5];
    vector<pair<ll,ll>>edge;
    for(ll i=1;i<n;i++){//edge
        ll a,b,w;
        cin>>a>>b>>w;
        adj[a].pb({b,w,i});
        adj[b].pb({a,w,i});
    }
    vector<bool>shop(n+5,0);
    for(ll i=1;i<=s;i++){//shop
        ll c;
        cin>>c;
        shop[c]=true;
    }
    while(q--){
        ll I,r;
        cin>>I>>r;
        bool can=false;
        ll mn=1e18,dist=0;
        function <void(ll,ll)> dfs=[&](ll x,ll p){
            if(x==e){
                can=true;
                return;
            }
            if(shop[x]==true){
                mn=min(mn,dist);
            }
            for(auto [y,w,j]:adj[x]){
                if(j!=I&&y!=p){
                    dist+=w;
                    dfs(y,x);
                    dist-=w;
                }
            }
        };
        dfs(r,-1);
        if(can){
            cout<<"escaped\n";
        }
        else if(mn<1e18){
            cout<<mn<<"\n";
        }
        else{
            cout<<"oo\n";
        }
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 564 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 10 ms 540 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 564 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 10 ms 540 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 11 ms 604 KB Output is correct
8 Correct 6 ms 500 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 11 ms 568 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 11 ms 612 KB Output is correct
14 Correct 10 ms 472 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3035 ms 12248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 564 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 10 ms 540 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 11 ms 604 KB Output is correct
8 Correct 6 ms 500 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 11 ms 568 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 11 ms 612 KB Output is correct
14 Correct 10 ms 472 KB Output is correct
15 Execution timed out 3035 ms 12248 KB Time limit exceeded
16 Halted 0 ms 0 KB -