Solve the attached problem in the C++ language The country of Hackerland can be represented as a

 Solve the attached problem in the C++ language

Transcribed Image Text:

The country of Hackerland can be represented as a tree of g_nodes numbered from 1 to g_nodes where the ith edge represents a road that connects the cities g_from[i] and g_to[i]. Suppose the maximum distance, i.e. the number of edges between any two cities, is mx. A city is primary if it lies on the simple path between two cities u and v such that the distance between u and vis equal to mx. All other cities are secondary. Find the sum of indices of all the secondary cities. Example g_nodes = 4 g_from=[1,1,2] g_to= [2, 3, 4] 2 4 1 3 The maximum distance between any two nodes is 3, the pair (3, 4). All the cities on the path 3 --> 1 -- > 2 --> 4 are primary. Since no city is secondary, the answer is 0. Function Description Complete the function getSecondaryCitySum in the editor below. getSecondaryCitySum has the following parameters: int g_nodes: number of nodes in the tree int g from/g edges]: one end of each edge The country of Hackerland can be represented as a tree of g_nodes numbered from 1 to g_nodes where the ith edge represents a road that connects the cities g_from[i] and g_to[i]. Suppose the maximum distance, i.e. the number of edges between any two cities, is mx. A city is primary if it lies on the simple path between two cities u and v such that the distance between u and vis equal to mx. All other cities are secondary. Find the sum of indices of all the secondary cities. Example g_nodes = 4 g_from=[1,1,2] g_to= [2, 3, 4] 2 4 1 3 The maximum distance between any two nodes is 3, the pair (3, 4). All the cities on the path 3 --> 1 -- > 2 --> 4 are primary. Since no city is secondary, the answer is 0. Function Description Complete the function getSecondaryCitySum in the editor below. getSecondaryCitySum has the following parameters: int g_nodes: number of nodes in the tree int g from/g edges]: one end of each edge The country of Hackerland can be represented as a tree of g_nodes numbered from 1 to g_nodes where the ith edge represents a road that connects the cities g_from[i] and g_to[i]. Suppose the maximum distance, i.e. the number of edges between any two cities, is mx. A city is primary if it lies on the simple path between two cities u and v such that the distance between u and vis equal to mx. All other cities are secondary. Find the sum of indices of all the secondary cities. Example g_nodes = 4 g_from=[1,1,2] g_to= [2, 3, 4] 2 4 1 3 The maximum distance between any two nodes is 3, the pair (3, 4). All the cities on the path 3 --> 1 -- > 2 --> 4 are primary. Since no city is secondary, the answer is 0. Function Description Complete the function getSecondaryCitySum in the editor below. getSecondaryCitySum has the following parameters: int g_nodes: number of nodes in the tree int g from/g edges]: one end of each edge

Answer rating: 100% (QA)

include include include using namespace std void dfsint node vector graph vector visited unordere... View the full answer