#include<bits/stdc++.h>
using namespace std;
const int nax = 200005;
vector<pair<int,int>>g[nax];
int dp[nax][2], n;
int solve(int v, int topar, int p = -1) {
int &ret = dp[v][(topar>0)];
if(ret!=-1) return ret;
ret = 0;
int base = 0;
for(auto [u, w] : g[v]) if(u!=p) {
base += solve(u, w, v);
}
ret = base;
if(topar) {
for(auto [u, w] : g[v]) if(u!=p) {
int cur = base - solve(u, w, v) + solve(u, 0, v) + topar + w;
ret = max(ret, cur);
}
}
return ret;
}
void PlayGround() {
cin>>n;
for(int i=1; i<n; ++i) {
int u, v, w;
cin>>u>>v>>w;
g[u].emplace_back(v, w);
g[v].emplace_back(u, w);
}
int ans = 0;
for(int i=1; i<=n; ++i) {
memset(dp, -1, sizeof dp);
ans = max(ans, solve(i, 0));
}
cout<<ans<<'\n';
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
PlayGround();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
6484 KB |
Output is correct |
2 |
Correct |
3 ms |
6484 KB |
Output is correct |
3 |
Correct |
3 ms |
6484 KB |
Output is correct |
4 |
Correct |
4 ms |
6484 KB |
Output is correct |
5 |
Correct |
3 ms |
6484 KB |
Output is correct |
6 |
Correct |
4 ms |
6484 KB |
Output is correct |
7 |
Correct |
4 ms |
6564 KB |
Output is correct |
8 |
Correct |
4 ms |
6484 KB |
Output is correct |
9 |
Correct |
4 ms |
6484 KB |
Output is correct |
10 |
Correct |
5 ms |
6484 KB |
Output is correct |
11 |
Correct |
5 ms |
6484 KB |
Output is correct |
12 |
Correct |
4 ms |
6484 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
6484 KB |
Output is correct |
2 |
Correct |
3 ms |
6484 KB |
Output is correct |
3 |
Correct |
3 ms |
6484 KB |
Output is correct |
4 |
Correct |
4 ms |
6484 KB |
Output is correct |
5 |
Correct |
3 ms |
6484 KB |
Output is correct |
6 |
Correct |
4 ms |
6484 KB |
Output is correct |
7 |
Correct |
4 ms |
6564 KB |
Output is correct |
8 |
Correct |
4 ms |
6484 KB |
Output is correct |
9 |
Correct |
4 ms |
6484 KB |
Output is correct |
10 |
Correct |
5 ms |
6484 KB |
Output is correct |
11 |
Correct |
5 ms |
6484 KB |
Output is correct |
12 |
Correct |
4 ms |
6484 KB |
Output is correct |
13 |
Correct |
8 ms |
6480 KB |
Output is correct |
14 |
Correct |
7 ms |
6484 KB |
Output is correct |
15 |
Correct |
8 ms |
6556 KB |
Output is correct |
16 |
Correct |
12 ms |
6556 KB |
Output is correct |
17 |
Correct |
12 ms |
6484 KB |
Output is correct |
18 |
Correct |
14 ms |
6560 KB |
Output is correct |
19 |
Correct |
12 ms |
6484 KB |
Output is correct |
20 |
Correct |
13 ms |
6612 KB |
Output is correct |
21 |
Correct |
18 ms |
6560 KB |
Output is correct |
22 |
Correct |
17 ms |
6556 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
6484 KB |
Output is correct |
2 |
Correct |
3 ms |
6484 KB |
Output is correct |
3 |
Correct |
3 ms |
6484 KB |
Output is correct |
4 |
Correct |
4 ms |
6484 KB |
Output is correct |
5 |
Correct |
3 ms |
6484 KB |
Output is correct |
6 |
Correct |
4 ms |
6484 KB |
Output is correct |
7 |
Correct |
4 ms |
6564 KB |
Output is correct |
8 |
Correct |
4 ms |
6484 KB |
Output is correct |
9 |
Correct |
4 ms |
6484 KB |
Output is correct |
10 |
Correct |
5 ms |
6484 KB |
Output is correct |
11 |
Correct |
5 ms |
6484 KB |
Output is correct |
12 |
Correct |
4 ms |
6484 KB |
Output is correct |
13 |
Correct |
8 ms |
6480 KB |
Output is correct |
14 |
Correct |
7 ms |
6484 KB |
Output is correct |
15 |
Correct |
8 ms |
6556 KB |
Output is correct |
16 |
Correct |
12 ms |
6556 KB |
Output is correct |
17 |
Correct |
12 ms |
6484 KB |
Output is correct |
18 |
Correct |
14 ms |
6560 KB |
Output is correct |
19 |
Correct |
12 ms |
6484 KB |
Output is correct |
20 |
Correct |
13 ms |
6612 KB |
Output is correct |
21 |
Correct |
18 ms |
6560 KB |
Output is correct |
22 |
Correct |
17 ms |
6556 KB |
Output is correct |
23 |
Execution timed out |
1078 ms |
6740 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
6484 KB |
Output is correct |
2 |
Correct |
3 ms |
6484 KB |
Output is correct |
3 |
Correct |
3 ms |
6484 KB |
Output is correct |
4 |
Correct |
4 ms |
6484 KB |
Output is correct |
5 |
Correct |
3 ms |
6484 KB |
Output is correct |
6 |
Correct |
4 ms |
6484 KB |
Output is correct |
7 |
Correct |
4 ms |
6564 KB |
Output is correct |
8 |
Correct |
4 ms |
6484 KB |
Output is correct |
9 |
Correct |
4 ms |
6484 KB |
Output is correct |
10 |
Correct |
5 ms |
6484 KB |
Output is correct |
11 |
Correct |
5 ms |
6484 KB |
Output is correct |
12 |
Correct |
4 ms |
6484 KB |
Output is correct |
13 |
Correct |
8 ms |
6480 KB |
Output is correct |
14 |
Correct |
7 ms |
6484 KB |
Output is correct |
15 |
Correct |
8 ms |
6556 KB |
Output is correct |
16 |
Correct |
12 ms |
6556 KB |
Output is correct |
17 |
Correct |
12 ms |
6484 KB |
Output is correct |
18 |
Correct |
14 ms |
6560 KB |
Output is correct |
19 |
Correct |
12 ms |
6484 KB |
Output is correct |
20 |
Correct |
13 ms |
6612 KB |
Output is correct |
21 |
Correct |
18 ms |
6560 KB |
Output is correct |
22 |
Correct |
17 ms |
6556 KB |
Output is correct |
23 |
Execution timed out |
1078 ms |
6740 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |