oj.uz

답안 #518745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518745 2022-01-24T14:23:00 Z cig32 Power Plant (JOI20_power) C++17
0 / 100
 5 ms 7372 KB 
#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.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7348 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 4 ms 7316 KB Output is correct
6 Correct 4 ms 7368 KB Output is correct
7 Incorrect 4 ms 7372 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7348 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 4 ms 7316 KB Output is correct
6 Correct 4 ms 7368 KB Output is correct
7 Incorrect 4 ms 7372 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7348 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 4 ms 7316 KB Output is correct
6 Correct 4 ms 7368 KB Output is correct
7 Incorrect 4 ms 7372 KB Output isn't correct
8 Halted 0 ms 0 KB -