Submission #518745

#	Time	Username	Problem	Language	Result	Execution time	Memory
518745		cig32	Power Plant (JOI20_power)	C++17	0 / 100	5 ms	7372 KiB

power

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
 
vector<int> adj[MAXN];
char c[MAXN];
int dpf(int node, int prev) {
  int sum = 0, mx = 0;
  for(int x: adj[node]) {
    if(x != prev) {
      int d = dpf(x, node);
      sum += d;
      mx = max(mx, d);
    }
  }
  if(prev == -1) {
    return max(mx + 1, sum - 1);
  }
  if(c[node] == '0') {
    return sum;
  }
  else {
    return max(1ll, sum - 1);
  }
}
void solve(int tc) {
  int N;
  cin >> N;
  for(int i=1; i<N; i++) {
    int a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  if(N == 1) {
    cout << "1\n"; return;
  }
  for(int i=1; i<=N; i++) cin >> c[i];
  int ans = 0;
  for(int i=1; i<=N; i++) {
    if(c[i] == '1') {
      ans = max(ans, dpf(i, -1));
      cout << ans << "\n";
      return;
    }
  }
  cout << ans << "\n";
}
 
int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} 

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