Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
You are given the data of travel schedule (of M days) of a traveler and prices of travel passes provided by N different companies. There is no restriction on the number of times one can buy the passes. However the objective is to buy optimal numb such that the traveling cost is minimized. You can buy passes from different companies for different days. The passes can be single day or multi-day pass. In case of multi-day pass the pass is valid for those many travels on consecutive days only. For eg.a 10-day pass can be used to travel 10 times from Day 1 to Day 10. The pass expires at the end of1 day. Hence it can not be used for any further travel. Similany aiday pass expires at the end of " day trom the day of issue. For better understanding refer to Examples section. Constraints ON5 O

You are given the data of travel schedule (of M days) of a traveler and prices of travel passes provided by N different companies. There is no restriction on the number of times one can buy the passes. However the objective is to buy optimal numb such that the traveling cost is minimized. You can buy passes from different companies for different days. The passes can be single day or multi-day pass. In case of multi-day pass the pass is valid for those many travels on consecutive days only. For eg.a 10-day pass can be used to travel 10 times from Day 1 to Day 10. The pass expires at the end of1 day. Hence it can not be used for any further travel. Similany aiday pass expires at the end of " day trom the day of issue. For better understanding refer to Examples section. Constraints ON5 O

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
Output:10 . I need code only in python very quickly
You are given the data of travel schedule (of M days) of a traveler and prices of travel passes provided by N different companies. There is no restriction on the number of times one can buy the passes However the objective is to buy optimal number such that the traveling cost is minimized. You can buy passes from different companies for different days. The passes can be single day or multi-day pass. In case of multi-day pass the pass is valid for those many travels on consecutive days only. For e.g a 10-day pass can be used to travel 10 times from Day 1 to Day 10. The pass expires at the end of 10h day. Hence it can not be used for any further travel. Similarly ai day pass expires at the end of " day from the day of issue. For better understanding refer to Examples section. - Constraints O« M< 105 - Input First line contains five space separated integers in ascending order denoting the number of days of validity for that pass Second line contains an integer N which denotes number of travel companies that provide passes Next Nlines contain five space separated integers which denotes the price of the pass offered by n" travel company where 1 <=n<=N Next line contains an integer M which denotes the number of days the traveler has to travel Next line contains Mspace separated integers. Each number denotes the day number that the traveler has to travel on - Output Minimum cost of travel for given travel schedule factoring in pass cost offered by different companies. - Time Limit 3 - Examples Example 1 Input 13579 2 13557 13468 12 123456789 10 11 15 Output
Transcribed Image Text:You are given the data of travel schedule (of M days) of a traveler and prices of travel passes provided by N different companies. There is no restriction on the number of times one can buy the passes However the objective is to buy optimal number such that the traveling cost is minimized. You can buy passes from different companies for different days. The passes can be single day or multi-day pass. In case of multi-day pass the pass is valid for those many travels on consecutive days only. For e.g a 10-day pass can be used to travel 10 times from Day 1 to Day 10. The pass expires at the end of 10h day. Hence it can not be used for any further travel. Similarly ai day pass expires at the end of " day from the day of issue. For better understanding refer to Examples section. - Constraints O« M< 105 - Input First line contains five space separated integers in ascending order denoting the number of days of validity for that pass Second line contains an integer N which denotes number of travel companies that provide passes Next Nlines contain five space separated integers which denotes the price of the pass offered by n" travel company where 1 <=n<=N Next line contains an integer M which denotes the number of days the traveler has to travel Next line contains Mspace separated integers. Each number denotes the day number that the traveler has to travel on - Output Minimum cost of travel for given travel schedule factoring in pass cost offered by different companies. - Time Limit 3 - Examples Example 1 Input 13579 2 13557 13468 12 123456789 10 11 15 Output
Expert Solution
steps

Step by step

Solved in 2 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