Submission #963805

#	Time	Username	Problem	Language	Result	Execution time	Memory
963805		Trisanu_Das	Power Plant (JOI20_power)	C++17	47 / 100	1591 ms	15532 KiB

power

#include <bits/stdc++.h>
using namespace std;
 
string s;
vector<int> V[200005], dp(200005, 0);
bool vis[200005];
     
void dfs(int v, int root) {
   	vis[v] = 1;
   	dp[v] = s[v - 1] - '0';
   	int rb = 0, rc = 0;
   	for(int i = 0; i < V[v].size(); i++) {
   		int u = V[v][i];
   		if(!vis[u]) {
   			dfs(u, root);
   			rb += dp[u];
   			rc = max(rc, dp[u]);
   		}
   	}
   	if(v == root)
   		dp[v] = rc + 1;
   	else {
   		rb -= s[v-1] - '0';
   		dp[v] = max(dp[v], rb);
   	}
}
    
int main() {
 	int n;
   	cin>>n;
   	for(int i=0; i<(n-1); i++) {
   		int a, b;
   		cin>>a>>b;
   		V[a].push_back(b);
   		V[b].push_back(a);
   	}
   	cin>>s;
   	int ans = 0;
   	for(int i=1; i<=n; i++) {
  		if(s[i-1] == '1') {
   			for(int i = 1; i <= n; i++) dp[i] = vis[i] = 0;
   			dfs(i, i);
   			ans = max(ans, dp[i]);
   		}
   	}
 	cout<<ans;
}

Compilation message (stderr)

power.cpp: In function 'void dfs(int, int)':
power.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i = 0; i < V[v].size(); i++) {
      |                    ~~^~~~~~~~~~~~~

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