Skip to main content

Root the Tree codechef lunchtime solution| codechef lunchtime problem editorial

 Root the Tree codechef lunchtime solution| codechef lunchtime problem editorial-

Problem Statement->

directed tree is a directed graph such that if all edges were undirected, this graph would be a tree. A rooted directed tree is a directed tree in which there is one vertex (the root, let's denote it by r) such that it is possible to reach all vertices of the graph from r by moving along the directed edges.

You are given a directed tree with N vertices (numbered 1 through N). You may perform the following operation on it any number of times (including zero):

  • Choose some edge which currently exists in the graph.
  • Remove this edge.
  • Add a new edge in such a way that the graph becomes a directed tree again.

What is the smallest number of operations which need to be performed in order to make the directed tree rooted?

Input

  • The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
  • The first line of each test case contains a single integer N.
  • Each of the next N1 lines contains two space-separated integers u and v denoting that there is a directed edge from u to v in the tree.

Output

For each test case, print a single line containing one integer ― the smallest number of operations we need to perform to create a rooted directed tree.

Constraints

  • 1N104
  • 1u,vN
  • the graph described on the input is a directed tree
  • the sum of N over all test cases does not exceed 105

Subtasks

Subtask #1 (20 points): for each edge, u=1 or v=1 (the graph is a directed star)

Subtask #2 (80 points): original constraints

Example Input

2
3
1 2
3 2
3
1 2
2 3

Example Output

1
0

Explanation

Example case 1: We can delete the edge from vertex 3 to vertex 2 and insert an edge from 3 to 1. Then, the graph becomes a rooted directed tree with vertex 3 as the root. However, there are many other possible solutions.

Example case 2: The graph is already a rooted directed tree; the root is vertex 1.

Problem link-https://www.codechef.com/LTIME88B/problems/ROOTTREE

solution->

According to this problem we have given a graph and we have to convert this graph to a rooted directed tree means every node should have only one incoming edge and 1 outgoing edge.

 So my solution approach says that we will store the frequency of incoming edge of each vertex and 

if I found incoming edge frequency greater then 1 so will delete this edge and add to the new node so my final answer will increase by ans+=freq[i]-1;

after doing the same for all vertex I will get my final answer.

my code is mentioned below. Please check it .

Root the Tree codechef lunchtime solution| codechef lunchtime problem editorial


wait there is no need of creating any 2D boolean array sorry for that so delete that part of code.

Root the Tree codechef lunchtime code solution->


Comments

Popular posts from this blog

Vaccine Distribution Codechef December Long challenge solution 2020

 Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

   Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1