oj.uz

Submission #702422

# Submission time Handle Problem Language Result Execution time Memory
702422 2023-02-24T04:42:54 Z Zian_Jacobson Valley (BOI19_valley) C++17
100 / 100
 618 ms 97852 KB 
#include<bits/stdc++.h>
using namespace std;
#define cIO ios_base::sync_with_stdio(0);cin.tie(0)
#define fileIO(x) ifstream fin(string(x)+".in"); ofstream fout(string(x)+".out")
#define cont(container, object) (container.find(object)!=container.end())
#define sz(x) (int) (x).size()
#define ll long long
#define v vector
const ll INF = LLONG_MAX / 2;
const int max_log = 18;
v<v<pair<int, ll>>> adj;
v<pair<int, ll>> p;
v<v<pair<int, ll>>> c;
v<v<pair<int, ll>>> jmp;
v<v<ll>> jmp_f, jmp_d;//jump 2^k steps to parent & distance
v<ll> ds_subtree;//min dist to store in subtree
v<bool> is_store;
v<int> depth;
v<pair<int, int>> roads_list;
void dfs_p(int node)
{
	if (is_store[node]) ds_subtree[node] = 0;
	for (auto nxt : adj[node])
		if (nxt.first != p[node].first)
		{
			p[nxt.first] = { node, nxt.second };
			c[node].push_back(nxt);
			depth[nxt.first] = depth[node] + 1;
			dfs_p(nxt.first);
			ds_subtree[node] = min(ds_subtree[node], ds_subtree[nxt.first]+nxt.second);
		}
	return;
}
int main()
{
	fileIO("valley");
	//remember distances could be long long
	int N, S, Q, E; cin >> N >> S >> Q >> E;
	adj.resize(N + 1);
	is_store.resize(N + 1);
	p.resize(N + 1); c.resize(N + 1);
	p[E] = { E,0 };
	ds_subtree.resize(N + 1, INF);
	depth.resize(N + 1);
	jmp = v<v<pair<int, ll>>>(N + 1, v<pair<int, ll>>(max_log + 1));
	jmp_f = jmp_d = v<v<ll>>(N + 1, v<ll>(max_log + 1, INF));
	roads_list.resize(N + 1);
	for (int i = 1; i <= N - 1; i++)
	{
		int a, b; ll c;
		cin >> a >> b >> c;
		adj[a].push_back({ b,c });
		adj[b].push_back({ a,c });
		roads_list[i] = { a,b };
	}
	for (int i = 1; i <= S; i++)
	{
		int a; cin >> a;
		is_store[a] = true;
	}
	dfs_p(E);
	
	for (int i = 1; i <= N; i++)
	{
		jmp[i][0] = p[i];
	}
	for (int dep = 1; dep <= max_log; dep++)
		for (int i = 1; i <= N; i++)
		{
			jmp[i][dep] = { jmp[jmp[i][dep - 1].first][dep - 1].first,
			jmp[i][dep - 1].second + jmp[jmp[i][dep - 1].first][dep - 1].second };
		}
	for (int i = 1; i <= N; i++)
	{
		jmp_d[i][0] = jmp[i][0].second + ds_subtree[jmp[i][0].first];
	}
	for (int dep = 1; dep <= max_log; dep++)
		for (int i=1; i <= N; i++)
		{
			jmp_d[i][dep] = min(jmp_d[i][dep - 1],
				jmp_d[jmp[i][dep - 1].first][dep - 1] + jmp[i][dep - 1].second);
		}
	for (int z = 1; z <= Q; z++)
	{
		int I, R;
		cin >> I >> R;
		pair<int, int> rem = roads_list[I];
		if (depth[rem.first] > depth[rem.second]) swap(rem.first, rem.second);
		int top_node = rem.second;
		//first check if top_node is not a parent of R
		if (depth[R] < depth[top_node])
		{
			cout << "escaped\n";
			continue;
		}
		int stp = depth[R] - depth[top_node];
		int R1 = R;
		for (int i = 0; i <= max_log; i++)
		{
			if (stp & (1 << i))
				R1 = jmp[R1][i].first;
		}
		if (R1!=top_node)
		{
			cout << "escaped\n";
			continue;
		}
		//we know that top_node is a parent
		ll min_cost = ds_subtree[R];
		ll cum_jmp_cost = 0;
		R1 = R;
		for (int i = 0; i <= max_log; i++)
		{
			if (stp & (1 << i))
			{
				min_cost = min(min_cost, jmp_d[R1][i] + cum_jmp_cost);
				cum_jmp_cost += jmp[R1][i].second;
				R1 = jmp[R1][i].first;
			}
		}
		if (min_cost == INF) cout << "oo\n";
		else cout << min_cost << "\n";
	}
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 468 KB Output is correct
2 Correct 17 ms 500 KB Output is correct
3 Correct 19 ms 468 KB Output is correct
4 Correct 17 ms 448 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 468 KB Output is correct
2 Correct 17 ms 500 KB Output is correct
3 Correct 19 ms 468 KB Output is correct
4 Correct 17 ms 448 KB Output is correct
5 Correct 4 ms 1108 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 4 ms 1220 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 4 ms 1096 KB Output is correct
10 Correct 4 ms 1224 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 4 ms 1092 KB Output is correct
13 Correct 5 ms 1216 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 436 ms 90208 KB Output is correct
2 Correct 448 ms 90260 KB Output is correct
3 Correct 528 ms 90292 KB Output is correct
4 Correct 539 ms 93296 KB Output is correct
5 Correct 508 ms 93568 KB Output is correct
6 Correct 618 ms 97116 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 468 KB Output is correct
2 Correct 17 ms 500 KB Output is correct
3 Correct 19 ms 468 KB Output is correct
4 Correct 17 ms 448 KB Output is correct
5 Correct 4 ms 1108 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 4 ms 1220 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 4 ms 1096 KB Output is correct
10 Correct 4 ms 1224 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 4 ms 1092 KB Output is correct
13 Correct 5 ms 1216 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 436 ms 90208 KB Output is correct
16 Correct 448 ms 90260 KB Output is correct
17 Correct 528 ms 90292 KB Output is correct
18 Correct 539 ms 93296 KB Output is correct
19 Correct 508 ms 93568 KB Output is correct
20 Correct 618 ms 97116 KB Output is correct
21 Correct 411 ms 89688 KB Output is correct
22 Correct 417 ms 89720 KB Output is correct
23 Correct 456 ms 89820 KB Output is correct
24 Correct 518 ms 93104 KB Output is correct
25 Correct 528 ms 97852 KB Output is correct
26 Correct 423 ms 89608 KB Output is correct
27 Correct 475 ms 89716 KB Output is correct
28 Correct 454 ms 89740 KB Output is correct
29 Correct 499 ms 92120 KB Output is correct
30 Correct 573 ms 94576 KB Output is correct
31 Correct 403 ms 89844 KB Output is correct
32 Correct 465 ms 89752 KB Output is correct
33 Correct 466 ms 89988 KB Output is correct
34 Correct 482 ms 92996 KB Output is correct
35 Correct 516 ms 97624 KB Output is correct
36 Correct 460 ms 93004 KB Output is correct