oj.uz

Submission #540881

# Submission time Handle Problem Language Result Execution time Memory
540881 2022-03-21T22:37:58 Z skittles1412 Valley (BOI19_valley) C++17
100 / 100
 188 ms 51976 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
	cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
	cerr << t << " | ";
	dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                           \
	cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
		 << ": ";                                          \
	dbgh(__VA_ARGS__)
#else
#define cerr   \
	if (false) \
	cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

const int maxn = 1e5 + 5, logn = 20;

bool village[maxn];
int t, tin[maxn], tout[maxn], blift[logn][maxn];
long st[maxn], dist[logn][maxn], bliftv[logn][maxn];
vector<pair<int, long>> graph[maxn];

long dfs(int u, int par = -1) {
	tin[u] = t++;
	blift[0][u] = par;
	long ans = 1e18;
	if (village[u]) {
		ans = 0;
	}
	for (auto& [v, w] : graph[u]) {
		if (v != par) {
			dist[0][v] = w;
			ans = min(ans, w + dfs(v, u));
		}
	}
	tout[u] = t++;
	return bliftv[0][u] = st[u] = ans;
}

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

void solve() {
	int n, s, q, e;
	cin >> n >> s >> q >> e;
	e--;
	int edges[n - 1][2];
	for (auto& [u, v] : edges) {
		int w;
		cin >> u >> v >> w;
		u--;
		v--;
		graph[u].emplace_back(v, w);
		graph[v].emplace_back(u, w);
	}
	for (int i = 0; i < s; i++) {
		int u;
		cin >> u;
		u--;
		village[u] = true;
	}
	dfs(e);
	for (int i = 1; i < logn; i++) {
		for (int j = 0; j < n; j++) {
			int v = blift[i - 1][j];
			if (v != -1) {
				blift[i][j] = blift[i - 1][v];
				dist[i][j] = dist[i - 1][j] + dist[i - 1][v];
				bliftv[i][j] = min(bliftv[i - 1][j], dist[i - 1][j] + bliftv[i - 1][v]);
			} else {
				blift[i][j] = -1;
			}
		}
	}
	dbg(bliftv[0][6]);
	while (q--) {
		int road, x;
		cin >> road >> x;
		road--;
		x--;
		auto [u, v] = edges[road];
		if (anc(u, x) && anc(v, x)) {
			if (anc(v, u)) {
				swap(u, v);
			}
			if (st[v] >= long(1e18)) {
				cout << "oo" << endl;
				continue;
			}
			long ans = 1e18, cd = 0;
			for (int i = logn - 1; i >= 0; i--) {
				int y = blift[i][x];
				if (y != -1 && (anc(v, y) || v == y)) {
					ans = min(ans, cd + bliftv[i][x]);
					cd += dist[i][x];
					x = y;
				}
			}
			ans = min(ans, cd + st[v]);
			cout << ans << endl;
		} else {
			cout << "escaped" << endl;
		}
	}
}

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cin.exceptions(ios::failbit);
	solve();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 28108 KB Output is correct
2 Correct 126 ms 29708 KB Output is correct
3 Correct 143 ms 37476 KB Output is correct
4 Correct 169 ms 48204 KB Output is correct
5 Correct 138 ms 47304 KB Output is correct
6 Correct 188 ms 51064 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2900 KB Output is correct
2 Correct 4 ms 3028 KB Output is correct
3 Correct 4 ms 2900 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 3072 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 3 ms 3156 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 3 ms 3028 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 3 ms 3200 KB Output is correct
14 Correct 3 ms 3156 KB Output is correct
15 Correct 115 ms 28108 KB Output is correct
16 Correct 126 ms 29708 KB Output is correct
17 Correct 143 ms 37476 KB Output is correct
18 Correct 169 ms 48204 KB Output is correct
19 Correct 138 ms 47304 KB Output is correct
20 Correct 188 ms 51064 KB Output is correct
21 Correct 91 ms 28096 KB Output is correct
22 Correct 99 ms 29984 KB Output is correct
23 Correct 109 ms 35904 KB Output is correct
24 Correct 118 ms 47496 KB Output is correct
25 Correct 164 ms 51940 KB Output is correct
26 Correct 90 ms 28104 KB Output is correct
27 Correct 101 ms 29644 KB Output is correct
28 Correct 123 ms 36008 KB Output is correct
29 Correct 147 ms 46820 KB Output is correct
30 Correct 169 ms 50084 KB Output is correct
31 Correct 95 ms 28108 KB Output is correct
32 Correct 121 ms 29644 KB Output is correct
33 Correct 121 ms 37688 KB Output is correct
34 Correct 160 ms 47572 KB Output is correct
35 Correct 157 ms 51976 KB Output is correct
36 Correct 147 ms 47840 KB Output is correct