oj.uz

답안 #1113838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113838 2024-11-17T15:01:05 Z Dan4Life Power Plant (JOI20_power) C++17
0 / 100
 2 ms 5712 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int N = (int)2e5+2;
int n;
string gen;
vector<int> adj[N];
int dp[N];

void dfs(int s, int p){
	vector<int> v; v.clear();
	for(auto u : adj[s]){
		if(u==p)continue;
		dfs(u,s); v.pb(dp[u]);
	}
	if(!sz(v)) {
		dp[s]=(gen[s]=='1');
		return;
	}
	int sum = 0, best = 0;
	for(auto u : v) sum+=u,best=max(best,u);
	if(gen[s]=='0') dp[s]=sum;
	else dp[s]=max(sum-1,best);
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n;
	for(int i = 1; i < n; i++){
		int a, b; cin >> a >> b;
		adj[a].pb(b), adj[b].pb(a);
	}
	cin >> gen; gen='$'+gen; dfs(1,0); 
	cout << *max_element(dp+1,dp+n+1) << "\n";
}

Subtask #1
0.0 / 6.0

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

Subtask #2
0.0 / 41.0

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

Subtask #3
0.0 / 53.0

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