oj.uz

Submission #600274

# Submission time Handle Problem Language Result Execution time Memory
600274 2022-07-20T16:02:02 Z acatmeowmeow Race (IOI11_race) C++11
100 / 100
 1772 ms 59016 KB 
//#include "race.h"

#include <bits/stdc++.h>

using namespace std;

#define int long long 

const int NMAX = 2e5 + 5;
vector<pair<int, int>> adj[NMAX];
int sz[NMAX], dist[NMAX], depth[NMAX], ans = 1e18;
bool removed[NMAX];

int get_size(int u, int e) {
	sz[u] = 1;
	for (auto&x : adj[u]) {
		int v = x.first;
		if (v == e || removed[v]) continue;
		sz[u] += get_size(v, u);
	}
	return sz[u];
}

int get_centroid(int u, int e, int s) {
	for (auto&x : adj[u]) {
		int v = x.first;
		if (v == e || removed[v] || sz[v] <= s/2) continue;
		return get_centroid(v, u, s);
	}
	return u;
}

void dfs(int u, int e, map<int, int>&res) {
	if (!res.count(dist[u])) res[dist[u]] = depth[u];
	else res[dist[u]] = min(res[dist[u]], depth[u]);
	for (auto&x : adj[u]) {
		int v = x.first, cost = x.second;
		if (v == e || removed[v]) continue;
		dist[v] = dist[u] + cost, depth[v] = depth[u] + 1;
		dfs(v, u, res);
	}
}

void build(int u, int e, int K) {
	int s = get_size(u, e), centroid = get_centroid(u, e, s);
	map<int, int> total;
	total[0] = dist[centroid] = depth[centroid] = 0;
	for (auto&x : adj[centroid]) {
		int v = x.first, cost = x.second;
		if (v == e || removed[v]) continue;
		dist[v] = dist[centroid] + cost, depth[v] = depth[centroid] + 1;
		map<int, int> res;
		dfs(v, centroid, res);
		for (auto&x : res) {
			int cost = x.first, edge = x.second;
			if (total.count(K - cost)) ans = min(ans, edge + total[K - cost]);
		}
		for (auto&x : res) {
			int cost = x.first, edge = x.second;
			if (!total.count(cost)) total[cost] = edge;
			else total[cost] = min(total[cost], edge); 
		}
	}
	removed[centroid] = true;
	for (auto&x : adj[centroid]) {
		int v = x.first;
		if (v == e || removed[v]) continue;
		build(v, centroid, K);
	}
}

signed best_path(signed N, signed K, signed H[][2], signed L[]) {
	for (int i = 0; i < N - 1; i++) {
		int u = H[i][0], v = H[i][1], c = L[i];
		adj[u].push_back({v, c}), adj[v].push_back({u, c});
	}
	build(0, -1, K);
	return ans == 1e18 ? -1 : ans;
}

/*signed N, K, H[NMAX][2], L[NMAX];

signed main() {
	cin >> N >> K;
	for (int i = 0; i < N - 1; i++) cin >> H[i][0] >> H[i][1] >> L[i];
	cout << best_path(N, K, H, L) << '\n'; 
	return 0;
}*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 6 ms 5244 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 5 ms 5204 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 5 ms 5204 KB Output is correct
29 Correct 5 ms 5208 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 5 ms 5204 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 7 ms 5240 KB Output is correct
34 Correct 6 ms 5204 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 6 ms 5204 KB Output is correct
37 Correct 5 ms 5204 KB Output is correct
38 Correct 5 ms 5204 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 318 ms 13856 KB Output is correct
20 Correct 322 ms 13828 KB Output is correct
21 Correct 258 ms 13832 KB Output is correct
22 Correct 248 ms 13752 KB Output is correct
23 Correct 443 ms 14636 KB Output is correct
24 Correct 171 ms 13424 KB Output is correct
25 Correct 294 ms 18788 KB Output is correct
26 Correct 97 ms 19532 KB Output is correct
27 Correct 397 ms 23260 KB Output is correct
28 Correct 1726 ms 59016 KB Output is correct
29 Correct 1606 ms 58048 KB Output is correct
30 Correct 396 ms 23280 KB Output is correct
31 Correct 410 ms 23268 KB Output is correct
32 Correct 551 ms 23244 KB Output is correct
33 Correct 933 ms 22444 KB Output is correct
34 Correct 1537 ms 43628 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 6 ms 5244 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 5 ms 5204 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 5 ms 5204 KB Output is correct
29 Correct 5 ms 5208 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 5 ms 5204 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 7 ms 5240 KB Output is correct
34 Correct 6 ms 5204 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 6 ms 5204 KB Output is correct
37 Correct 5 ms 5204 KB Output is correct
38 Correct 5 ms 5204 KB Output is correct
39 Correct 318 ms 13856 KB Output is correct
40 Correct 322 ms 13828 KB Output is correct
41 Correct 258 ms 13832 KB Output is correct
42 Correct 248 ms 13752 KB Output is correct
43 Correct 443 ms 14636 KB Output is correct
44 Correct 171 ms 13424 KB Output is correct
45 Correct 294 ms 18788 KB Output is correct
46 Correct 97 ms 19532 KB Output is correct
47 Correct 397 ms 23260 KB Output is correct
48 Correct 1726 ms 59016 KB Output is correct
49 Correct 1606 ms 58048 KB Output is correct
50 Correct 396 ms 23280 KB Output is correct
51 Correct 410 ms 23268 KB Output is correct
52 Correct 551 ms 23244 KB Output is correct
53 Correct 933 ms 22444 KB Output is correct
54 Correct 1537 ms 43628 KB Output is correct
55 Correct 41 ms 6636 KB Output is correct
56 Correct 21 ms 5868 KB Output is correct
57 Correct 182 ms 14144 KB Output is correct
58 Correct 68 ms 13240 KB Output is correct
59 Correct 531 ms 28940 KB Output is correct
60 Correct 1748 ms 56504 KB Output is correct
61 Correct 653 ms 24952 KB Output is correct
62 Correct 508 ms 23392 KB Output is correct
63 Correct 558 ms 23236 KB Output is correct
64 Correct 1700 ms 37256 KB Output is correct
65 Correct 1332 ms 44316 KB Output is correct
66 Correct 1772 ms 55948 KB Output is correct
67 Correct 191 ms 21616 KB Output is correct
68 Correct 750 ms 38188 KB Output is correct
69 Correct 683 ms 38476 KB Output is correct
70 Correct 648 ms 36704 KB Output is correct