Submission #294089

#	Time	Username	Problem	Language	Result	Execution time	Memory
294089		BThero	Power Plant (JOI20_power)	C++17	0 / 100	1 ms	384 KiB

power

// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = (int)2e3 + 5;

vector<int> adj[MAXN];
char can[MAXN];
int dp[MAXN];
int n;

void dfs(int v, int pr = -1) {
  vector<int> sons;

  for (int to : adj[v]) {
    if (to != pr) {
      dfs(to, v);
      sons.pb(to);
    }
  }
  
  if (can[v] == '1') {
    dp[v] = 1;
    int S = -1;
    
    for (int to : sons) {
      S += dp[to];
    }
    
    dp[v] = max(dp[v], S);
  }
  else {
    dp[v] = 0;
  
    for (int to : sons) {
      dp[v] += dp[to];
    }
  }
}

void solve() {
  scanf("%d", &n);
  
  for (int i = 1; i < n; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    adj[u].pb(v);
    adj[v].pb(u);
  }
  
  scanf("%s", can + 1);
  int ans = 0;
  
  for (int root = 1; root <= n; ++root) {
    dfs(root);
    ans = max(ans, dp[root]);
  }
  
  printf("%d\n", ans);
}

int main() {
  int tt = 1;
  
  while (tt--) {
    solve();
  }

  return 0;
}

Compilation message (stderr)

power.cpp: In function 'void solve()':
power.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
power.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   58 |     scanf("%d %d", &u, &v);
      |     ~~~~~^~~~~~~~~~~~~~~~~
power.cpp:63:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |   scanf("%s", can + 1);
      |   ~~~~~^~~~~~~~~~~~~~~

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