LeetCode-Solutions/C++/minimum-increments-to-equalize-leaf-paths.cpp at master · kamyu104/LeetCode-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
// Time:  O(n)
// Space: O(n)

// iterative dfs
class Solution {
public:
    int minIncrease(int n, vector<vector<int>>& edges, vector<int>& cost) {
        vector<vector<int>> adj(n);
        for (const auto& e : edges) {
            adj[e[0]].emplace_back(e[1]);
            adj[e[1]].emplace_back(e[0]);
        }
        const auto& iter_dfs = [&]() {
            int result = n - 1;
            vector<int64_t> mx(n);
            vector<tuple<int, int, int>> stk = {{1, 0, -1}};
            while (!empty(stk)) {
                const auto [step, u, p] = stk.back(); stk.pop_back();
                if (step == 1) {
                    stk.emplace_back(2, u, p);
                    for (const auto& v : adj[u]) {
                        if (v == p) {
                            continue;
                        }
                        stk.emplace_back(1, v, u);
                    }
                } else if (step == 2) {
                    int cnt = 0;
                    for (const auto& v : adj[u]) {
                        if (v == p || mx[v] < mx[u]) {
                            continue;
                        }
                        if (mx[v] > mx[u]) {
                            mx[u] = mx[v];
                            cnt = 0;
                        }
                        ++cnt;
                    }
                    result -= cnt;
                    mx[u] += cost[u];
                }
            }
            return result;
        };

        return iter_dfs();
    }
};

// Time:  O(n)
// Space: O(n)
// dfs
class Solution2 {
public:
    int minIncrease(int n, vector<vector<int>>& edges, vector<int>& cost) {
        vector<vector<int>> adj(n);
        for (const auto& e : edges) {
            adj[e[0]].emplace_back(e[1]);
            adj[e[1]].emplace_back(e[0]);
        }
        int result = n - 1;
        const function<int64_t (int, int)> dfs = [&](int u, int p) {
            int64_t mx = 0;
            int cnt = 0;
            for (const auto& v : adj[u]) {
                if (v == p) {
                    continue;
                }
                const auto& c = dfs(v, u);
                if (c < mx) {
                    continue;
                }
                if (c > mx) {
                    mx = c;
                    cnt = 0;
                }
                ++cnt;
            }
            result -= cnt;
            return mx + cost[u];
        };

        dfs(0, -1);
        return result;
    }
};