#include<bits/stdc++.h>
using namespace std;
int ans=1;
vector<int> res;
vector<vector<int>> adj;
string s;
void dfs1(int u=0, int p=-1) {
res[u]=s[u]-'0';
for(int pp : adj[u]) {
if(pp==p) continue;
dfs1(pp, u);
if(s[pp]=='1') res[u]++;
else res[u]+=res[pp];
}
}
void dfs2(int u=0, int p=-1, int to_p=0) {
int sz=adj[u].size();
if(u || s[u]=='0') ans=max(ans, res[u]+to_p-2*(s[u]=='1')*(sz>1));
else {
int cnt=0, maxway=0;
for(int pp : adj[0]) {if(res[pp]>0) cnt++, maxway=max(maxway, res[pp]);}
if(cnt==1) ans=max(ans, res[0]);
else ans=max({ans, maxway+1, res[u]-2});
}
if(u && s[u]=='1') {
int mn=2, jalur=0;
if(to_p>0) mn=min(mn, to_p), jalur=max(jalur, to_p);
for(int pp : adj[u]) {if(res[pp]>0) mn=min(mn, res[pp]), jalur=max(jalur, res[pp]);}
ans=max(ans, jalur+1);
}
for(int pp : adj[u]) {
if(pp==p) continue;
if(s[u]=='1') dfs2(pp, u, 1);
else dfs2(pp, u, to_p+res[u]-(s[pp]=='1' ? 1 : res[pp]));
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
res.resize(n); adj.resize(n);
while(--n) {
int u, v; cin >> u >> v; --u; --v;
adj[u].push_back(v);
adj[v].push_back(u);}
cin >> s;
dfs1();
dfs2();
cout << ans << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
