//
// main.cpp
// apioC
//
// Created by 방성원 on 2015. 8. 16..
// Copyright (c) 2015년 makesource. All rights reserved.
//
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <memory.h>
#define max(a,b) ((a)>(b)?(a):(b))
#define __ 200020
using namespace std;
vector<int> g[__], length[__];
int red[__], blue[__], vis[__], second[__], pos[__];
int n, ans;
void dfs(int node,int parent,int len) {
vis[node] = 1;
for (int i=0;i<g[node].size();i++) {
if (vis[g[node][i]]) continue;
dfs(g[node][i],node,length[node][i]);
}
for (int i=0;i<g[node].size();i++) {
if(g[node][i] == parent) continue;
red[node] += max(red[g[node][i]],blue[g[node][i]]);
}
for (int i=0;i<g[node].size();i++) {
if(g[node][i] == parent) continue;
int value=max(red[g[node][i]],blue[g[node][i]]);
blue[node] = max(blue[node],red[node]-value+red[g[node][i]]+length[node][i]+len);
}
}
void changeRoot(int node,int parent) {
int rr = red[node];
int bb = blue[node];
vis[node] = 1;
red[node] = 0; blue[node] = 0;
for (int i=0;i<g[node].size();i++) {
red[node] += max(red[g[node][i]],blue[g[node][i]]);
}
for (int i=0;i<g[node].size();i++) {
int value=max(red[g[node][i]],blue[g[node][i]]);
if (blue[node] < red[node]-value+red[g[node][i]]+length[node][i]) {
second[node] = max(second[node],blue[node]);
blue[node] = red[node]-value+red[g[node][i]]+length[node][i];
pos[node] = i;
} else {
second[node] = max(second[node],red[node]-value+red[g[node][i]]+length[node][i]);
}
}
int nowRed = red[node];
int nowBlue = blue[node];
ans = max(ans,nowRed);
for (int i=0;i<g[node].size();i++) {
if (vis[g[node][i]]) continue;
red[node] = nowRed; blue[node] = nowBlue;
red[node] -= max(red[g[node][i]],blue[g[node][i]]);
if(pos[node] != i) {
blue[node] -= max(red[g[node][i]],blue[g[node][i]]);
} else {
blue[node] = second[node];
blue[node] -= max(red[g[node][i]],blue[g[node][i]]);
}
blue[node] += length[node][i];
changeRoot(g[node][i],node);
}
red[node] = rr;
blue[node] = bb;
}
int main() {
scanf("%d",&n);
for(int i=1;i<n;i++) {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
g[a].push_back(b); length[a].push_back(c);
g[b].push_back(a); length[b].push_back(c);
}
dfs(1,-1,0);
memset(vis,0,sizeof vis);
changeRoot(1,-1);
printf("%d",ans);
return 0;
}
Compilation message
beads.cpp: In function 'void dfs(int, int, int)':
beads.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<g[node].size();i++) {
~^~~~~~~~~~~~~~~
beads.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<g[node].size();i++) {
~^~~~~~~~~~~~~~~
beads.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<g[node].size();i++) {
~^~~~~~~~~~~~~~~
beads.cpp: In function 'void changeRoot(int, int)':
beads.cpp:44:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<g[node].size();i++) {
~^~~~~~~~~~~~~~~
beads.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<g[node].size();i++) {
~^~~~~~~~~~~~~~~
beads.cpp:63:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<g[node].size();i++) {
~^~~~~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
~~~~~^~~~~~~~~
beads.cpp:88:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&a,&b,&c);
~~~~~^~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
10496 KB |
Output is correct |
2 |
Correct |
10 ms |
10496 KB |
Output is correct |
3 |
Correct |
10 ms |
10496 KB |
Output is correct |
4 |
Correct |
9 ms |
10496 KB |
Output is correct |
5 |
Correct |
10 ms |
10496 KB |
Output is correct |
6 |
Correct |
11 ms |
10540 KB |
Output is correct |
7 |
Correct |
10 ms |
10496 KB |
Output is correct |
8 |
Correct |
10 ms |
10496 KB |
Output is correct |
9 |
Correct |
10 ms |
10496 KB |
Output is correct |
10 |
Correct |
10 ms |
10496 KB |
Output is correct |
11 |
Correct |
10 ms |
10496 KB |
Output is correct |
12 |
Correct |
11 ms |
10496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
10496 KB |
Output is correct |
2 |
Correct |
10 ms |
10496 KB |
Output is correct |
3 |
Correct |
10 ms |
10496 KB |
Output is correct |
4 |
Correct |
9 ms |
10496 KB |
Output is correct |
5 |
Correct |
10 ms |
10496 KB |
Output is correct |
6 |
Correct |
11 ms |
10540 KB |
Output is correct |
7 |
Correct |
10 ms |
10496 KB |
Output is correct |
8 |
Correct |
10 ms |
10496 KB |
Output is correct |
9 |
Correct |
10 ms |
10496 KB |
Output is correct |
10 |
Correct |
10 ms |
10496 KB |
Output is correct |
11 |
Correct |
10 ms |
10496 KB |
Output is correct |
12 |
Correct |
11 ms |
10496 KB |
Output is correct |
13 |
Correct |
10 ms |
10496 KB |
Output is correct |
14 |
Correct |
10 ms |
10496 KB |
Output is correct |
15 |
Correct |
11 ms |
10496 KB |
Output is correct |
16 |
Correct |
10 ms |
10496 KB |
Output is correct |
17 |
Correct |
10 ms |
10496 KB |
Output is correct |
18 |
Correct |
10 ms |
10496 KB |
Output is correct |
19 |
Correct |
11 ms |
10540 KB |
Output is correct |
20 |
Correct |
10 ms |
10496 KB |
Output is correct |
21 |
Correct |
11 ms |
10496 KB |
Output is correct |
22 |
Correct |
12 ms |
10624 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
10496 KB |
Output is correct |
2 |
Correct |
10 ms |
10496 KB |
Output is correct |
3 |
Correct |
10 ms |
10496 KB |
Output is correct |
4 |
Correct |
9 ms |
10496 KB |
Output is correct |
5 |
Correct |
10 ms |
10496 KB |
Output is correct |
6 |
Correct |
11 ms |
10540 KB |
Output is correct |
7 |
Correct |
10 ms |
10496 KB |
Output is correct |
8 |
Correct |
10 ms |
10496 KB |
Output is correct |
9 |
Correct |
10 ms |
10496 KB |
Output is correct |
10 |
Correct |
10 ms |
10496 KB |
Output is correct |
11 |
Correct |
10 ms |
10496 KB |
Output is correct |
12 |
Correct |
11 ms |
10496 KB |
Output is correct |
13 |
Correct |
10 ms |
10496 KB |
Output is correct |
14 |
Correct |
10 ms |
10496 KB |
Output is correct |
15 |
Correct |
11 ms |
10496 KB |
Output is correct |
16 |
Correct |
10 ms |
10496 KB |
Output is correct |
17 |
Correct |
10 ms |
10496 KB |
Output is correct |
18 |
Correct |
10 ms |
10496 KB |
Output is correct |
19 |
Correct |
11 ms |
10540 KB |
Output is correct |
20 |
Correct |
10 ms |
10496 KB |
Output is correct |
21 |
Correct |
11 ms |
10496 KB |
Output is correct |
22 |
Correct |
12 ms |
10624 KB |
Output is correct |
23 |
Correct |
14 ms |
10880 KB |
Output is correct |
24 |
Correct |
13 ms |
10880 KB |
Output is correct |
25 |
Correct |
13 ms |
10880 KB |
Output is correct |
26 |
Correct |
17 ms |
11264 KB |
Output is correct |
27 |
Correct |
18 ms |
11236 KB |
Output is correct |
28 |
Correct |
17 ms |
11392 KB |
Output is correct |
29 |
Correct |
16 ms |
11392 KB |
Output is correct |
30 |
Correct |
17 ms |
11392 KB |
Output is correct |
31 |
Correct |
18 ms |
11776 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
10496 KB |
Output is correct |
2 |
Correct |
10 ms |
10496 KB |
Output is correct |
3 |
Correct |
10 ms |
10496 KB |
Output is correct |
4 |
Correct |
9 ms |
10496 KB |
Output is correct |
5 |
Correct |
10 ms |
10496 KB |
Output is correct |
6 |
Correct |
11 ms |
10540 KB |
Output is correct |
7 |
Correct |
10 ms |
10496 KB |
Output is correct |
8 |
Correct |
10 ms |
10496 KB |
Output is correct |
9 |
Correct |
10 ms |
10496 KB |
Output is correct |
10 |
Correct |
10 ms |
10496 KB |
Output is correct |
11 |
Correct |
10 ms |
10496 KB |
Output is correct |
12 |
Correct |
11 ms |
10496 KB |
Output is correct |
13 |
Correct |
10 ms |
10496 KB |
Output is correct |
14 |
Correct |
10 ms |
10496 KB |
Output is correct |
15 |
Correct |
11 ms |
10496 KB |
Output is correct |
16 |
Correct |
10 ms |
10496 KB |
Output is correct |
17 |
Correct |
10 ms |
10496 KB |
Output is correct |
18 |
Correct |
10 ms |
10496 KB |
Output is correct |
19 |
Correct |
11 ms |
10540 KB |
Output is correct |
20 |
Correct |
10 ms |
10496 KB |
Output is correct |
21 |
Correct |
11 ms |
10496 KB |
Output is correct |
22 |
Correct |
12 ms |
10624 KB |
Output is correct |
23 |
Correct |
14 ms |
10880 KB |
Output is correct |
24 |
Correct |
13 ms |
10880 KB |
Output is correct |
25 |
Correct |
13 ms |
10880 KB |
Output is correct |
26 |
Correct |
17 ms |
11264 KB |
Output is correct |
27 |
Correct |
18 ms |
11236 KB |
Output is correct |
28 |
Correct |
17 ms |
11392 KB |
Output is correct |
29 |
Correct |
16 ms |
11392 KB |
Output is correct |
30 |
Correct |
17 ms |
11392 KB |
Output is correct |
31 |
Correct |
18 ms |
11776 KB |
Output is correct |
32 |
Correct |
58 ms |
14456 KB |
Output is correct |
33 |
Correct |
59 ms |
14476 KB |
Output is correct |
34 |
Correct |
57 ms |
14584 KB |
Output is correct |
35 |
Correct |
406 ms |
26736 KB |
Output is correct |
36 |
Correct |
379 ms |
26744 KB |
Output is correct |
37 |
Correct |
403 ms |
26616 KB |
Output is correct |
38 |
Correct |
257 ms |
27608 KB |
Output is correct |
39 |
Correct |
270 ms |
27732 KB |
Output is correct |
40 |
Correct |
277 ms |
27584 KB |
Output is correct |
41 |
Correct |
343 ms |
30312 KB |
Output is correct |