oj.uz

Submission #697349

# Submission time Handle Problem Language Result Execution time Memory
697349 2023-02-09T11:46:17 Z manizare Valley (BOI19_valley) C++14
100 / 100
 259 ms 89988 KB 
#include <bits/stdc++.h> 
#define int long long 
#define pb push_back 
#define F first 
#define S second 
#define all(a) a.begin(),a.end() 
#define pii pair<int,int> 

using namespace std ;
const int maxn =  5e5 + 100  , mod = 1e9 + 7 , inf = 1e17 , lg= 23 ; 
int b[maxn] , dp[maxn][lg+10] , t[maxn] , mark[maxn] , wp[maxn] , ed[maxn] , par[maxn][lg+10] , st[maxn] , en[maxn] ;
int dis[maxn] , dis2[maxn];vector<pii> G[maxn] ; 
int cnt =1 , mark2[maxn] ; 
void dfs(int v){
  mark[v] = 1;
  int m1 = 0,  m2 = 0 ;
  b[v] = inf ;vector <int> vec ;
  st[v] = cnt ;cnt++ ;
  for(int i =0 ; i < G[v].size() ; i++){
    int u = G[v][i].F , w = G[v][i].S ;
    if(mark[u] == 1)continue ;
    vec.pb(u);
    wp[u] = w ; 
    par[u][0] = v ; 
    dis[u] = dis[v]+ w ;
    dis2[u] = dis2[v] +1 ; 
    dfs(u) ;
    if(m1 == 0 || (b[u] + wp[u]) < (b[m1] + wp[m1])){
      swap(m1 , m2) ; 
      m1= u ;
    }else if(m2 == 0 || (b[u] + wp[u]) < (b[m2] + wp[m2])){
      m2 = u ;
    }
  }
  if(t[v] == 0){
  b[v] = b[m1] + wp[m1] ; 
  }else {
  b[v] = 0 ;
  m1 = m2 = -1;
  }
  for(int i =0 ; i < vec.size() ; i++){
    int u = vec[i]    ;
    int f = m1 ; 
    if(m1 == u)f =m2 ; 
    if(t[u] == 1){
      dp[u][0] = 0 ;
      continue ;
    }
    if(f==-1){
      dp[u][0] = wp[u] ;
      continue ;
    }
    dp[u][0] = min(wp[f] + wp[u] + b[f] , inf ) ;
 }
 en[v] = cnt ;cnt++ ;
}
vector <pii> vec ;

signed main(){
  ios_base::sync_with_stdio(false);cin.tie(0);
  int n , s , q , e ;
  cin >> n >> s>> q >> e ;
  for(int i =1; i <= n-1  ; i++){
    int v , u , w ;
    cin >> v >> u >> w ;
    G[v].pb({u,w}) ;
    G[u].pb({v,w}) ;vec.pb({v , u}) ;
  }
  for(int i =1 ; i <= s ; i++){
    int f ;cin >> f; 
    t[f] = 1; 
  }
  b[0] = inf ;
  dfs(e) ;
  for(int j = 1 ; j <= lg; j++){
    for(int i =1 ; i <= n ; i++){
      par[i][j] = par[par[i][j-1]][j-1] ;
      int x = par[i][j-1] ; 
      dp[i][j] = (((dis[i] - dis[x] + dp[x][j-1]) < dp[i][j-1]) ? (dis[i] - dis[x] + dp[x][j-1]) :  dp[i][j-1] );
    }
  }
  while(q--){
    int id , k ;
    cin >> id >> k ;
    int v = vec[id-1].F , u =vec[id-1].S ;
    if(dis[v] < dis[u])swap(v , u) ;
    if(!(st[k] >= st[v] && en[k] <= en[v])){
      cout << "escaped\n" ;
      continue ;
    }
    int ans = b[k]  ; 
    int x = dis2[k] - dis2[v] ; 
    int k1 = k ;
    for(int i = lg ; i >=0 ; i--){
      if(x>>i&1){
        if(ans > (dis[k1] - dis[k] + dp[k][i])){
          ans = (dis[k1] - dis[k] + dp[k][i]) ;
        }
        k = par[k][i] ; 
      }
    }
    if(ans >= inf){
      cout << "oo\n";
      continue ;
    }
    cout << ans << "\n" ;
  }
}

Compilation message

valley.cpp: In function 'void dfs(long long int)':
valley.cpp:19:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   for(int i =0 ; i < G[v].size() ; i++){
      |                  ~~^~~~~~~~~~~~~
valley.cpp:41:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for(int i =0 ; i < vec.size() ; i++){
      |                  ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 8 ms 12344 KB Output is correct
3 Correct 9 ms 12344 KB Output is correct
4 Correct 9 ms 12344 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 8 ms 12344 KB Output is correct
3 Correct 9 ms 12344 KB Output is correct
4 Correct 9 ms 12344 KB Output is correct
5 Correct 8 ms 12832 KB Output is correct
6 Correct 10 ms 12736 KB Output is correct
7 Correct 8 ms 12756 KB Output is correct
8 Correct 8 ms 12728 KB Output is correct
9 Correct 8 ms 12756 KB Output is correct
10 Correct 7 ms 12756 KB Output is correct
11 Correct 7 ms 12756 KB Output is correct
12 Correct 8 ms 12788 KB Output is correct
13 Correct 8 ms 12792 KB Output is correct
14 Correct 7 ms 12756 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 77324 KB Output is correct
2 Correct 182 ms 77240 KB Output is correct
3 Correct 202 ms 77420 KB Output is correct
4 Correct 227 ms 80912 KB Output is correct
5 Correct 200 ms 80796 KB Output is correct
6 Correct 259 ms 85292 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 8 ms 12344 KB Output is correct
3 Correct 9 ms 12344 KB Output is correct
4 Correct 9 ms 12344 KB Output is correct
5 Correct 8 ms 12832 KB Output is correct
6 Correct 10 ms 12736 KB Output is correct
7 Correct 8 ms 12756 KB Output is correct
8 Correct 8 ms 12728 KB Output is correct
9 Correct 8 ms 12756 KB Output is correct
10 Correct 7 ms 12756 KB Output is correct
11 Correct 7 ms 12756 KB Output is correct
12 Correct 8 ms 12788 KB Output is correct
13 Correct 8 ms 12792 KB Output is correct
14 Correct 7 ms 12756 KB Output is correct
15 Correct 168 ms 77324 KB Output is correct
16 Correct 182 ms 77240 KB Output is correct
17 Correct 202 ms 77420 KB Output is correct
18 Correct 227 ms 80912 KB Output is correct
19 Correct 200 ms 80796 KB Output is correct
20 Correct 259 ms 85292 KB Output is correct
21 Correct 172 ms 79928 KB Output is correct
22 Correct 190 ms 79800 KB Output is correct
23 Correct 189 ms 79924 KB Output is correct
24 Correct 228 ms 83972 KB Output is correct
25 Correct 240 ms 89516 KB Output is correct
26 Correct 168 ms 80268 KB Output is correct
27 Correct 179 ms 80224 KB Output is correct
28 Correct 194 ms 80444 KB Output is correct
29 Correct 213 ms 82800 KB Output is correct
30 Correct 230 ms 85688 KB Output is correct
31 Correct 178 ms 80828 KB Output is correct
32 Correct 178 ms 80700 KB Output is correct
33 Correct 195 ms 80984 KB Output is correct
34 Correct 227 ms 84468 KB Output is correct
35 Correct 221 ms 89988 KB Output is correct
36 Correct 206 ms 84548 KB Output is correct