You are given a tree of N nodes rooted at node 1 and each node has a value where value of i'th node is A₁. You're given Q queries, in each query two integers x, k given. Find if possible such that all nodes in the subtree of node a (including x) has values greater than or equal to k by performing swapping of two nodes any number of times. You can swap two nodes u and v such that u belongs to subtree of a (including x) and v does not. If possible then find minimum number of swapping of nodes required otherwise print -1. Note: Since the queries are independent, the initial tree is retained after each query. Input format • The first line contains T denoting the number of test cases. The description of each test case is as follows. o The first line contains an integer N denoting the number of nodes in tree. o Next line contains space-separated integers denoting value of each node. o Each of the following N-1 lines contain two integers u and v denoting edge between nodes u and V. o The next line contains a single integer Q- the number of queries. o Next Q lines contain two space-separated integers x, k. Output format For query print the answer in a new line.
You are given a tree of N nodes rooted at node 1 and each node has a value where value of i'th node is A₁. You're given Q queries, in each query two integers x, k given. Find if possible such that all nodes in the subtree of node a (including x) has values greater than or equal to k by performing swapping of two nodes any number of times. You can swap two nodes u and v such that u belongs to subtree of a (including x) and v does not. If possible then find minimum number of swapping of nodes required otherwise print -1. Note: Since the queries are independent, the initial tree is retained after each query. Input format • The first line contains T denoting the number of test cases. The description of each test case is as follows. o The first line contains an integer N denoting the number of nodes in tree. o Next line contains space-separated integers denoting value of each node. o Each of the following N-1 lines contain two integers u and v denoting edge between nodes u and V. o The next line contains a single integer Q- the number of queries. o Next Q lines contain two space-separated integers x, k. Output format For query print the answer in a new line.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![You are given a tree of N nodes rooted at node 1 and each node has a value where value of i'th node is A₁.
You're given Q queries, in each query two integers x, k given. Find if possible such that all nodes in the subtree
of node a (including x) has values greater than or equal to k by performing swapping of two nodes any number
of times. You can swap two nodes u and v such that u belongs to subtree of x (including x) and v does not. If
possible then find minimum number of swapping of nodes required otherwise print -1.
Note: Since the queries are independent, the initial tree is retained after each query.
Input format
• The first line contains T denoting the number of test cases. The description of each test case is as follows.
o The first line contains an integer N denoting the number of nodes in tree.
o Next line contains space-separated integers denoting value of each node.
o Each of the following N- 1 lines contain two integers u and v denoting edge between nodes u and
V.
o The next line contains a single integer Q- the number of queries.
o Next Q lines contain two space-separated integers x, k.
Output format
For query print the answer in a new line.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fae80583e-f47d-483b-b56f-e16ac006e166%2F545f5041-d3fa-4a04-8baa-038e7808615c%2Fmc0remi_processed.jpeg&w=3840&q=75)
Transcribed Image Text:You are given a tree of N nodes rooted at node 1 and each node has a value where value of i'th node is A₁.
You're given Q queries, in each query two integers x, k given. Find if possible such that all nodes in the subtree
of node a (including x) has values greater than or equal to k by performing swapping of two nodes any number
of times. You can swap two nodes u and v such that u belongs to subtree of x (including x) and v does not. If
possible then find minimum number of swapping of nodes required otherwise print -1.
Note: Since the queries are independent, the initial tree is retained after each query.
Input format
• The first line contains T denoting the number of test cases. The description of each test case is as follows.
o The first line contains an integer N denoting the number of nodes in tree.
o Next line contains space-separated integers denoting value of each node.
o Each of the following N- 1 lines contain two integers u and v denoting edge between nodes u and
V.
o The next line contains a single integer Q- the number of queries.
o Next Q lines contain two space-separated integers x, k.
Output format
For query print the answer in a new line.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY