oj.uz

Submission #590984

# Submission time Handle Problem Language Result Execution time Memory
590984 2022-07-06T16:48:35 Z Shin Valley (BOI19_valley) C++14
100 / 100
 262 ms 41320 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()
 
using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}
 
const int N = 1e5 + 7;
const int LOG = 20;
 
int n, num_shop, q, ec;
int tin[N];
int tout[N];
bool shop[N];
long long jump[N][LOG + 1];
int par[N][LOG + 1];
 
long long dp[N];
long long dist[N];
vector<pair<int, int>> adj[N];
pair<int, int> e[N];
 
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> num_shop >> q >> ec;
  for (int i = 1; i < n; i ++) {
    int u, v, w; cin >> u >> v >> w;
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
    e[i] = mp(u, v);
  }
  for (int i = 1; i <= num_shop; i ++) {
    int u; cin >> u;
    shop[u] = true;
  }
  
  int timer = 0;
  const long long inf = 1e18 + 7;
  function<void(int, int)> dfs_dist = [&](int u, int p) {
    if (!shop[u]) {
      dp[u] = inf;
    } else {
      dp[u] = dist[u];
    }
    par[u][0] = p;
    for (int i = 1; i <= LOG; i ++) {
      par[u][i] = par[par[u][i - 1]][i - 1];
    }
    tin[u] = ++ timer;
    for (pair<int, int> v: adj[u]) if (v.fi != p)  {
      dist[v.fi] = dist[u] + v.se;
      dfs_dist(v.fi, u);
      minimize(dp[u], dp[v.fi]);
    }
    tout[u] = timer;
  };
 
  function<void(int, int)> dfs = [&](int u, int p) {
    if (dp[u] != inf) {
      dp[u] -= 2 * dist[u];
    }
    jump[u][0] = dp[u];
    for (int i = 1; i <= LOG; i ++) {
      jump[u][i] = min(jump[u][i - 1], jump[par[u][i - 1]][i - 1]);
    }
    for (pair<int, int> v: adj[u]) if (v.fi != p) {
      dfs(v.fi, u);
    }
  };
  
  auto anc = [&](int u, int v) -> bool {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
  };
 
  dfs_dist(ec, ec);
  dfs(ec, ec);
  while (q --) {
    int i, u; cin >> i >> u;
    if (dist[e[i].fi] < dist[e[i].se]) {
      swap(e[i].fi, e[i].se);
    }
    int p = e[i].fi;
    if (!anc(p, u)) {
      cout << "escaped\n";
    } else {
      long long add = dist[u];
      long long res = add + dp[u];
      for (int j = LOG; j >= 0; j --) {
        long long x = par[u][j];
        if (anc(p, x)) {
          minimize(res, add + jump[u][j]);
          u = x;
        }
      }
      minimize(res, add + dp[u]);
      if (res >= inf) {
        cout << "oo\n";
      } else {
        cout << res << '\n';
      }
    }
  }
  return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2772 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2772 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 3 ms 2984 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 3 ms 3028 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 3 ms 3028 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 35064 KB Output is correct
2 Correct 169 ms 34696 KB Output is correct
3 Correct 182 ms 34680 KB Output is correct
4 Correct 223 ms 37188 KB Output is correct
5 Correct 168 ms 37304 KB Output is correct
6 Correct 225 ms 40084 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2772 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 3 ms 2984 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 3 ms 3028 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 3 ms 3028 KB Output is correct
15 Correct 145 ms 35064 KB Output is correct
16 Correct 169 ms 34696 KB Output is correct
17 Correct 182 ms 34680 KB Output is correct
18 Correct 223 ms 37188 KB Output is correct
19 Correct 168 ms 37304 KB Output is correct
20 Correct 225 ms 40084 KB Output is correct
21 Correct 156 ms 35032 KB Output is correct
22 Correct 155 ms 34636 KB Output is correct
23 Correct 168 ms 34632 KB Output is correct
24 Correct 240 ms 37484 KB Output is correct
25 Correct 224 ms 41320 KB Output is correct
26 Correct 162 ms 35136 KB Output is correct
27 Correct 161 ms 34736 KB Output is correct
28 Correct 176 ms 34780 KB Output is correct
29 Correct 215 ms 36652 KB Output is correct
30 Correct 231 ms 38596 KB Output is correct
31 Correct 172 ms 35076 KB Output is correct
32 Correct 164 ms 34776 KB Output is correct
33 Correct 195 ms 34904 KB Output is correct
34 Correct 213 ms 37392 KB Output is correct
35 Correct 262 ms 41244 KB Output is correct
36 Correct 222 ms 38000 KB Output is correct