-
Notifications
You must be signed in to change notification settings - Fork 0
/
F.cpp
69 lines (54 loc) · 1.19 KB
/
F.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define endl "\n";
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll const inf = 1e18;
ll const maxn = 1e6+5;
ll const mod = 1e9+7;
// code begins here
ll n;
vector<ll> g[maxn], color(maxn), dp(maxn), ans(maxn);
void dfs1(ll v, ll p=0){
dp[v] = color[v];
for(auto u: g[v]){
if(u==p)
continue;
dfs1(u, v);
dp[v] += max(0LL, dp[u]);
}
}
void dfs2(ll v, ll p=0){
ans[v] = dp[v];
for(auto u: g[v]){
if(u==p)
continue;
dp[v] -= max(0LL, dp[u]);
dp[u] += max(0LL, dp[v]);
dfs2(u, v);
dp[u] -= max(0LL, dp[v]);
dp[v] += max(0LL, dp[u]);
}
}
int main(){
fast;
cin>>n;
for(ll i=1;i<=n;i++){
cin>>color[i];
if(!color[i])
color[i] = -1;
}
for(ll i=1;i<n;i++){
ll x,y;
cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
dfs1(1);
dfs2(1);
for(ll i=1;i<=n;i++)
cout<<ans[i]<<" ";
return 0;
}