Submission #453228

# Submission time Handle Problem Language Result Execution time Memory
453228 2021-08-04T09:33:08 Z valerikk Beads and wires (APIO14_beads) C++17
28 / 100
1000 ms 1356 KB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 10010;
const ll INF = 1e18;

int n;
vector<pair<int, ll>> g[N];
ll dp[N][2];

void dfs(int v, int p = -1, ll kek = INF) {
	ll mx = 0, sum = 0;
	for (auto [u, w] : g[v]) {
		if (u != p) {
			dfs(u, v, w);
			sum += dp[u][1];
			mx = max(mx, dp[u][0] - dp[u][1] + kek + w);
		}
	}
	dp[v][0] = sum;
	dp[v][1] = sum + mx;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n - 1; ++i) {
		int a, b;
		ll c;
		cin >> a >> b >> c;
		g[a].push_back({b, c});
		g[b].push_back({a, c});
	}
	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
		dfs(i);
		ans = max(ans, dp[i][0]);
	}
	cout << ans << endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 552 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 556 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 552 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 556 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 552 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 552 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 556 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 552 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 662 ms 956 KB Output is correct
24 Correct 618 ms 952 KB Output is correct
25 Correct 666 ms 932 KB Output is correct
26 Execution timed out 1083 ms 1356 KB Time limit exceeded
27 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 552 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 556 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 552 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 662 ms 956 KB Output is correct
24 Correct 618 ms 952 KB Output is correct
25 Correct 666 ms 932 KB Output is correct
26 Execution timed out 1083 ms 1356 KB Time limit exceeded
27 Halted 0 ms 0 KB -