Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
There are N local news outlets in the Ajobcity of Ajobdesh. All of these outlets are connected to each other via (N-1) bi-directional telephone lines. Only two of the N outlets have satellite access that can receive news events directly from the outside world. From these two outlets, the people then make phone calls to other outlets and pass the news down. At any given moment, a news outlet can talk to at most one other news outlet, as each of them has only one telephone device. However, the news can be transmitted between an arbitrary number of pairs simultaneously. For example, once a news event has been sent from outlet#1 to outlet #2, then it can be sent from outlet#1 to outlet #3 and outlet#2 to outlet #4 using the same amount of time, simultaneously. Interestingly, it only takes exactly 1 minute to send a piece of news from one outlet to another. Given the two outlets where the news event originated, can you find the minimum amount of time in minutes needed for all the outlets to receive the news? Input The first line of input contains the integer n, a, b, where, n, (2 s n ≤ 300000), is the number of news outlets, a and b, (1 ≤ a, b ≤ n), are the labels of the outlets where the original news event came in via sattelite communication. You can assume that a and b will not be the same outlets. Each of the following n - 1 lines contains two different integers x and y (1 ≤ x, y ≤ n) - the labels of the news outlets directly connected via a telephone line.

There are N local news outlets in the Ajobcity of Ajobdesh. All of these outlets are connected to each other via (N-1) bi-directional telephone lines. Only two of the N outlets have satellite access that can receive news events directly from the outside world. From these two outlets, the people then make phone calls to other outlets and pass the news down. At any given moment, a news outlet can talk to at most one other news outlet, as each of them has only one telephone device. However, the news can be transmitted between an arbitrary number of pairs simultaneously. For example, once a news event has been sent from outlet#1 to outlet #2, then it can be sent from outlet#1 to outlet #3 and outlet#2 to outlet #4 using the same amount of time, simultaneously. Interestingly, it only takes exactly 1 minute to send a piece of news from one outlet to another. Given the two outlets where the news event originated, can you find the minimum amount of time in minutes needed for all the outlets to receive the news? Input The first line of input contains the integer n, a, b, where, n, (2 s n ≤ 300000), is the number of news outlets, a and b, (1 ≤ a, b ≤ n), are the labels of the outlets where the original news event came in via sattelite communication. You can assume that a and b will not be the same outlets. Each of the following n - 1 lines contains two different integers x and y (1 ≤ x, y ≤ n) - the labels of the news outlets directly connected via a telephone line.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
Use Any Programming Language Hurry UP! Pls send me solution fast within 20 min and i will rate instantly for sure!!! Solution must be in typed form!!
There are N local news outlets in the Ajobcity of Ajobdesh. All of these outlets are connected to each other via (N-1) bi-directional telephone lines. Only two of the N outlets have satellite access that can receive news events directly from the outside world. From these two outlets, the people then make phone calls to other outlets and pass the news down. At any given moment, a news outlet can talk to at most one other news outlet, as each of them has only one telephone device. However, the news can be transmitted between an arbitrary number of pairs simultaneously. For example, once a news event has been sent from outlet#1 to outlet#2, then it can be sent from outlet#1 to outlet#3 and outlet#2 to outlet # 4 using the same amount of time, simultaneously. Interestingly, it only takes exactly 1 minute to send a piece of news from one outlet to another. Given the two outlets where the news event originated, can you find the minimum amount of time in minutes needed for all the outlets to receive the news? Input The first line of input contains the integer n, a, b, where, n, (2 ≤ n ≤ 300000), is the number of news outlets, a and b, (1 ≤ a, b ≤ n), are the labels of the outlets where the original news event came in via sattelite communication. You can assume that a and b will not be the same outlets. Each of the following n - 1 lines contains two different integers x and y (1 ≤ x, y ≤ n) - the labels of the news outlets directly connected via a telephone line. Output You must output the required minimal amount of time in minutes. Sample Input 621 12 23 24 15 56 Output 2 0
Transcribed Image Text:There are N local news outlets in the Ajobcity of Ajobdesh. All of these outlets are connected to each other via (N-1) bi-directional telephone lines. Only two of the N outlets have satellite access that can receive news events directly from the outside world. From these two outlets, the people then make phone calls to other outlets and pass the news down. At any given moment, a news outlet can talk to at most one other news outlet, as each of them has only one telephone device. However, the news can be transmitted between an arbitrary number of pairs simultaneously. For example, once a news event has been sent from outlet#1 to outlet#2, then it can be sent from outlet#1 to outlet#3 and outlet#2 to outlet # 4 using the same amount of time, simultaneously. Interestingly, it only takes exactly 1 minute to send a piece of news from one outlet to another. Given the two outlets where the news event originated, can you find the minimum amount of time in minutes needed for all the outlets to receive the news? Input The first line of input contains the integer n, a, b, where, n, (2 ≤ n ≤ 300000), is the number of news outlets, a and b, (1 ≤ a, b ≤ n), are the labels of the outlets where the original news event came in via sattelite communication. You can assume that a and b will not be the same outlets. Each of the following n - 1 lines contains two different integers x and y (1 ≤ x, y ≤ n) - the labels of the news outlets directly connected via a telephone line. Output You must output the required minimal amount of time in minutes. Sample Input 621 12 23 24 15 56 Output 2 0
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Network Transmission Cabling
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS