The Dream SMP is the first place to be attacked by the army of the creepers and zombies. Dream with Mr. Beast has to take some important decisions to minimize the damage from the zombies. Dream SMP can be denoted as a graph with N nodes. There are M roads each connecting 2 nodes - Ai and Bi. The road is directed from node Ai to Bi, and not vice-versa. The power required to travel on this road is Ci initially. Also, Dream SMP is built in such a way that it is not possible to visit the same node twice using these roads. That is, you cannot start at a node, follow some of the roads and return back to the same node.
The Dream SMP is the first place to be attacked by the army of the creepers and zombies. Dream with Mr. Beast has to take some important decisions to minimize the damage from the zombies. Dream SMP can be denoted as a graph with N nodes. There are M roads each connecting 2 nodes - Ai and Bi. The road is directed from node Ai to Bi, and not vice-versa. The power required to travel on this road is Ci initially. Also, Dream SMP is built in such a way that it is not possible to visit the same node twice using these roads. That is, you cannot start at a node, follow some of the roads and return back to the same node.
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
![Assignment 6 (Due Date: 07-July)
The Dream SMP is the first place to be attacked by the army of the creepers and zombies.
Dream with Mr. Beast has to take some important decisions to minimize the damage from
the zombies.
Dream SMP can be denoted as a graph with N nodes. There are M roads each connecting
2 nodes - Ai and Bi. The road is directed from node Ai to Bi, and not vice-versa. The power
required to travel on this road is Ci initially. Also, Dream SMP is built in such a way that it is
not possible to visit the same node twice using these roads. That is, you cannot start at a
node, follow some of the roads and return back to the same node.
Your task is to stop the army of the dead. All zombies are standing at node 1 right now.
For this, you decided to carry out Q steps of two different types -
1 K: Add value K to the power required to travel each road in Dream SMP. i.e.,
after this operation Ci=Ci+K Vie[1, M]. Value K can be negative as well.
2 Y: Find the minimum power required for the zombies to reach node Y in Dream
SMP from node 1.
Develop a pythonic code that for each query of type 2, output a single line answer to the
minimum power required for zombies at node 1 to reach node Y. If there is no way to
reach node Y, output "No way to win now!!!".
Input:
33
121
133
232
1
23
Output:
2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F56cefbf1-139b-47e3-8b1d-360fe6141241%2F74a6259e-e394-4304-a8e8-ff3fffb885de%2F66mxsx_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Assignment 6 (Due Date: 07-July)
The Dream SMP is the first place to be attacked by the army of the creepers and zombies.
Dream with Mr. Beast has to take some important decisions to minimize the damage from
the zombies.
Dream SMP can be denoted as a graph with N nodes. There are M roads each connecting
2 nodes - Ai and Bi. The road is directed from node Ai to Bi, and not vice-versa. The power
required to travel on this road is Ci initially. Also, Dream SMP is built in such a way that it is
not possible to visit the same node twice using these roads. That is, you cannot start at a
node, follow some of the roads and return back to the same node.
Your task is to stop the army of the dead. All zombies are standing at node 1 right now.
For this, you decided to carry out Q steps of two different types -
1 K: Add value K to the power required to travel each road in Dream SMP. i.e.,
after this operation Ci=Ci+K Vie[1, M]. Value K can be negative as well.
2 Y: Find the minimum power required for the zombies to reach node Y in Dream
SMP from node 1.
Develop a pythonic code that for each query of type 2, output a single line answer to the
minimum power required for zombies at node 1 to reach node Y. If there is no way to
reach node Y, output "No way to win now!!!".
Input:
33
121
133
232
1
23
Output:
2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
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)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY