Skip to main content

Graph - Medium Level - Question 1

Graph - Medium Level - Question 1


Leetcode 2049. Count Nodes With the Highest Score

There is a binary tree rooted at 0 consisting of n nodes. The nodes are labeled from 0 to n - 1. You are given a 0-indexed integer array parents representing the tree, where parents[i] is the parent of node i. Since node 0 is the root, parents[0] == -1.

Each node has a score. To find the score of a node, consider if the node and the edges connected to it were removed. The tree would become one or more non-empty subtrees. The size of a subtree is the number of the nodes in it. The score of the node is the product of the sizes of all those subtrees.

Return the number of nodes that have the highest score.


Constraints:


n == parents.length

2 <= n <= 10^5

parents[0] == -1

0 <= parents[i] <= n - 1 for i != 0

parents represents a valid binary tree.


Analysis:

If we have had the binary tree, then we just can do a top-down count, to count the number of nodes for the sub-tree with the root as the current nodes. But we do not have the tree, instead, we only know the parents of each nodes.

So we need to construct the binary tree by ourselves. This process can be generalized to build a graph.

Since we need to know the number of nodes of the subtree with the root as the current node, so we need to know the children nodes of each nodes. And also we need to know the root.

For this question, we can use a two dimensional array to simply the graph notation. The array index would be the node index, and the array contents are for the children nodes.

After having the graph, we can do a top-down traversal to count the number of nodes "below" the node, starting with the root node. A dynamical programming trick is needed here as well, to record the numbers.

After having all the information we need, we can check each node, to see which one give the highest score, and count its times. If the node is the root, we just need to check its children nodes.


See the code below:


class Solution {
public:
    int countHighestScoreNodes(vector<int>& parents) {
        int n = parents.size(), root = 0;
        long res = -1, num = 0;
        vector<long> dp(n, 0);
        vector<vector<long>> g(n);
        for(int i=0; i<n; ++i) {
            if(parents[i] == -1) root = i;
            else g[parents[i]].push_back(i);
        }
        ct(root, g, dp);
        for(int i=0; i<n; ++i) {
            // cout<<i<<" "<<dp[i]<<endl;
        }
        for(int i=0; i<n; ++i) {
            long one = 0;
            if(i == root) {
                if(g[i].size() == 2) one = dp[g[i][0]]*dp[g[i][1]];
                else if(g[i].size() == 1) one = dp[g[i][0]];
            }
            else {
                if(g[i].size() == 0) one = dp[root] - 1;
                else if(g[i].size() == 1) one = dp[g[i][0]] *(dp[root] - dp[i]);
                else if(g[i].size() == 2) one = dp[g[i][0]] * dp[g[i][1]] * (dp[root] - dp[i]);
            }
            if(res < one) {
                res = one;
                num = 1;
            }
            else if(res == one) ++num;
        }
        return num;
    }
private:
    long ct(int root, vector<vector<long>>& g, vector<long>& dp) {
        for(auto &a : g[root]) {
            dp[root] += ct(a, g, dp);
        }
        return dp[root] += 1;
    }
};


Made some change to let the code can be used for a n-ary tree:


class Solution {
public:
    int countHighestScoreNodes(vector<int>& parents) {
        int n = parents.size(), root = 0;
        long res = -1, num = 0;
        vector<long> dp(n, 0);
        vector<vector<long>> g(n);
        for(int i=0; i<n; ++i) {
            if(parents[i] == -1) root = i;
            else g[parents[i]].push_back(i);
        }
        ct(root, g, dp);
        for(int i=0; i<n; ++i) {
            long one = i == root ? 1 : dp[root] - dp[i];
            for(auto &a : g[i]) {
                one *= dp[a];
            }
            if(res < one) {
                res = one;
                num = 1;
            }
            else if(res == one) ++num;
        }
        return num;
    }
private:
    long ct(int root, vector<vector<long>>& g, vector<long>& dp) {
        for(auto &a : g[root]) {
            dp[root] += ct(a, g, dp);
        }
        return dp[root] += 1;
    }
};


Upper Layer

Comments

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...