oj.uz

답안 #1004732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004732 2024-06-21T13:22:04 Z julian Power Plant (JOI20_power) C++
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

long dfs(long v, long parent, std::vector<std::vector<long>>& adj, std::vector<bool>& b, std::vector<std::pair<long, long>>& dp, bool blocked) {
	if (!blocked && dp[v].first != std::numeric_limits<long>::max()) return dp[v].first;
	if (blocked && dp[v].second != std::numeric_limits<long>::max()) return dp[v].second;

	dp[v].first = 0;
	dp[v].second = 0;

	if (b[v - 1]) {
		long max = 0;

		for (long e : adj[v]) {
			if (e == parent) continue;
			dp[v].first += dfs(e, v, adj, b, dp, 0);
			dp[v].second = std::max(dp[v].second, dfs(e, v, adj, b, dp, 1));
			max = std::max(max, dp[v].first);
		}

		dp[v].first = std::max(dp[v].first - 1l, 1l);
		dp[v].second = std::max(dp[v].second - 1l, max + 1l);

	} else {
		// Power plant doesn't matter
		dp[v].first = 0;
		dp[v].second = 0;
		for (long e : adj[v]) {
			if (e == parent) continue;
			dp[v].first += dfs(e, v, adj, b, dp, 0);
			dp[v].second = std::max(dp[v].second, dfs(e, v, adj, b, dp, 1));
		}
	}

	return blocked ? dp[v].second : dp[v].first;
}

int main() {
	long n;
	std::cin >> n;

	std::vector<std::vector<long>> adj(n + 1, std::vector<long>());

	std::vector<std::pair<long, long>> dp(n + 1, std::pair<long, long>{std::numeric_limits<long>::max(), std::numeric_limits<long>::max()});

	for (long i = 0; i < n - 1; i++) {
		long a, b;
		std::cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}

	std::string s;
	std::cin >> s;

	std::vector<bool> b(n);
	for (size_t i = 0; i < n; i++) {
		b[i] = s[i] == '1';
	}

	dfs(1, 0, adj, b, dp, 0);
	dfs(1, 0, adj, b, dp, 1);

	long m = 0;

	for (size_t i = 1; i < dp.size(); i++) {
		m = std::max({m, dp[i].first, dp[i].second});
	}

	std::cout << m << std::endl;
}

Compilation message

power.cpp: In function 'int main()':
power.cpp:56:23: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'long int' [-Wsign-compare]
   56 |  for (size_t i = 0; i < n; i++) {
      |                     ~~^~~

Subtask #1
0.0 / 6.0

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

Subtask #2
0.0 / 41.0

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

Subtask #3
0.0 / 53.0

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