#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=2000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 200010, LOG=20;
ll n, m, k, u, v, x, y, t, a, b, ans;
ll dp[MAXN][2];
vector<pii> G[MAXN];
void dfs(int node, int par){
dp[node][0]=0;
dp[node][1]=-inf;
for (pii p:G[node]) if (p.first!=par) dfs(p.first, node);
ll sum=0;
for (pii p:G[node]) if (p.first!=par) sum+=max(dp[p.first][0], dp[p.first][1]+p.second);
dp[node][0]=sum;
for (pii p:G[node]) if (p.first!=par) dp[node][1]=max(dp[node][1], sum-max(dp[p.first][0], dp[p.first][1]+p.second)+p.second+dp[p.first][0]);
//dp[node][0]=sum;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n;
assert(n<=10000);
for (int i=1; i<n; i++){
cin>>u>>v>>x;
G[u].pb({v, x});
G[v].pb({u, x});
}
/*
dfs(4, 4);
for (int i=1; i<=n; i++){
debug(i)
debug2(dp[i][0], dp[i][1])
cerr<<'\n';
}
*/
//return 0;
for (int i=1; i<=n; i++){
for (int j=1; j<=n; j++) dp[j][0]=0, dp[j][1]=-inf;
dfs(i, i);
ans=max(ans, dp[i][0]);
//debug2(i, dp[i][0])
}
cout<<ans<<'\n';
return 0;
}
/*
5
1 2 10
1 3 40
1 4 15
1 5 20
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
5112 KB |
Output is correct |
2 |
Correct |
3 ms |
5112 KB |
Output is correct |
3 |
Correct |
7 ms |
5112 KB |
Output is correct |
4 |
Correct |
7 ms |
4984 KB |
Output is correct |
5 |
Correct |
6 ms |
4984 KB |
Output is correct |
6 |
Correct |
7 ms |
5112 KB |
Output is correct |
7 |
Correct |
7 ms |
5112 KB |
Output is correct |
8 |
Correct |
7 ms |
5112 KB |
Output is correct |
9 |
Correct |
7 ms |
5112 KB |
Output is correct |
10 |
Correct |
7 ms |
5112 KB |
Output is correct |
11 |
Correct |
7 ms |
4984 KB |
Output is correct |
12 |
Correct |
6 ms |
4984 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
5112 KB |
Output is correct |
2 |
Correct |
3 ms |
5112 KB |
Output is correct |
3 |
Correct |
7 ms |
5112 KB |
Output is correct |
4 |
Correct |
7 ms |
4984 KB |
Output is correct |
5 |
Correct |
6 ms |
4984 KB |
Output is correct |
6 |
Correct |
7 ms |
5112 KB |
Output is correct |
7 |
Correct |
7 ms |
5112 KB |
Output is correct |
8 |
Correct |
7 ms |
5112 KB |
Output is correct |
9 |
Correct |
7 ms |
5112 KB |
Output is correct |
10 |
Correct |
7 ms |
5112 KB |
Output is correct |
11 |
Correct |
7 ms |
4984 KB |
Output is correct |
12 |
Correct |
6 ms |
4984 KB |
Output is correct |
13 |
Correct |
7 ms |
5112 KB |
Output is correct |
14 |
Correct |
7 ms |
4984 KB |
Output is correct |
15 |
Correct |
7 ms |
5112 KB |
Output is correct |
16 |
Correct |
8 ms |
5116 KB |
Output is correct |
17 |
Correct |
8 ms |
4984 KB |
Output is correct |
18 |
Correct |
7 ms |
5060 KB |
Output is correct |
19 |
Correct |
7 ms |
5016 KB |
Output is correct |
20 |
Correct |
7 ms |
4984 KB |
Output is correct |
21 |
Correct |
7 ms |
4984 KB |
Output is correct |
22 |
Correct |
7 ms |
4984 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
5112 KB |
Output is correct |
2 |
Correct |
3 ms |
5112 KB |
Output is correct |
3 |
Correct |
7 ms |
5112 KB |
Output is correct |
4 |
Correct |
7 ms |
4984 KB |
Output is correct |
5 |
Correct |
6 ms |
4984 KB |
Output is correct |
6 |
Correct |
7 ms |
5112 KB |
Output is correct |
7 |
Correct |
7 ms |
5112 KB |
Output is correct |
8 |
Correct |
7 ms |
5112 KB |
Output is correct |
9 |
Correct |
7 ms |
5112 KB |
Output is correct |
10 |
Correct |
7 ms |
5112 KB |
Output is correct |
11 |
Correct |
7 ms |
4984 KB |
Output is correct |
12 |
Correct |
6 ms |
4984 KB |
Output is correct |
13 |
Correct |
7 ms |
5112 KB |
Output is correct |
14 |
Correct |
7 ms |
4984 KB |
Output is correct |
15 |
Correct |
7 ms |
5112 KB |
Output is correct |
16 |
Correct |
8 ms |
5116 KB |
Output is correct |
17 |
Correct |
8 ms |
4984 KB |
Output is correct |
18 |
Correct |
7 ms |
5060 KB |
Output is correct |
19 |
Correct |
7 ms |
5016 KB |
Output is correct |
20 |
Correct |
7 ms |
4984 KB |
Output is correct |
21 |
Correct |
7 ms |
4984 KB |
Output is correct |
22 |
Correct |
7 ms |
4984 KB |
Output is correct |
23 |
Execution timed out |
1037 ms |
5368 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
5112 KB |
Output is correct |
2 |
Correct |
3 ms |
5112 KB |
Output is correct |
3 |
Correct |
7 ms |
5112 KB |
Output is correct |
4 |
Correct |
7 ms |
4984 KB |
Output is correct |
5 |
Correct |
6 ms |
4984 KB |
Output is correct |
6 |
Correct |
7 ms |
5112 KB |
Output is correct |
7 |
Correct |
7 ms |
5112 KB |
Output is correct |
8 |
Correct |
7 ms |
5112 KB |
Output is correct |
9 |
Correct |
7 ms |
5112 KB |
Output is correct |
10 |
Correct |
7 ms |
5112 KB |
Output is correct |
11 |
Correct |
7 ms |
4984 KB |
Output is correct |
12 |
Correct |
6 ms |
4984 KB |
Output is correct |
13 |
Correct |
7 ms |
5112 KB |
Output is correct |
14 |
Correct |
7 ms |
4984 KB |
Output is correct |
15 |
Correct |
7 ms |
5112 KB |
Output is correct |
16 |
Correct |
8 ms |
5116 KB |
Output is correct |
17 |
Correct |
8 ms |
4984 KB |
Output is correct |
18 |
Correct |
7 ms |
5060 KB |
Output is correct |
19 |
Correct |
7 ms |
5016 KB |
Output is correct |
20 |
Correct |
7 ms |
4984 KB |
Output is correct |
21 |
Correct |
7 ms |
4984 KB |
Output is correct |
22 |
Correct |
7 ms |
4984 KB |
Output is correct |
23 |
Execution timed out |
1037 ms |
5368 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |