oj.uz

Submission #493631

# Submission time Handle Problem Language Result Execution time Memory
493631 2021-12-12T12:32:12 Z 600Mihnea Power Plant (JOI20_power) C++17
0 / 100
 3 ms 4944 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int) 2e5 + 7;
int n, sub[N], total, best;
vector<int> g[N];
string s;

void build(int a, int p = -1) {
  int cnt = -sub[a];
  for (auto &b : g[a]) {
    if (b == p) {
      continue;
    }
    build(b, a);
    cnt += (sub[b] > 0);
    sub[a] += sub[b];
  }
  cnt += (sub[a] < total);
  best = max(best, cnt);
}

int main() {
  ios::sync_with_stdio(0); cin.tie(0);

  cin >> n;
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  cin >> s;
  for (int i = 1; i <= n; i++) {
    sub[i] = s[i - 1] - '0';
    total += sub[i];
  }
  best = (total > 0);
  build(1);
  cout << best << "\n";

  return 0;
}

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Incorrect 3 ms 4944 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Incorrect 3 ms 4944 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Incorrect 3 ms 4944 KB Output isn't correct
4 Halted 0 ms 0 KB -