oj.uz

답안 #493634

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493634 2021-12-12T12:43:35 Z 600Mihnea Power Plant (JOI20_power) C++17
0 / 100
 4 ms 4940 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int) 2e5 + 7;
int n;
int sol;
int dp[N];
int is[N];
vector<int> g[N];
string s;

void build(int a, int p = -1) {
  dp[a] = 0;
  for (auto &b : g[a]) {
    if (b != p) {
      build(b, a);
      dp[a] += dp[b];
    }
  }
  dp[a] -= is[a];
  int dp2 = 0;
  for (auto &b : g[a]) {
    if (b != p) {
      dp2 = max(dp2, dp[a]);
    }
  }
  dp[a] = max(dp[a], dp2 + is[a]);
}
int main() {
  ios::sync_with_stdio(0); cin.tie(0);

  ///freopen ("input.txt", "r", stdin);

  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++) {
    is[i] = s[i - 1] - '0';
  }
  for (int i = 1; i <= n; i++) {
    build(i);
    sol = max(sol, dp[i]);
  }
  cout << sol << "\n";

  return 0;
}

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Incorrect 4 ms 4940 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Incorrect 4 ms 4940 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Incorrect 4 ms 4940 KB Output isn't correct
6 Halted 0 ms 0 KB -