oj.uz

Submission #667167

# Submission time Handle Problem Language Result Execution time Memory
667167 2022-11-30T15:56:52 Z Kahou Valley (BOI19_valley) C++14
100 / 100
 201 ms 26052 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 1e5 + 50;
int n, s, q, r, h[N], st[N], ft[N], t;
ll dis[N];
ll dp[N];
bool mark[N];
pii E[N];
vector<pii> adj[N];
vector<pii> vc[N];
ll out[N];
ll seg[N<<2];

void dfs(int u, int p) {
	st[u] = ++t;
	h[u] = h[p]+1;
	dp[u] = 1e18;
	if (mark[u]) dp[u] = 0;

	for (pii x:adj[u]) {
		int v = x.F, w = x.S;
		if (v == p) continue;
		dis[v] = dis[u] + w;
		dfs(v, u);
		dp[u] = min(dp[u], dp[v] + w);
	}
	ft[u] = t;
}

void build(int u, int tl, int tr) {
	if (tl == tr) {
		seg[u] = 1e18;
		return;
	}
	int md = (tl+tr)>>1;
	int lc = u<<1;
	int rc = u<<1|1;
	build(lc, tl, md), build(rc, md+1, tr);
	seg[u] = min(seg[lc], seg[rc]);
}
ll query(int u, int tl, int tr, int l, int r) {
	if (r < tl || tr < l) return 1e18;
	if (l <= tl && tr <= r) {
		return seg[u];
	}
	int md = (tl+tr)>>1;
	int lc = u<<1;
	int rc = u<<1|1;
	return min(query(lc, tl, md, l, r), query(rc, md+1, tr, l, r));
}
void upd(int u, int tl, int tr, int id, ll x) {
	if (tl == tr) {
		seg[u] = x;
		return;
	}
	int md = (tl+tr)>>1;
	int lc = u<<1;
	int rc = u<<1|1;
	if (id <= md) upd(lc, tl, md, id, x);
	else upd(rc, md+1, tr, id, x);
	seg[u] = min(seg[lc], seg[rc]);
}

void dfs2(int u, int p) {
	upd(1, 1, n, h[u], dp[u] - dis[u]);

	for (pii p:vc[u]) {
		int i = p.F, id= p.S;
		int v = (h[E[id].F] < h[E[id].S] ? E[id].S : E[id].F);
		if (!(st[v] <= st[u] && ft[v] >= ft[u])) {
			out[i] = -1;
			continue;
		}
		
		out[i] = query(1, 1, n, h[v], h[u]) + dis[u];
	}

	for (pii x:adj[u]) {
		int v = x.F;
		if (v==p) continue;
		dfs2(v, u);
	}
	upd(1, 1, n, h[u], 1e18);
}

void solve() {
	cin >> n >> s >> q >> r;
	for (int i = 1; i <= n-1; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		adj[u].push_back({v, w});
		adj[v].push_back({u, w});
		E[i] = {u, v};
	}
	for (int i = 1; i <= s; i++) {
		int u;
		cin >> u;
		mark[u] = 1;
	}
	for (int i = 1; i <= q; i++) {
		int id, u;
		cin >> id >> u;
		vc[u].push_back({i, id});
	}
	dfs(r,0);

	build(1,1,n);
	dfs2(r,0);

	for (int i = 1; i <= q; i++) {
		if (out[i] == -1) cout << "escaped" << endl;
		else if (out[i] >= 1e18) cout << "oo" << endl;
		else cout << out[i] << endl;
	}
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 7 ms 5372 KB Output is correct
3 Correct 5 ms 5332 KB Output is correct
4 Correct 5 ms 5308 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 7 ms 5372 KB Output is correct
3 Correct 5 ms 5332 KB Output is correct
4 Correct 5 ms 5308 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 4 ms 5176 KB Output is correct
10 Correct 4 ms 5180 KB Output is correct
11 Correct 4 ms 5208 KB Output is correct
12 Correct 4 ms 5204 KB Output is correct
13 Correct 5 ms 5204 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 18032 KB Output is correct
2 Correct 165 ms 21576 KB Output is correct
3 Correct 186 ms 21428 KB Output is correct
4 Correct 173 ms 23612 KB Output is correct
5 Correct 168 ms 22880 KB Output is correct
6 Correct 169 ms 25396 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 7 ms 5372 KB Output is correct
3 Correct 5 ms 5332 KB Output is correct
4 Correct 5 ms 5308 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 4 ms 5176 KB Output is correct
10 Correct 4 ms 5180 KB Output is correct
11 Correct 4 ms 5208 KB Output is correct
12 Correct 4 ms 5204 KB Output is correct
13 Correct 5 ms 5204 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 161 ms 18032 KB Output is correct
16 Correct 165 ms 21576 KB Output is correct
17 Correct 186 ms 21428 KB Output is correct
18 Correct 173 ms 23612 KB Output is correct
19 Correct 168 ms 22880 KB Output is correct
20 Correct 169 ms 25396 KB Output is correct
21 Correct 150 ms 21348 KB Output is correct
22 Correct 156 ms 21012 KB Output is correct
23 Correct 179 ms 20980 KB Output is correct
24 Correct 173 ms 23264 KB Output is correct
25 Correct 151 ms 26052 KB Output is correct
26 Correct 162 ms 21428 KB Output is correct
27 Correct 172 ms 20996 KB Output is correct
28 Correct 156 ms 21020 KB Output is correct
29 Correct 196 ms 22588 KB Output is correct
30 Correct 157 ms 23756 KB Output is correct
31 Correct 160 ms 21436 KB Output is correct
32 Correct 156 ms 21168 KB Output is correct
33 Correct 171 ms 21068 KB Output is correct
34 Correct 201 ms 23268 KB Output is correct
35 Correct 155 ms 25952 KB Output is correct
36 Correct 147 ms 22984 KB Output is correct