oj.uz

Submission #696073

# Submission time Handle Problem Language Result Execution time Memory
696073 2023-02-05T10:26:56 Z Makarooni Valley (BOI19_valley) C++17
100 / 100
 203 ms 41768 KB 
/* IN THE NAME OF GOD */
/* |\/| /-\ |\| | |\/| /-\ */

#include "bits/stdc++.h"
using namespace std;

#define sz(x) (int)x.size()
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define mr make_pair
//#define int long long
#define pii pair<int, int>
typedef long double ld;
typedef long long ll;

mt19937 rng (chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 1e5 + 10;
const int MOD = 1e9 + 7;
const int inf = 1e9 + 1;
const ll INF = 3e18;

vector<pii> g[N];
int tin[N], tout[N], T, par[N][20], h[N];
ll b[N][20], d[N], f[N];
bool shop[N];

void pdfs(int v, int p){
	tin[v] = ++T;
	if(shop[v])
		f[v] = 0;
	for(int i = 1; i < 20; i++)
		par[v][i] = par[par[v][i - 1]][i - 1];
	for(pii u : g[v]){
		if(u.F == p)
			continue;
		par[u.F][0] = v;
		d[u.F] = d[v] + u.S;
		h[u.F] = h[v] + 1;
		pdfs(u.F, v);
		f[v] = min(f[v], f[u.F] + u.S);
	}
	tout[v] = ++T;
}

void dfs(int v, int p){
	for(int i = 1; i < 20; i++)
		b[v][i] = min(b[v][i - 1], b[par[v][i - 1]][i - 1] + d[v] - d[par[v][i - 1]]);
	for(pii u : g[v]){
		if(u.F == p)
			continue;
		b[u.F][0] = f[v] + u.S;
		b[u.F][0] = min(b[u.F][0], f[u.F]);
		dfs(u.F, v);
	}
}

int32_t main(){
	ios_base:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int n, s, q, end;
	cin >> n >> s >> q >> end;
	int u, v, w;
	vector<pii> e;
	for(int i = 1; i < n; i++){
		cin >> u >> v >> w;
		g[u].pb(mr(v, w));
		g[v].pb(mr(u, w));
		e.pb(mr(u, v));
	}
	for(int i = 1; i <= s; i++){
		cin >> v;
		shop[v] = 1;
	}
	for(int i = 1; i <= n; i++)
		f[i] = INF;
	pdfs(end, 0);
	dfs(end, 0);
	while(q--){
		cin >> w >> v;
		w--;
		if(tin[e[w].F] < tin[e[w].S])
			swap(e[w].F, e[w].S);
		bool f1 = (tin[e[w].F] <= tin[v] && tout[e[w].F] >= tout[v]), f2 = (tin[e[w].F] <= tin[end] && tout[e[w].F] >= tout[end]);
		if(!(f1 ^ f2))
			cout << "escaped" << endl;
		else{
			if(f1){
				int H = h[v] - h[e[w].F];
				ll ans = f[v], D = 0;
				for(int j = 0; j < 20; j++){
					if(H & (1 << j)){
						ans = min(ans, b[v][j] + D);
						D += d[v] - d[par[v][j]];
						v = par[v][j];
					}
				}
				if(ans == INF)
					cout << "oo" << endl;
				else
					cout << ans << endl;
			}
		}
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2768 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2820 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2768 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2820 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 3 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3080 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 4 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 3 ms 3156 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 3 ms 3028 KB Output is correct
14 Correct 3 ms 3084 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 34300 KB Output is correct
2 Correct 180 ms 34124 KB Output is correct
3 Correct 161 ms 33944 KB Output is correct
4 Correct 178 ms 36020 KB Output is correct
5 Correct 165 ms 36192 KB Output is correct
6 Correct 196 ms 38480 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2768 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2820 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 3 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3080 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 4 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 3 ms 3156 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 3 ms 3028 KB Output is correct
14 Correct 3 ms 3084 KB Output is correct
15 Correct 138 ms 34300 KB Output is correct
16 Correct 180 ms 34124 KB Output is correct
17 Correct 161 ms 33944 KB Output is correct
18 Correct 178 ms 36020 KB Output is correct
19 Correct 165 ms 36192 KB Output is correct
20 Correct 196 ms 38480 KB Output is correct
21 Correct 143 ms 36416 KB Output is correct
22 Correct 155 ms 36116 KB Output is correct
23 Correct 158 ms 36108 KB Output is correct
24 Correct 188 ms 38544 KB Output is correct
25 Correct 203 ms 41768 KB Output is correct
26 Correct 144 ms 36528 KB Output is correct
27 Correct 156 ms 36208 KB Output is correct
28 Correct 161 ms 36108 KB Output is correct
29 Correct 198 ms 37812 KB Output is correct
30 Correct 203 ms 39524 KB Output is correct
31 Correct 142 ms 36708 KB Output is correct
32 Correct 153 ms 36184 KB Output is correct
33 Correct 182 ms 36240 KB Output is correct
34 Correct 197 ms 38388 KB Output is correct
35 Correct 201 ms 41708 KB Output is correct
36 Correct 188 ms 39056 KB Output is correct