oj.uz

답안 #801954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
801954 2023-08-02T08:40:58 Z Soumya1 Valley (BOI19_valley) C++17
100 / 100
 187 ms 42812 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
  #include <debug_local.h>
#endif
using namespace std;
const int mxN = 1e5 + 5;
const int lg = 20;
const long long inf = 1e18;
vector<tuple<int, int, int>> ad[mxN];
bool on[mxN];
int lower[mxN], level[mxN], in[mxN], out[mxN], timer, par[mxN][lg];
long long dist[mxN], depth[mxN];
long long st[mxN][lg];
void dfs(int u, int p) {
  in[u] = ++timer;
  if (on[u]) dist[u] = 0;
  par[u][0] = p;
  for (auto [v, w, i] : ad[u]) {
    if (v == p) continue;
    lower[i] = v;
    depth[v] = depth[u] + w;
    level[v] = level[u] + 1;
    dfs(v, u);
    dist[u] = min(dist[u], dist[v] + w);
  }
  out[u] = timer;
}
void build_ST_dfs(int u, int p) {
  st[u][0] = (dist[u] == inf ? inf : dist[u] - depth[u]);
  for (int i = 1; i < lg; i++) {
    par[u][i] = par[par[u][i - 1]][i - 1];
    st[u][i] = min(st[u][i - 1], st[par[u][i - 1]][i - 1]);
  }
  for (auto [v, w, i] : ad[u]) {
    if (v == p) continue;
    build_ST_dfs(v, u);
  }
}
void testCase() {
  int n, s, q, e;
  cin >> n >> s >> q >> e;
  for (int i = 1; i <= n; i++) {
    dist[i] = inf;
  }
  for (int i = 0; i < n - 1; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    ad[u].push_back({v, w, i + 1});
    ad[v].push_back({u, w, i + 1});
  }
  for (int i = 0; i < s; i++) {
    int u;
    cin >> u;
    on[u] = 1;
  }
  dfs(e, e);
  build_ST_dfs(e, e);
  while (q--) {
    int i, r;
    cin >> i >> r;
    int t = lower[i];
    if (in[t] <= in[r] && out[r] <= out[t]) {
      long long ans = inf;
      int k = level[r] - level[t] + 1;
      int init_r = r;
      for (int i = lg - 1; i >= 0; i--) {
        if (k >> i & 1) ans = min(ans, st[r][i]), r = par[r][i];
      }
      if (ans == inf) cout << "oo\n";
      else cout << ans + depth[init_r] << "\n";
    } else {
      cout << "escaped\n";
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 3 ms 2824 KB Output is correct
3 Correct 3 ms 2820 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 3 ms 2824 KB Output is correct
3 Correct 3 ms 2820 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 2952 KB Output is correct
6 Correct 3 ms 3012 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 2948 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 2 ms 3088 KB Output is correct
11 Correct 2 ms 3028 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 2 ms 3004 KB Output is correct
14 Correct 2 ms 2984 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 38332 KB Output is correct
2 Correct 126 ms 37952 KB Output is correct
3 Correct 127 ms 37852 KB Output is correct
4 Correct 157 ms 39852 KB Output is correct
5 Correct 140 ms 39996 KB Output is correct
6 Correct 187 ms 42072 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 3 ms 2824 KB Output is correct
3 Correct 3 ms 2820 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 2952 KB Output is correct
6 Correct 3 ms 3012 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 2948 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 2 ms 3088 KB Output is correct
11 Correct 2 ms 3028 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 2 ms 3004 KB Output is correct
14 Correct 2 ms 2984 KB Output is correct
15 Correct 118 ms 38332 KB Output is correct
16 Correct 126 ms 37952 KB Output is correct
17 Correct 127 ms 37852 KB Output is correct
18 Correct 157 ms 39852 KB Output is correct
19 Correct 140 ms 39996 KB Output is correct
20 Correct 187 ms 42072 KB Output is correct
21 Correct 113 ms 37664 KB Output is correct
22 Correct 136 ms 37224 KB Output is correct
23 Correct 124 ms 37112 KB Output is correct
24 Correct 132 ms 39628 KB Output is correct
25 Correct 155 ms 42812 KB Output is correct
26 Correct 99 ms 37760 KB Output is correct
27 Correct 108 ms 37324 KB Output is correct
28 Correct 113 ms 37348 KB Output is correct
29 Correct 132 ms 38852 KB Output is correct
30 Correct 155 ms 40472 KB Output is correct
31 Correct 116 ms 37920 KB Output is correct
32 Correct 111 ms 37456 KB Output is correct
33 Correct 123 ms 37444 KB Output is correct
34 Correct 149 ms 39484 KB Output is correct
35 Correct 185 ms 42712 KB Output is correct
36 Correct 136 ms 40012 KB Output is correct