#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
int N;
string c;
vector<int> v[200010];
pair<int,int> ans(int pos,int prec){
vector<pair<int,int> > k;
for(int x:v[pos]){
if(x==prec)continue;
k.pb(ans(x,pos));
}
pair<int,int> ma={0,0};//at most 1 in line,most 2 in line
if(c[pos]=='1'){
for(auto [a,b]:k){
ma.fi+=a;
ma.se=max(ma.se,a+1);
}
ma.fi--;
ma.fi=max(ma.fi,(int)1);
}else{
for(auto [a,b]:k){
ma.fi+=a;
ma.se=max(ma.se,b-a);
}
ma.se+=ma.fi;
}
//cout<<pos<<" "<<ma.fi<<" "<<ma.se<<endl;
return ma;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(0);
cin>>N;
for(int i=0;i<N-1;i++){
int a,b;
cin>>a>>b;
a--;b--;
v[a].pb(b);
v[b].pb(a);
}
cin>>c;
auto k=ans(0,-1);
cout<<max(k.fi,k.se)<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4940 KB |
Output is correct |
2 |
Correct |
4 ms |
4940 KB |
Output is correct |
3 |
Correct |
5 ms |
4940 KB |
Output is correct |
4 |
Correct |
5 ms |
4940 KB |
Output is correct |
5 |
Incorrect |
4 ms |
4888 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4940 KB |
Output is correct |
2 |
Correct |
4 ms |
4940 KB |
Output is correct |
3 |
Correct |
5 ms |
4940 KB |
Output is correct |
4 |
Correct |
5 ms |
4940 KB |
Output is correct |
5 |
Incorrect |
4 ms |
4888 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4940 KB |
Output is correct |
2 |
Correct |
4 ms |
4940 KB |
Output is correct |
3 |
Correct |
5 ms |
4940 KB |
Output is correct |
4 |
Correct |
5 ms |
4940 KB |
Output is correct |
5 |
Incorrect |
4 ms |
4888 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |