Unloading Merchandise and Delivery (UMD) is in charge of loading air planes and trains from containers that have been unloaded from ships. The material from the dock is stacked (up to 5 containers...

Stacks and Queues


Unloading Merchandise and Delivery (UMD) is in charge of loading air planes and trains from containers that have been unloaded from ships. The material from the dock is stacked (up to 5 containers high) if it to be sent by train. The materials destined to be sent by planes are unpacked and placed on an assembly line. Each item is labeled either a train number or plane number (which is its destination). Items destined for trains are placed in a stack until it reaches 5 items high, then a new stack is begun behind the original. Items are planes are placed on a long assembly line (there is only 1 assembly line). You can assume 1 worker is loading trains and 1 worker is loading the planes at the same time. The trains (planes) closer to the dock have the smaller train (plane) numbers Each worker requires 2 minutes x train number to move an item from the dock to a train and return. Each worker required 10 minutes x the plane number to move an item from the dock to a plane and return. Given the order that items are unloaded from the ship, your job is write a program to determine the total time it will take to load all the materials. Input All input will be from the keyboard. The first line of input will be 4 integers (t,p and nt and np) (0 <= t="">< 100,="" 0=""><= p="">< 10,0=""><= nt,0=""><= np) (each separated by a single space), which represent the total number of trains , the total number of planes and the total number of to be loaded into trains and the total number of items to be loaded into planes. the second line will contain t integers (again separated by a single space) representing the number of items to be loaded to each train. the third line will contain p integers (again separated by a single space) representing the number of items to be loaded to each plane. the fourth line will contain nt representing the destination of each item being sent by a train. the last line will contain np representing the destination of each item being sent by a plane. output output will be on the screen in 2 lines. the first line contains nt integers each separated by 1 space. the ith integer represents the time the ith train finished loading. the second line contains np integers each separated by 1 space. the ith integer represents the time the ith plane finished loading. sample input 32105 271 32 2221322212 21121 corresponding output 25363 6550 project 2 criteria object oriented design - use of classes train calculations are correct plane calculations are correct trains use a queue of stacks, planes use a queue ratings spts full marks 3pts full marks 2pts full marks spts full marks opts no marks opts no marks opts no marks opts no marks pts /5 pts / 3 pts / 2 pts /5 pts total points: 0 np)="" (each="" separated="" by="" a="" single="" space),="" which="" represent="" the="" total="" number="" of="" trains="" ,="" the="" total="" number="" of="" planes="" and="" the="" total="" number="" of="" to="" be="" loaded="" into="" trains="" and="" the="" total="" number="" of="" items="" to="" be="" loaded="" into="" planes.="" the="" second="" line="" will="" contain="" t="" integers="" (again="" separated="" by="" a="" single="" space)="" representing="" the="" number="" of="" items="" to="" be="" loaded="" to="" each="" train.="" the="" third="" line="" will="" contain="" p="" integers="" (again="" separated="" by="" a="" single="" space)="" representing="" the="" number="" of="" items="" to="" be="" loaded="" to="" each="" plane.="" the="" fourth="" line="" will="" contain="" nt="" representing="" the="" destination="" of="" each="" item="" being="" sent="" by="" a="" train.="" the="" last="" line="" will="" contain="" np="" representing="" the="" destination="" of="" each="" item="" being="" sent="" by="" a="" plane.="" output="" output="" will="" be="" on="" the="" screen="" in="" 2="" lines.="" the="" first="" line="" contains="" nt="" integers="" each="" separated="" by="" 1="" space.="" the="" ith="" integer="" represents="" the="" time="" the="" ith="" train="" finished="" loading.="" the="" second="" line="" contains="" np="" integers="" each="" separated="" by="" 1="" space.="" the="" ith="" integer="" represents="" the="" time="" the="" ith="" plane="" finished="" loading.="" sample="" input="" 32105="" 271="" 32="" 2221322212="" 21121="" corresponding="" output="" 25363="" 6550="" project="" 2="" criteria="" object="" oriented="" design="" -="" use="" of="" classes="" train="" calculations="" are="" correct="" plane="" calculations="" are="" correct="" trains="" use="" a="" queue="" of="" stacks,="" planes="" use="" a="" queue="" ratings="" spts="" full="" marks="" 3pts="" full="" marks="" 2pts="" full="" marks="" spts="" full="" marks="" opts="" no="" marks="" opts="" no="" marks="" opts="" no="" marks="" opts="" no="" marks="" pts="" 5="" pts="" 3="" pts="" 2="" pts="" 5="" pts="" total="" points:="">