#include <bits/stdc++.h>
using namespace std;
const int NMAX = 200000 + 5;
const int INF = 2E9 + 15;
int N;
vector <pair <int, int> > graph[NMAX];
int dp[NMAX][2];
void dfs(int node, int father) {
dp[node][0] = 0;
for (auto it: graph[node])
if (it.first != father) {
dfs(it.first, node);
dp[node][0] += max(dp[it.first][0], dp[it.first][1] + it.second);
}
dp[node][1] = -INF;
for (auto it: graph[node])
if (it.first != father)
dp[node][1] = max(dp[node][1], dp[node][0] - max(dp[it.first][0], dp[it.first][1] + it.second) + it.second + dp[it.first][0]);
}
int main()
{
//freopen("data.in", "r", stdin);
cin >> N;
for (int i = 1; i < N; ++ i) {
int a, b, c;
cin >> a >> b >> c;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
int ans = 0;
for (int i = 1; i <= N; ++ i) {
dfs(i, 0);
ans = max(ans, dp[i][0]);
}
cout << ans << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 12 |
Correct |
5 ms |
4992 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 12 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 13 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 14 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 15 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 16 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 17 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 18 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 19 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 20 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 21 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 22 |
Correct |
7 ms |
4992 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 12 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 13 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 14 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 15 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 16 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 17 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 18 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 19 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 20 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 21 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 22 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 23 |
Correct |
805 ms |
5284 KB |
Output is correct |
| 24 |
Correct |
832 ms |
5324 KB |
Output is correct |
| 25 |
Correct |
807 ms |
5340 KB |
Output is correct |
| 26 |
Execution timed out |
1077 ms |
5504 KB |
Time limit exceeded |
| 27 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 12 |
Correct |
5 ms |
4992 KB |
Output is correct |
| 13 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 14 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 15 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 16 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 17 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 18 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 19 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 20 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 21 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 22 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 23 |
Correct |
805 ms |
5284 KB |
Output is correct |
| 24 |
Correct |
832 ms |
5324 KB |
Output is correct |
| 25 |
Correct |
807 ms |
5340 KB |
Output is correct |
| 26 |
Execution timed out |
1077 ms |
5504 KB |
Time limit exceeded |
| 27 |
Halted |
0 ms |
0 KB |
- |
