Leetcode 2322 Minimum Score After Removals on a Tree Solution in c++ | Hindi Coding Community

 

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

Remove two distinct edges of the tree to form three connected components. For a pair of removed edges, the following steps are defined:

1. Get the XOR of all the values of the nodes for each of the three components respectively.
2. The difference between the largest XOR value and the smallest XOR value is the score of the pair.

• For example, say the three components have the node values: [4,5,7], [1,9], and [3,3,3]. The three XOR values are 4 ^ 5 ^ 7 = 6, 1 ^ 9 = 8, and 3 ^ 3 ^ 3 = 3. The largest XOR value is 8 and the smallest XOR value is 3. The score is then 8 - 3 = 5.

Return the minimum score of any possible pair of edge removals on the given tree.

 

Example 1:

Input: nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]
Output: 9
Explanation: The diagram above shows a way to make a pair of removals.
- The 1st component has nodes [1,3,4] with values [5,4,11]. Its XOR value is 5 ^ 4 ^ 11 = 10.
- The 2nd component has node [0] with value [1]. Its XOR value is 1 = 1.
- The 3rd component has node [2] with value [5]. Its XOR value is 5 = 5.
The score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.
It can be shown that no other pair of removals will obtain a smaller score than 9.

Example 2:

Input: nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]
Output: 0
Explanation: The diagram above shows a way to make a pair of removals.
- The 1st component has nodes [3,4] with values [4,4]. Its XOR value is 4 ^ 4 = 0.
- The 2nd component has nodes [1,0] with values [5,5]. Its XOR value is 5 ^ 5 = 0.
- The 3rd component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.
The score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.
We cannot obtain a smaller score than 0.

 

Constraints:

• n == nums.length
• 3 <= n <= 1000
• 1 <= nums[i] <= 108
• edges.length == n - 1
• edges[i].length == 2
• 0 <= ai, bi < n
• ai != bi
• edges represents a valid tree.

C++ COde :

class Solution {

vector<bool> visited;

vector<vector<int>> pc, adj; // pc is the parent child edge in our dfs

vector<vector<bool>> childs; // 2D array to store that i is a parent of j

vector<int> child_xor, nums, par; // child_xor to store result of xors of a child node and par is a gloable array to track the parents of a node in dfs

int dfs(int i) {

int ans = nums[i];

visited[i] = true;

for (int p: par) childs[p][i] = true; // Defining this node as the child of all its parents

par.push_back(i);

for (int child: adj[i])

if (!visited[child]) {

pc.push_back({i, child});

ans ^= dfs(child); // Recurcively calculating xors

}

par.pop_back();

return child_xor[i] = ans;

}

public:

int minimumScore(vector<int>& nums, vector<vector<int>>& edges) {

// Initialising gloable variables

int n = nums.size(), ans = INT_MAX;

visited = vector<bool>(n);

pc = vector<vector<int>>();

adj = vector<vector<int>>(n);

child_xor = vector<int>(n, 0);

childs = vector<vector<bool>>(n, vector<bool>(n, false));

this->nums = nums;

par = vector<int>();

// Creating an adjacency matrix

for (vector<int> &edge: edges) adj[edge[0]].push_back(edge[1]), adj[edge[1]].push_back(edge[0]);

dfs(0);

for (int i = 0; i < pc.size(); i++)

for (int j = i + 1; j < pc.size(); j++) { // removing an edge i and j

int a = pc[i][1], b = pc[j][1]; // node that will come below when you delete an edge i and j

int xa = child_xor[a], xb = child_xor[b], xc = child_xor[0];

if (childs[a][b])

xc ^= xa, xa ^= xb;

else

xc ^= xa, xc ^= xb;

ans = min(max(xa, max(xb, xc)) - min(xa, min(xb, xc)), ans);

}

return ans;

}

};