Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <unordered_map>
- using namespace std;
- const int INF = 1e9 + 1;
- vector<int> g[100];
- int pr[100];
- int q[100];
- int dp[100][2];
- void dfs(int ver) {
- dp[ver][0] = 0;
- dp[ver][1] = q[ver];
- for (const auto& i : g[ver]) {
- if (i != pr[ver]) {
- dfs(i);
- dp[ver][0] += max(dp[i][0], dp[i][1]);
- dp[ver][1] += dp[i][0];
- }
- }
- }
- int main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- int n;
- cin >> n;
- int root = 0;
- for (int i = 0; i < n; ++i) {
- cin >> pr[i] >> q[i];
- --pr[i];
- if (pr[i] == -1) {
- root = i;
- } else {
- g[pr[i]].emplace_back(i);
- }
- }
- dfs(root);
- cout << max(dp[root][0], dp[root][1]);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement