oj.uz

Submission #207134

# Submission time Handle Problem Language Result Execution time Memory
207134 2020-03-06T14:40:38 Z brcode Valley (BOI19_valley) C++14
100 / 100
 891 ms 61392 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5+5;
vector<pair<long long,long long>> v1[MAXN];
long long h[MAXN];
long long cities[MAXN];
long long distroot[MAXN];
long long p[MAXN];
long long dp[MAXN][25];
long long nearest[MAXN];
long long dp2[MAXN][25];
vector<pair<long long,long long>> edges;
void dfs(long long curr,long long par){
    //cout<<curr<<endl;
    if(curr!=par){
        h[curr] = h[par]+1;
        
    }
    
    if(cities[curr]){
        nearest[curr] = 0;
    }else{
        nearest[curr] = 1e18;
    }
    p[curr] = par;
    dp[curr][0] = par;
    for(auto x:v1[curr]){
        if(x.first!=par){
            distroot[x.first] = distroot[curr]+ x.second;
           dfs(x.first,curr);  
           nearest[curr] = min(nearest[curr],nearest[x.first]+x.second);
           
        }
        
        
    }
    for(auto x:v1[curr]){
        if(x.first!=par){
           
          dp2[x.first][0] = min(nearest[x.first],nearest[curr]+x.second);
           
        }
        
        
    }
    
}
bool isanc(long long x,long long y){
    for(long long j=20;j>=0;j--){
        if(h[dp[x][j]]>=h[y]){
            x = dp[x][j];
        }
    }
    return x == y;
}
long long dist(long long x,long long y){
    return distroot[x]-distroot[y];
}
long long jump(long long x,long long y){
    long long ans = nearest[x];
    long long og = x;
    for(long long j=20;j>=0;j--){
        if(h[dp[x][j]]>=h[y]){
            
            ans = min(ans,dp2[x][j]+dist(og,x));
            //cout<<x<<" "<<dp2[x][j]<<endl;
            x = dp[x][j];
            //cout<<ans<<endl;
        }
        
    }
    return ans;
}

int main() {
    long long n,s,q,e;
    edges.push_back(make_pair(0,0));
    cin>>n>>s>>q>>e;
    for(long long i=1;i<n;i++){
        long long x,y,w;
        cin>>x>>y>>w;
        v1[x].push_back(make_pair(y,w));
        v1[y].push_back(make_pair(x,w));
        edges.push_back(make_pair(x,y));
    }
    for(long long i=1;i<=s;i++){
        long long x;
        cin>>x;
        cities[x] = 1;
    }
    
    for(long long i=0;i<=20;i++){
        for(long long j=1;j<=n;j++){
            dp[j][i] = -1;
            dp2[j][i] = 1e18;
        }
    }
    dfs(e,e);
   for(long long i=1;i<=n;i++){
      // cout<<dp2[i][0]<<endl;
   }
    for(long long i=1;i<=20;i++){
        for(long long j=1;j<=n;j++){
            if(dp[j][i-1] == -1){
                dp[j][i] = -1;
            }else{
                dp[j][i] = dp[dp[j][i-1]][i-1];
            }
        }
    }
    for(long long i=1;i<=20;i++){
        for(long long j=1;j<=n;j++){
            if(dp[j][i-1] == -1){
                dp2[j][i] = 1e18;
            }else{
                dp2[j][i] = min(dp2[j][i-1],dp2[dp[j][i-1]][i-1]+dist(j,dp[j][i-1]));
            }
        }
    }
   
    while(q--){
        long long ind,r;
        cin>>ind>>r;
        long long x = edges[ind].first;
        long long y = edges[ind].second;
        if(h[x]>h[y]){
            swap(x,y);
        }
        if(isanc(r,x) && isanc(r,y)){
            
            if(jump(r,y) == 1e18){
                cout<<"oo"<<endl;
            }else{
                
                cout<<jump(r,y)<<endl;
            }
        }else{
            cout<<"escaped"<<endl;
        }
    }
    
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2808 KB Output is correct
2 Correct 34 ms 2808 KB Output is correct
3 Correct 35 ms 2936 KB Output is correct
4 Correct 36 ms 3064 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2808 KB Output is correct
2 Correct 34 ms 2808 KB Output is correct
3 Correct 35 ms 2936 KB Output is correct
4 Correct 36 ms 3064 KB Output is correct
5 Correct 11 ms 3320 KB Output is correct
6 Correct 13 ms 3192 KB Output is correct
7 Correct 12 ms 3320 KB Output is correct
8 Correct 11 ms 3192 KB Output is correct
9 Correct 11 ms 3192 KB Output is correct
10 Correct 11 ms 3192 KB Output is correct
11 Correct 12 ms 3320 KB Output is correct
12 Correct 11 ms 3192 KB Output is correct
13 Correct 11 ms 3320 KB Output is correct
14 Correct 11 ms 3320 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 706 ms 53160 KB Output is correct
2 Correct 728 ms 56940 KB Output is correct
3 Correct 751 ms 57020 KB Output is correct
4 Correct 813 ms 58980 KB Output is correct
5 Correct 776 ms 59220 KB Output is correct
6 Correct 891 ms 61224 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2808 KB Output is correct
2 Correct 34 ms 2808 KB Output is correct
3 Correct 35 ms 2936 KB Output is correct
4 Correct 36 ms 3064 KB Output is correct
5 Correct 11 ms 3320 KB Output is correct
6 Correct 13 ms 3192 KB Output is correct
7 Correct 12 ms 3320 KB Output is correct
8 Correct 11 ms 3192 KB Output is correct
9 Correct 11 ms 3192 KB Output is correct
10 Correct 11 ms 3192 KB Output is correct
11 Correct 12 ms 3320 KB Output is correct
12 Correct 11 ms 3192 KB Output is correct
13 Correct 11 ms 3320 KB Output is correct
14 Correct 11 ms 3320 KB Output is correct
15 Correct 706 ms 53160 KB Output is correct
16 Correct 728 ms 56940 KB Output is correct
17 Correct 751 ms 57020 KB Output is correct
18 Correct 813 ms 58980 KB Output is correct
19 Correct 776 ms 59220 KB Output is correct
20 Correct 891 ms 61224 KB Output is correct
21 Correct 656 ms 55780 KB Output is correct
22 Correct 655 ms 55652 KB Output is correct
23 Correct 705 ms 55780 KB Output is correct
24 Correct 773 ms 57980 KB Output is correct
25 Correct 806 ms 61028 KB Output is correct
26 Correct 656 ms 56204 KB Output is correct
27 Correct 670 ms 55780 KB Output is correct
28 Correct 696 ms 56164 KB Output is correct
29 Correct 766 ms 57764 KB Output is correct
30 Correct 822 ms 59416 KB Output is correct
31 Correct 636 ms 56688 KB Output is correct
32 Correct 678 ms 56444 KB Output is correct
33 Correct 709 ms 56676 KB Output is correct
34 Correct 773 ms 58696 KB Output is correct
35 Correct 809 ms 61392 KB Output is correct
36 Correct 737 ms 58596 KB Output is correct