oj.uz

Submission #786770

# Submission time Handle Problem Language Result Execution time Memory
786770 2023-07-18T12:41:53 Z mgl_diamond Valley (BOI19_valley) C++17
100 / 100
 403 ms 51932 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

struct edge {
  int u, v, w;
  edge(int _u=0, int _v=0, int _w=0) : u(_u), v(_v), w(_w) {}
  int o(int t) { return u ^ v ^ t; }
};

const ll LINF = 1e18;
const int N = 1e5+5, LOG = 17, INF = 1e9;

int n, s, q, t;
bool shop[N];
vector<edge> e;
vector<int> graph[N];
int st[N], en[N], high[N], anc[N][LOG], cnt;
ll sum[N][LOG], best[N][LOG], dp[N];

void prep1(int u, int p) {
  st[u] = ++cnt;
  if (shop[u]) dp[u] = 0;
  else dp[u] = LINF;
  foru(i, 1, LOG-1) {
    anc[u][i] = anc[anc[u][i-1]][i-1];
    sum[u][i] = sum[u][i-1] + sum[anc[u][i-1]][i-1];
  } 
  fore(i, graph[u]) {
    int v = e[i].o(u);
    if (v == p) continue;
    anc[v][0] = u;
    sum[v][0] = e[i].w;
    high[v] = high[u] + 1;
    prep1(v, u);
    dp[u] = min(dp[u], dp[v] + e[i].w);
  }
  en[u] = cnt;
}

void prep2(int u, int p) {
  best[u][0] = min(dp[u], dp[anc[u][0]] + sum[u][0]);
  foru(i, 1, LOG-1) {
    best[u][i] = min(best[u][i-1], sum[u][i-1] + best[anc[u][i-1]][i-1]);
  }
  fore(i, graph[u]) {
    int v = e[i].o(u);
    if (v == p) continue;
    prep2(v, u);
  }
}

ll query(int u, int top) {
  ll sum_so_far = 0, ret = dp[u];
  ford(i, LOG-1, 0) {
    if (high[anc[u][i]] >= high[top]) {
      ret = min(ret, sum_so_far + best[u][i]);
      sum_so_far += sum[u][i];
      u = anc[u][i];
    }
  }
  return ret;
}

int main() {
  cin >> n >> s >> q >> t;
  foru(i, 2, n) {
    int u, v, w;
    cin >> u >> v >> w;
    graph[u].push_back(sz(e));
    graph[v].push_back(sz(e));
    e.emplace_back(u, v, w);
  }
  foru(i, 1, s) {
    int c;
    cin >> c;
    shop[c] = 1;
  }
  dp[0] = LINF;
  high[0] = -1;
  prep1(t, t);
  prep2(t, t);
  foru(r, 1, q) {
    int i, u;
    cin >> i >> u; --i;
    if (high[e[i].u] < high[e[i].v]) swap(e[i].u, e[i].v);
    int node = e[i].u;
    if (st[node] <= st[u] && st[u] <= en[node]) {
      ll ans = query(u, node);
      if (ans == LINF) cout << "oo\n";
      else cout << ans << "\n";
    } else cout << "escaped\n";
  }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2836 KB Output is correct
2 Correct 15 ms 2836 KB Output is correct
3 Correct 15 ms 2840 KB Output is correct
4 Correct 15 ms 2836 KB Output is correct
5 Correct 4 ms 3028 KB Output is correct
6 Correct 4 ms 3060 KB Output is correct
7 Correct 4 ms 3028 KB Output is correct
8 Correct 4 ms 3028 KB Output is correct
9 Correct 5 ms 3052 KB Output is correct
10 Correct 4 ms 3028 KB Output is correct
11 Correct 6 ms 3140 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 4 ms 3056 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 47048 KB Output is correct
2 Correct 357 ms 46716 KB Output is correct
3 Correct 353 ms 46680 KB Output is correct
4 Correct 382 ms 49092 KB Output is correct
5 Correct 353 ms 48832 KB Output is correct
6 Correct 403 ms 51460 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2836 KB Output is correct
2 Correct 15 ms 2836 KB Output is correct
3 Correct 15 ms 2840 KB Output is correct
4 Correct 15 ms 2836 KB Output is correct
5 Correct 4 ms 3028 KB Output is correct
6 Correct 4 ms 3060 KB Output is correct
7 Correct 4 ms 3028 KB Output is correct
8 Correct 4 ms 3028 KB Output is correct
9 Correct 5 ms 3052 KB Output is correct
10 Correct 4 ms 3028 KB Output is correct
11 Correct 6 ms 3140 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 4 ms 3056 KB Output is correct
15 Correct 330 ms 47048 KB Output is correct
16 Correct 357 ms 46716 KB Output is correct
17 Correct 353 ms 46680 KB Output is correct
18 Correct 382 ms 49092 KB Output is correct
19 Correct 353 ms 48832 KB Output is correct
20 Correct 403 ms 51460 KB Output is correct
21 Correct 314 ms 46360 KB Output is correct
22 Correct 322 ms 46076 KB Output is correct
23 Correct 333 ms 46068 KB Output is correct
24 Correct 353 ms 48500 KB Output is correct
25 Correct 357 ms 51872 KB Output is correct
26 Correct 307 ms 46400 KB Output is correct
27 Correct 319 ms 46124 KB Output is correct
28 Correct 337 ms 46096 KB Output is correct
29 Correct 366 ms 47840 KB Output is correct
30 Correct 374 ms 49592 KB Output is correct
31 Correct 312 ms 46472 KB Output is correct
32 Correct 322 ms 46208 KB Output is correct
33 Correct 342 ms 46260 KB Output is correct
34 Correct 358 ms 48496 KB Output is correct
35 Correct 371 ms 51932 KB Output is correct
36 Correct 338 ms 48364 KB Output is correct