Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Problem Given the employee's traversal of the park, and the exhibits that the visitors want to visit determine how many unique monkeys the visitor will see on their way from the entrance to the exhibit and then back. Input Input will begin with a line containing 1 integer, n (1 ≤ n ≤ 200,000), representing the number of exhibits in the park (including the entrance). The following line contains 2 integers, i and m (i = 1; 1 ≤ m ≤ 5,000), representing the ID of the entrance and the number of monkeys at the entrance. Each of the following 2n - 2 lines will contain a path description recorded by our employee. If this is the first time the employee used the path, then the line will contain two integers, i and m (2 ≤ i ≤n; 1 ≤m≤ 5,000), representing the ID of the destination exhibit and the monkeys at the destination exhibit respectively. If this is the second time the path is used, then the line will contain the integer -1 instead, since the ID and number of monkeys were already recorded. You can assume that the monkeys don't move between exhibits.

Problem Given the employee's traversal of the park, and the exhibits that the visitors want to visit determine how many unique monkeys the visitor will see on their way from the entrance to the exhibit and then back. Input Input will begin with a line containing 1 integer, n (1 ≤ n ≤ 200,000), representing the number of exhibits in the park (including the entrance). The following line contains 2 integers, i and m (i = 1; 1 ≤ m ≤ 5,000), representing the ID of the entrance and the number of monkeys at the entrance. Each of the following 2n - 2 lines will contain a path description recorded by our employee. If this is the first time the employee used the path, then the line will contain two integers, i and m (2 ≤ i ≤n; 1 ≤m≤ 5,000), representing the ID of the destination exhibit and the monkeys at the destination exhibit respectively. If this is the second time the path is used, then the line will contain the integer -1 instead, since the ID and number of monkeys were already recorded. You can assume that the monkeys don't move between exhibits.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

C-Language. Stacks or Trees.

I am having issues with this program. I am trying to achieve this currently by using a stack in the C language. But I have reached a lull. 

**Monkey Business** **Objective** - Give practice with Trees (or tree-like input) in C. - Give practice with Stacks in C. **Story** Your park has a new layout. The park is modeled as a collection of exhibits (including the entrance of the park) each with their unique ID. There are also paths in your park. Each path connects a pair of exhibits. Additionally, between each pair of exhibits, there is exactly 1 sequence of unique paths that connects. One aspect of the park that draws in a lot of guests is the monkeys that hang around each exhibit (including the entrance of the park). Guests that visit your park love to see a lot of monkeys. However, the guests are very busy, so they typically have time to walk from the entrance to one particular exhibit, then walk back to the entrance to leave. They don’t visit any more exhibits than necessary. You were going to give the visitors a map so that they could plan out the visits that would enable them to visit the most monkeys, but someone swiped your reference map. Now you want to settle for telling the guests how many distinct monkeys they will see in their visit to your park. Luckily, you have a dedicated employee that walked the entire park to give you a report of the existing pathways and the monkeys at each location. The employee started at the entrance and crossed all pathways exactly twice. The first time the employee reached a location they wrote down a unique integer ID for the location and the number of monkeys they saw. Every time they used a pathway a second time they reached an exhibit they had already seen, so they noted that the exhibit had already been recorded in their notes. The employee may have visited an exhibit multiple times. **Problem** Given the employee's traversal of the park, and the exhibits that the visitors want to visit determine how many unique monkeys the visitor will see on their way from the entrance to the exhibit and then back. **Input** Input will begin with a line containing 1 integer, \( n \) (1 ≤ \( n \) ≤ 200,000), representing the number of exhibits in the park (including the entrance). The following line contains 2 integers, \( i \) and \( m \) (i = 1; 1 ≤ \( m \) ≤ 5,000), representing the ID of the entrance and the number of monkeys at the entrance. Each of the following \( 2n - 2 \)
Transcribed Image Text:**Monkey Business** **Objective** - Give practice with Trees (or tree-like input) in C. - Give practice with Stacks in C. **Story** Your park has a new layout. The park is modeled as a collection of exhibits (including the entrance of the park) each with their unique ID. There are also paths in your park. Each path connects a pair of exhibits. Additionally, between each pair of exhibits, there is exactly 1 sequence of unique paths that connects. One aspect of the park that draws in a lot of guests is the monkeys that hang around each exhibit (including the entrance of the park). Guests that visit your park love to see a lot of monkeys. However, the guests are very busy, so they typically have time to walk from the entrance to one particular exhibit, then walk back to the entrance to leave. They don’t visit any more exhibits than necessary. You were going to give the visitors a map so that they could plan out the visits that would enable them to visit the most monkeys, but someone swiped your reference map. Now you want to settle for telling the guests how many distinct monkeys they will see in their visit to your park. Luckily, you have a dedicated employee that walked the entire park to give you a report of the existing pathways and the monkeys at each location. The employee started at the entrance and crossed all pathways exactly twice. The first time the employee reached a location they wrote down a unique integer ID for the location and the number of monkeys they saw. Every time they used a pathway a second time they reached an exhibit they had already seen, so they noted that the exhibit had already been recorded in their notes. The employee may have visited an exhibit multiple times. **Problem** Given the employee's traversal of the park, and the exhibits that the visitors want to visit determine how many unique monkeys the visitor will see on their way from the entrance to the exhibit and then back. **Input** Input will begin with a line containing 1 integer, \( n \) (1 ≤ \( n \) ≤ 200,000), representing the number of exhibits in the park (including the entrance). The following line contains 2 integers, \( i \) and \( m \) (i = 1; 1 ≤ \( m \) ≤ 5,000), representing the ID of the entrance and the number of monkeys at the entrance. Each of the following \( 2n - 2 \)
The text provides a description of a problem involving park visitors and their visits to exhibits, along with sample input and output data. ### Problem Description: - You are given a number of visitors to a park, denoted as `v` (where 1 ≤ `v` ≤ 500,000). - This is followed by `v` lines, each containing a single integer `e` (1 ≤ `e` ≤ `n`), representing the ID of the exhibit that the visitor is going to visit. ### Output Requirements: - The output should contain `v` lines. - Each line should contain an integer representing the number of unique monkeys seen in the corresponding visitor's park visit. - The output should be in the order of the input. ### Sample Data: #### Sample Input: ``` 4 1 10 2 13 4 25 -1 3 6 -1 -1 3 4 3 2 ``` #### Sample Output: ``` 48 29 23 ``` Another set of input and output is provided below: #### Sample Input: ``` 5 1 1 2 2 3 3 -1 -1 4 4 5 5 -1 -1 2 3 5 ``` #### Sample Output: ``` 6 10 ``` ### Explanation of Table: The table is divided into two sections: Sample Input and Sample Output. Each section contains numbered entries that correspond to the number of visitors and the expected results based on the input data provided. This structure helps in understanding the relationship between multiple visitor scenarios and the kind of outputs that are expected for each case as per the given conditions.
Transcribed Image Text:The text provides a description of a problem involving park visitors and their visits to exhibits, along with sample input and output data. ### Problem Description: - You are given a number of visitors to a park, denoted as `v` (where 1 ≤ `v` ≤ 500,000). - This is followed by `v` lines, each containing a single integer `e` (1 ≤ `e` ≤ `n`), representing the ID of the exhibit that the visitor is going to visit. ### Output Requirements: - The output should contain `v` lines. - Each line should contain an integer representing the number of unique monkeys seen in the corresponding visitor's park visit. - The output should be in the order of the input. ### Sample Data: #### Sample Input: ``` 4 1 10 2 13 4 25 -1 3 6 -1 -1 3 4 3 2 ``` #### Sample Output: ``` 48 29 23 ``` Another set of input and output is provided below: #### Sample Input: ``` 5 1 1 2 2 3 3 -1 -1 4 4 5 5 -1 -1 2 3 5 ``` #### Sample Output: ``` 6 10 ``` ### Explanation of Table: The table is divided into two sections: Sample Input and Sample Output. Each section contains numbered entries that correspond to the number of visitors and the expected results based on the input data provided. This structure helps in understanding the relationship between multiple visitor scenarios and the kind of outputs that are expected for each case as per the given conditions.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Thank you.  I see that this works, but I am trying to work with the stack operators. Can you show me how you would implement  'pop' and 'push' in this scenario?

Solution
Bartleby Expert
SEE SOLUTION
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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…
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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS