oj.uz

Submission #859115

# Submission time Handle Problem Language Result Execution time Memory
859115 2023-10-09T18:12:16 Z NK_ Valley (BOI19_valley) C++17
100 / 100
 200 ms 48592 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
 
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 18;

using T = array<int, 3>;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N, M, Q, R; cin >> N >> M >> Q >> R; --R;

	V<V<T>> adj(N);
	for(int i = 0; i < N - 1; i++) {
		int u, v, w; cin >> u >> v >> w; --u, --v;
		adj[u].pb({v, w, i});
		adj[v].pb({u, w, i});
	}


	vi st(N), en(N), dep(N), E(N-1); vl dst(N), close(N, INFL);
	V<vl> mn(N, vl(LG, INFL)); V<vi> up(N, vi(LG));

	for(int i = 0; i < M; i++) {
		int u; cin >> u; --u; close[u] = 0;
	}

	int t = 0;
	function<void(int, int)> gen = [&](int u, int p) {
		st[u] = t++;

		for(auto& e : adj[u]) {
			auto [v, w, i] = e; if (v == p) continue;
			
			E[i] = v; dst[v] = dst[u] + w; dep[v] = dep[u] + 1;
			
			gen(v, u);

			close[u] = min(close[v] + w, close[u]);
		}
		
		en[u] = t-1;
	};

	dst[R] = dep[R] = 0; gen(R, -1);

	function<void(int, int)> dfs = [&](int u, int p) {
		mn[u][0] = close[u] - dst[u];
		up[u][0] = (p == -1 ? u : p);

		for(int i = 1; i < LG; i++) {
			up[u][i] = up[up[u][i-1]][i-1];
			mn[u][i] = min(mn[u][i-1], mn[up[u][i-1]][i-1]);
		}

		for(auto& e : adj[u]) {
			auto [v, w, i] = e; if (v == p) continue;

			dfs(v, u);
		}
	};

	dfs(R, -1);

	auto isAnc = [&](int a, int b) {
		return st[a] <= st[b] && en[b] <= en[a];
	};

	for(int i = 0; i < Q; i++) {
		int e, u; cin >> e >> u; --e, --u;
		int p = E[e];
		if (isAnc(p, u)) {
			int d = dep[u] - dep[p] + 1; ll D = dst[u], ans = INFL;

			for(int x = 0; x < LG; x++) if ((d >> x) & 1) {
				ans = min(ans, mn[u][x]);
				u = up[u][x];
			}

			ans += D;
			if (ans >= INFL) cout << "oo" << nl;
			else cout << ans << nl;

		} else cout << "escaped" << nl;
	}

	exit(0-0);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 43060 KB Output is correct
2 Correct 131 ms 42476 KB Output is correct
3 Correct 142 ms 42580 KB Output is correct
4 Correct 175 ms 45216 KB Output is correct
5 Correct 141 ms 44996 KB Output is correct
6 Correct 200 ms 47644 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 138 ms 43060 KB Output is correct
16 Correct 131 ms 42476 KB Output is correct
17 Correct 142 ms 42580 KB Output is correct
18 Correct 175 ms 45216 KB Output is correct
19 Correct 141 ms 44996 KB Output is correct
20 Correct 200 ms 47644 KB Output is correct
21 Correct 119 ms 42852 KB Output is correct
22 Correct 121 ms 42068 KB Output is correct
23 Correct 129 ms 42056 KB Output is correct
24 Correct 156 ms 44884 KB Output is correct
25 Correct 187 ms 48592 KB Output is correct
26 Correct 114 ms 42580 KB Output is correct
27 Correct 131 ms 42068 KB Output is correct
28 Correct 137 ms 42092 KB Output is correct
29 Correct 160 ms 43856 KB Output is correct
30 Correct 171 ms 45904 KB Output is correct
31 Correct 125 ms 42780 KB Output is correct
32 Correct 127 ms 42068 KB Output is correct
33 Correct 136 ms 42160 KB Output is correct
34 Correct 163 ms 44628 KB Output is correct
35 Correct 181 ms 48328 KB Output is correct
36 Correct 179 ms 45140 KB Output is correct