oj.uz

Submission #677556

# Submission time Handle Problem Language Result Execution time Memory
677556 2023-01-03T16:06:13 Z x0r Valley (BOI19_valley) C++17
100 / 100
 225 ms 53852 KB 
#include <bits/stdc++.h>

#define name ""
#define test "test"
#define int ll
#define ll long long
#define ld long double
#define fi first 
#define se second
#define pll pair < ll, ll >
#define pii pair < int, int >
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) ((int)(x).size())
#define pb push_back
#define mp make_pair

using namespace std;

const ld EPS = 1e-9;
const int INF = 1e9 + 7;
const ll LINF = 1E18;
const int NMAX = 2e5;
const ll MOD = 1e9 + 7;
const ll BASE = 2309;

int n, s, q, root, in[100003], out[100003], timer = 0, h[100003], par[100003][20];

bool shop[100003];

pii edges[100003];

ll dis[100003], f[100003], g[100003][20];

vector < pll > adj[100003]; 

void dfs(int u, int e, ll len) {
	in[u] = out[u] = ++ timer;
	dis[u] = len;
	f[u] = (shop[u] ? 0 : LINF);
	h[u] = h[e] + 1;
	for (auto v : adj[u]) {
		if (v.fi == e) continue;
		par[v.fi][0] = u;
		for (int i = 1; i <= 19; i++)
			par[v.fi][i] = par[par[v.fi][i - 1]][i - 1];
		dfs(v.fi, u, len + v.se);
		f[u] = min(f[u], f[v.fi] + v.se);
	}
	out[u] = timer;
}

void dfs2(int u, int e) {
	for (auto v : adj[u]) {
		if (v.fi == e) continue;
		g[v.fi][0] = f[u] - dis[u];
		for (int i = 1; i <= 19; i++) {
			g[v.fi][i] = min(g[v.fi][i - 1], g[par[v.fi][i - 1]][i - 1]);
		}
		dfs2(v.fi, u);
	}
}

signed main() {
	fast;
	if(fopen(name".inp", "r")) {
		freopen(name".inp", "r", stdin);
		freopen(name".out", "w", stdout);
	}
	//int t; cin >> t; while (t --) sol();
	cin >> n >> s >> q >> root;
	for (int i = 1; i < n; i++) {
		ll u, v, c; cin >> u >> v >> c;
		adj[u].push_back({v, c}); adj[v].push_back({u, c});
		edges[i] = {u, v};
	}
	for (int i = 1; i <= s; i++) {
		int x; cin >> x;
		shop[x] = 1;
	}
	dfs(root, 0, 0);
	dfs2(root, 0);
	while (q--) {
		int id, node; cin >> id >> node;
		int u = edges[id].fi, v = edges[id].se;
		if (par[u][0] == v) swap(u, v);
		if (!(in[v] <= in[node] && in[node] <= out[v])) {
			cout << "escaped" << '\n';
			continue;
		}
		if (f[v] >= LINF) {
			cout << "oo" << '\n';
			continue;
		}
		ll res = f[node], d = h[node] - h[v], val = dis[node];
		for (int i = 19; i >= 0; i--) {
			if (d >> i & 1) {
				res = min(res, val + g[node][i]);
				node=  par[node][i];
			}
		}
		if (res > 1ll * n * INF) cout << "oo" << '\n';
		else cout << res << '\n';
	}
}

Compilation message

valley.cpp: In function 'int main()':
valley.cpp:66:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |   freopen(name".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:67:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |   freopen(name".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 4 ms 2900 KB Output is correct
3 Correct 3 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 3 ms 2772 KB Output is correct
2 Correct 4 ms 2900 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 2 ms 3156 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 3 ms 3144 KB Output is correct
11 Correct 3 ms 3156 KB Output is correct
12 Correct 3 ms 3076 KB Output is correct
13 Correct 2 ms 3144 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 45244 KB Output is correct
2 Correct 169 ms 45132 KB Output is correct
3 Correct 194 ms 45388 KB Output is correct
4 Correct 207 ms 47304 KB Output is correct
5 Correct 180 ms 47400 KB Output is correct
6 Correct 211 ms 49484 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 4 ms 2900 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 2 ms 3156 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 3 ms 3144 KB Output is correct
11 Correct 3 ms 3156 KB Output is correct
12 Correct 3 ms 3076 KB Output is correct
13 Correct 2 ms 3144 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct
15 Correct 162 ms 45244 KB Output is correct
16 Correct 169 ms 45132 KB Output is correct
17 Correct 194 ms 45388 KB Output is correct
18 Correct 207 ms 47304 KB Output is correct
19 Correct 180 ms 47400 KB Output is correct
20 Correct 211 ms 49484 KB Output is correct
21 Correct 142 ms 48564 KB Output is correct
22 Correct 164 ms 48332 KB Output is correct
23 Correct 164 ms 48596 KB Output is correct
24 Correct 184 ms 50724 KB Output is correct
25 Correct 209 ms 53852 KB Output is correct
26 Correct 144 ms 48592 KB Output is correct
27 Correct 161 ms 48404 KB Output is correct
28 Correct 168 ms 48708 KB Output is correct
29 Correct 190 ms 50144 KB Output is correct
30 Correct 216 ms 51788 KB Output is correct
31 Correct 157 ms 48716 KB Output is correct
32 Correct 159 ms 48504 KB Output is correct
33 Correct 180 ms 48924 KB Output is correct
34 Correct 225 ms 50684 KB Output is correct
35 Correct 206 ms 53620 KB Output is correct
36 Correct 200 ms 50636 KB Output is correct