oj.uz

Submission #886828

# Submission time Handle Problem Language Result Execution time Memory
886828 2023-12-13T03:05:59 Z Zero_OP Valley (BOI19_valley) C++14
100 / 100
 139 ms 42068 KB 
#include<bits/stdc++.h>

using namespace std;

#define range(v) begin(v), end(v)
#define compact(v) v.erase(unique(range(v)), end(v))

template<class T> bool minimize(T& a, T b){
  if(a > b) return a = b, true;
  return false;
}

template<class T> bool maximize(T& a, T b){
  if(a < b) return a = b, true;
  return false;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int N = 1e5 + 5;
const ll inf = 1e16;

int n, q, s, root, h[N],  lift[20][N], a[N], b[N], tin[N], tout[N], sz[N], timerDFS;
vector<pair<int, int>> g[N];
ll d[N], dp[N], rmq[20][N];

void dfsLCA(int u, int e){
  tin[u] = ++timerDFS;
  for(auto [v, w] : g[u]) if(v != e){
    h[v] = h[u] + 1;
    d[v] = d[u] + w;
    lift[0][v] = u;
    for(int i = 1; i <= 17; ++i){
      lift[i][v] = lift[i - 1][lift[i - 1][v]];
    }
    dfsLCA(v, u);
    minimize(dp[u], dp[v] + w);
    sz[u] += sz[v];
  }
  tout[u] = timerDFS;
}

void dfsRMQ(int u, int e){
  for(auto [v, w] : g[u]) if(v != e){
    rmq[0][v] = dp[u] - d[u];
    for(int i = 1; i <= 17; ++i){
      rmq[i][v] = min(rmq[i - 1][v], rmq[i - 1][lift[i - 1][v]]);
    }
    dfsRMQ(v, u);
  }
}

bool inSubtree(int u, int v){
  return tin[u] <= tin[v] and tout[v] <= tout[u];
}

ll getLift(int u, int d){
  ll ans = inf;
  for(int i = 17; i >= 0; --i){
    if(d >> i & 1){
      minimize(ans, rmq[i][u]);
      u = lift[i][u];
    }
  }
  return ans;
}

void Zero_OP(){
  cin >> n >> s >> q >> root;
  for(int i = 1; i < n; ++i){
    int u, v, c;
    cin >> u >> v >> c;
    g[u].push_back({v, c});
    g[v].push_back({u, c});
    a[i] = u, b[i] = v;
  }

  for(int i = 1; i <= n; ++i) dp[i] = inf;
  for(int i = 1; i <= s; ++i){
    int x; cin >> x;
    dp[x] = 0; sz[x] = 1;
  }

  dfsLCA(root, -1);
  dfsRMQ(root, -1);

  while(q--){
    int i, v;
    cin >> i >> v;

    int u = (h[a[i]] < h[b[i]] ? b[i] : a[i]);
    if(!inSubtree(u, v)) cout << "escaped\n";
    else {
      ll ans = min(dp[v], d[v] + getLift(v, h[v] - h[u]));
      if(ans == inf){
        cout << "oo\n";
      }
      else cout << ans << '\n';
    }
  }
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  if(fopen("antuvu.inp", "r")){
    freopen("antuvu.inp", "r", stdin);
    freopen("antuvu.out", "w", stdout);
  }

  Zero_OP();

  return 0;
}

Compilation message

valley.cpp: In function 'void dfsLCA(int, int)':
valley.cpp:31:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |   for(auto [v, w] : g[u]) if(v != e){
      |            ^
valley.cpp: In function 'void dfsRMQ(int, int)':
valley.cpp:46:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |   for(auto [v, w] : g[u]) if(v != e){
      |            ^
valley.cpp: In function 'int main()':
valley.cpp:110:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |     freopen("antuvu.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:111:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |     freopen("antuvu.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29188 KB Output is correct
2 Correct 5 ms 29276 KB Output is correct
3 Correct 5 ms 29276 KB Output is correct
4 Correct 5 ms 29276 KB Output is correct
5 Correct 4 ms 29276 KB Output is correct
6 Correct 4 ms 29276 KB Output is correct
7 Correct 5 ms 29276 KB Output is correct
8 Correct 4 ms 29272 KB Output is correct
9 Correct 4 ms 29276 KB Output is correct
10 Correct 4 ms 29280 KB Output is correct
11 Correct 5 ms 29276 KB Output is correct
12 Correct 5 ms 29248 KB Output is correct
13 Correct 4 ms 29236 KB Output is correct
14 Correct 4 ms 29276 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 34128 KB Output is correct
2 Correct 134 ms 33732 KB Output is correct
3 Correct 116 ms 33732 KB Output is correct
4 Correct 139 ms 35708 KB Output is correct
5 Correct 116 ms 35576 KB Output is correct
6 Correct 136 ms 37456 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29188 KB Output is correct
2 Correct 5 ms 29276 KB Output is correct
3 Correct 5 ms 29276 KB Output is correct
4 Correct 5 ms 29276 KB Output is correct
5 Correct 4 ms 29276 KB Output is correct
6 Correct 4 ms 29276 KB Output is correct
7 Correct 5 ms 29276 KB Output is correct
8 Correct 4 ms 29272 KB Output is correct
9 Correct 4 ms 29276 KB Output is correct
10 Correct 4 ms 29280 KB Output is correct
11 Correct 5 ms 29276 KB Output is correct
12 Correct 5 ms 29248 KB Output is correct
13 Correct 4 ms 29236 KB Output is correct
14 Correct 4 ms 29276 KB Output is correct
15 Correct 100 ms 34128 KB Output is correct
16 Correct 134 ms 33732 KB Output is correct
17 Correct 116 ms 33732 KB Output is correct
18 Correct 139 ms 35708 KB Output is correct
19 Correct 116 ms 35576 KB Output is correct
20 Correct 136 ms 37456 KB Output is correct
21 Correct 103 ms 37400 KB Output is correct
22 Correct 115 ms 37220 KB Output is correct
23 Correct 107 ms 37200 KB Output is correct
24 Correct 129 ms 39252 KB Output is correct
25 Correct 131 ms 42068 KB Output is correct
26 Correct 112 ms 37524 KB Output is correct
27 Correct 110 ms 37288 KB Output is correct
28 Correct 109 ms 37204 KB Output is correct
29 Correct 121 ms 38512 KB Output is correct
30 Correct 126 ms 39984 KB Output is correct
31 Correct 97 ms 37648 KB Output is correct
32 Correct 114 ms 37192 KB Output is correct
33 Correct 112 ms 37400 KB Output is correct
34 Correct 124 ms 38980 KB Output is correct
35 Correct 139 ms 41752 KB Output is correct
36 Correct 122 ms 39248 KB Output is correct