Submission #444911

#	Time	Username	Problem	Language	Result	Execution time	Memory
444911		dutch	Power Plant (JOI20_power)	C++17	100 / 100	162 ms	26136 KiB

power

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5;

int n, ans, dp[MAXN];
vector<int> g[MAXN];
string s;

void dfs(int u, int p){
	if(s[u] == '1'){
		dp[u] = -1;
		for(int &v : g[u]){
			if(v == p) continue;
			dfs(v, u);
			ans = max(ans, 1 + dp[v]);
			dp[u] += dp[v];
		}
		dp[u] = max(dp[u], 1);
	}else{
		for(int &v : g[u]){
			if(v == p) continue;
			dfs(v, u);
			dp[u] += dp[v];
		}
	}
	ans = max(ans, dp[u]);
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	for(int i=1; i<n; ++i){
		int u, v; cin >> u >> v;
		--u, --v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	cin >> s;
	dfs(0, 0);
	cout << ans;
}

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 53 / 53