Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
The bad thing about being an international Man of Mystery (MoM) is there's usually someone who wants to kill you. Sometimes you have to stay on the run just to stay alive. You have to think ahead. You have to make sure you don't end up trapped somewhere with no escape. Of course, not all MoMs are blessed with a great deal of intelligence. You are going to write a program to help them out. You are going to make sure our MoM knows what cities are safe to visit and which are not. It's not enough to just be able to run (or fly) for one or two days, we have to guarantee that the MoM can keep running for as long as might be necessary. Given a list of regular, daily flights between pairs of cities, you are going to make sure our MoM never gets stuck in a city from which there is no escape. We'll say there is an escape from some location if there is an infinitely long sequence of cities the MoM could fly to making one flight each day. Input Input starts with a number, 1

The bad thing about being an international Man of Mystery (MoM) is there's usually someone who wants to kill you. Sometimes you have to stay on the run just to stay alive. You have to think ahead. You have to make sure you don't end up trapped somewhere with no escape. Of course, not all MoMs are blessed with a great deal of intelligence. You are going to write a program to help them out. You are going to make sure our MoM knows what cities are safe to visit and which are not. It's not enough to just be able to run (or fly) for one or two days, we have to guarantee that the MoM can keep running for as long as might be necessary. Given a list of regular, daily flights between pairs of cities, you are going to make sure our MoM never gets stuck in a city from which there is no escape. We'll say there is an escape from some location if there is an infinitely long sequence of cities the MoM could fly to making one flight each day. Input Input starts with a number, 1

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
Sample Input 1 Arlington San Antonio San Antonio Baltimore Baltimore Vew_York New_York Dallas Baltimore Arlington San Antonio Baltimore New_York Sample Output 1 San Antonio safe Baltimore safe New_York trapped
Transcribed Image Text:Sample Input 1 Arlington San Antonio San Antonio Baltimore Baltimore Vew_York New_York Dallas Baltimore Arlington San Antonio Baltimore New_York Sample Output 1 San Antonio safe Baltimore safe New_York trapped
The bad thing about being an international Man of Mystery (MoM) is there's usually someone who wants to kill you. Sometimes you have to stay on the run just to stay alive. You have to think ahead. You have to make sure you don't end up trapped somewhere with no escape. Of course, not all MoMs are blessed with a great deal of intelligence. You are going to write a program to help them out. You are going to make sure our MoM knows what cities are safe to visit and which are not. It's not enough to just be able to run (or fly) for one or two days, we have to guarantee that the MoM can keep running for as long as might be necessary. Given a list of regular, daily flights between pairs of cities, you are going to make sure our MOM never gets stuck in a city from which there is no escape. We'll say there is an escape from some location if there is an infinitely long sequence of cities the MOM could fly to making one flight each day. Input Input starts with a number, 1<n< 5 000, giving the number of daily flights there are between pairs of cities. Each of the next n lines contain a pair of city names separated by a space. Each city name is a string of up to 30 characters using only characters a-z, A-Z, and underscore. A line containing the nam o followed d indicates that there is a one-way flight from city o to city d every day. There are no flights that originate from and are destined for the same city. The description of daily flights is followed by a list of up to 1 000 city names that have previously been named, one per line. The list ends at end of file. Output Your job is to examine the list of city names at the end and determine whether or not there is an escape from each one. For each, output the name of the city, followed by the word "safe" if there is an escape and "trapped" if there is no escape.
Transcribed Image Text:The bad thing about being an international Man of Mystery (MoM) is there's usually someone who wants to kill you. Sometimes you have to stay on the run just to stay alive. You have to think ahead. You have to make sure you don't end up trapped somewhere with no escape. Of course, not all MoMs are blessed with a great deal of intelligence. You are going to write a program to help them out. You are going to make sure our MoM knows what cities are safe to visit and which are not. It's not enough to just be able to run (or fly) for one or two days, we have to guarantee that the MoM can keep running for as long as might be necessary. Given a list of regular, daily flights between pairs of cities, you are going to make sure our MOM never gets stuck in a city from which there is no escape. We'll say there is an escape from some location if there is an infinitely long sequence of cities the MOM could fly to making one flight each day. Input Input starts with a number, 1<n< 5 000, giving the number of daily flights there are between pairs of cities. Each of the next n lines contain a pair of city names separated by a space. Each city name is a string of up to 30 characters using only characters a-z, A-Z, and underscore. A line containing the nam o followed d indicates that there is a one-way flight from city o to city d every day. There are no flights that originate from and are destined for the same city. The description of daily flights is followed by a list of up to 1 000 city names that have previously been named, one per line. The list ends at end of file. Output Your job is to examine the list of city names at the end and determine whether or not there is an escape from each one. For each, output the name of the city, followed by the word "safe" if there is an escape and "trapped" if there is no escape.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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