oj.uz

Submission #923073

# Submission time Handle Problem Language Result Execution time Memory
923073 2024-02-06T14:16:44 Z Aiperiii Valley (BOI19_valley) C++14
100 / 100
 326 ms 54148 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
vector <pair <int,int > > g[N];
int d[N],par[N],jmp[N][20],dis[N],shop[N],dis2[N],jmp_mn[N][20];
void dfs(int v,int p){
   par[v]=p;
   for(auto to : g[v]){
      if(to.ff!=p){
         dis[to.ff]=dis[v]+to.ss;
         d[to.ff]=d[v]+1;
         dfs(to.ff,v);
      }
   }
}
void dfs2(int v,int p){
   for(auto to : g[v]){
      if(to.ff!=p)dfs2(to.ff,v);
   }
   if(shop[v])dis2[v]=dis[v];
   dis2[p]=min(dis2[p],dis2[v]);
}
int lca(int a,int b){
   if(d[a]<d[b])swap(a,b);
   for(int i=19;i>=0;i--){
      if(d[jmp[a][i]]>=d[b]){
         a=jmp[a][i];
      }
   }
   if(a==b)return a;
   for(int i=19;i>=0;i--){
      if(jmp[a][i]!=jmp[b][i]){
         a=jmp[a][i];
         b=jmp[b][i];
      }
   }
   return par[a];
}
signed main(){
   ios_base::sync_with_stdio();
   cin.tie(0);cout.tie(0);
   int n,s,q,e;
   cin>>n>>s>>q>>e;
   vector <int> mag(s),a(n),b(n),c(n);
   for(int i=0;i<n-1;i++){
      cin>>a[i]>>b[i]>>c[i];
      g[a[i]].pb({b[i],c[i]});
      g[b[i]].pb({a[i],c[i]});
   }
   dfs(e,0);
   
   for(int i=0;i<s;i++){
      cin>>mag[i];
      shop[mag[i]]=1;
   }
   for(int i=1;i<=n;i++){
      dis2[i]=1e18;
   }
   dfs2(e,0);
   for(int i=1;i<=n;i++){
      if(dis2[i]!=1e18)dis2[i]-=2*dis[i];
      
   }
   par[e]=e;
   for(int i=1;i<=n;i++){
      jmp[i][0]=par[i];
      jmp_mn[i][0]=dis2[par[i]];
   }
   for(int j=1;j<20;j++){
      for(int i=1;i<=n;i++){
         jmp[i][j]=jmp[jmp[i][j-1]][j-1];
         jmp_mn[i][j]=min(jmp_mn[i][j-1],jmp_mn[jmp[i][j-1]][j-1]);
      }
   }
   
   while(q--){
      int ind,x;
      cin>>ind>>x;
      ind--;
      int u=a[ind];
      int v=b[ind];
      if(d[u]<d[v])swap(u,v);
      if(lca(u,x)!=u)cout<<"escaped\n";
      else{
         int ans=dis[x],mn=dis2[x];
         for(int i=19;i>=0;i--){
            if(d[jmp[x][i]]>=d[u]){
               mn=min(mn,jmp_mn[x][i]);
               x=jmp[x][i];
            }
         }
         mn=min(mn,dis2[x]);
         if(mn==1e18)cout<<"oo\n";
         else cout<<ans+mn<<"\n";
      }
   }
}
/*

 */

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2904 KB Output is correct
2 Correct 6 ms 2908 KB Output is correct
3 Correct 6 ms 2908 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2904 KB Output is correct
2 Correct 6 ms 2908 KB Output is correct
3 Correct 6 ms 2908 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct
5 Correct 3 ms 3164 KB Output is correct
6 Correct 4 ms 3160 KB Output is correct
7 Correct 3 ms 3160 KB Output is correct
8 Correct 3 ms 3164 KB Output is correct
9 Correct 3 ms 3100 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 3 ms 3164 KB Output is correct
12 Correct 3 ms 3164 KB Output is correct
13 Correct 3 ms 3144 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 50696 KB Output is correct
2 Correct 232 ms 50492 KB Output is correct
3 Correct 255 ms 50736 KB Output is correct
4 Correct 276 ms 52328 KB Output is correct
5 Correct 252 ms 52356 KB Output is correct
6 Correct 326 ms 54148 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2904 KB Output is correct
2 Correct 6 ms 2908 KB Output is correct
3 Correct 6 ms 2908 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct
5 Correct 3 ms 3164 KB Output is correct
6 Correct 4 ms 3160 KB Output is correct
7 Correct 3 ms 3160 KB Output is correct
8 Correct 3 ms 3164 KB Output is correct
9 Correct 3 ms 3100 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 3 ms 3164 KB Output is correct
12 Correct 3 ms 3164 KB Output is correct
13 Correct 3 ms 3144 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct
15 Correct 245 ms 50696 KB Output is correct
16 Correct 232 ms 50492 KB Output is correct
17 Correct 255 ms 50736 KB Output is correct
18 Correct 276 ms 52328 KB Output is correct
19 Correct 252 ms 52356 KB Output is correct
20 Correct 326 ms 54148 KB Output is correct
21 Correct 196 ms 48520 KB Output is correct
22 Correct 215 ms 48548 KB Output is correct
23 Correct 222 ms 48632 KB Output is correct
24 Correct 251 ms 50256 KB Output is correct
25 Correct 294 ms 52708 KB Output is correct
26 Correct 199 ms 48892 KB Output is correct
27 Correct 231 ms 48776 KB Output is correct
28 Correct 236 ms 49052 KB Output is correct
29 Correct 267 ms 50260 KB Output is correct
30 Correct 286 ms 51536 KB Output is correct
31 Correct 218 ms 49492 KB Output is correct
32 Correct 229 ms 49452 KB Output is correct
33 Correct 236 ms 49736 KB Output is correct
34 Correct 282 ms 51236 KB Output is correct
35 Correct 262 ms 53584 KB Output is correct
36 Correct 240 ms 51332 KB Output is correct