





from collections import deque





class 						_A:


				"""simple docstring"""


				def __init__(			self     ,					_A     ,					_A     ,					_A     ):
									__A	:						int       =				process_name  # process name
									__A	:						Union[str, Any]       =				arrival_time  # arrival time of the process
									# completion time of finished process or last interrupted time
									__A	:						str       =				arrival_time
									__A	:						Tuple       =				burst_time  # remaining burst time
									__A	:						int       =				0  # total time of the process wait in ready queue
									__A	:						Tuple       =				0  # time from arrival time to completion time





class 						_A:


				"""simple docstring"""


				def __init__(			self     ,					_A     ,					_A     ,					_A     ,					_A     ,					):
									# total number of mlfq's queues
									__A	:						Any       =				number_of_queues
									# time slice of queues that round robin algorithm applied
									__A	:						Optional[int]       =				time_slices
									# unfinished process is in this ready_queue
									__A	:						Dict       =				queue
									# current time
									__A	:						Tuple       =				current_time
									# finished process is in this sequence queue
									__A	:						deque[Process]       =				deque()



				def 					UpperCAmelCase_		(			self     ):
									__A	:						List[Any]       =				[]
									for i in range(len(self.finish_queue     )     ):
														sequence.append(self.finish_queue[i].process_name     )
									return sequence



				def 					UpperCAmelCase_		(			self     ,					_A     ):
									__A	:						Dict       =				[]
									for i in range(len(_A     )     ):
														waiting_times.append(queue[i].waiting_time     )
									return waiting_times



				def 					UpperCAmelCase_		(			self     ,					_A     ):
									__A	:						Optional[Any]       =				[]
									for i in range(len(_A     )     ):
														turnaround_times.append(queue[i].turnaround_time     )
									return turnaround_times



				def 					UpperCAmelCase_		(			self     ,					_A     ):
									__A	:						str       =				[]
									for i in range(len(_A     )     ):
														completion_times.append(queue[i].stop_time     )
									return completion_times



				def 					UpperCAmelCase_		(			self     ,					_A     ):
									return [q.burst_time for q in queue]



				def 					UpperCAmelCase_		(			self     ,					_A     ):
									process.waiting_time += self.current_time - process.stop_time
									return process.waiting_time



				def 					UpperCAmelCase_		(			self     ,					_A     ):
									__A	:						deque[Process]       =				deque()  # sequence deque of finished process
									while len(_A     ) != 0:
														__A	:						Optional[Any]       =				ready_queue.popleft()  # current process

														# if process's arrival time is later than current time, update current time
														if self.current_time < cp.arrival_time:
																			self.current_time += cp.arrival_time

														# update waiting time of current process
														self.update_waiting_time(_A     )
														# update current time
														self.current_time += cp.burst_time
														# finish the process and set the process's burst-time 0
														__A	:						List[str]       =				0
														# set the process's turnaround time because it is finished
														__A	:						List[Any]       =				self.current_time - cp.arrival_time
														# set the completion time
														__A	:						Dict       =				self.current_time
														# add the process to queue that has finished queue
														finished.append(_A     )

									self.finish_queue.extend(_A     )  # add finished process to finish queue
									# FCFS will finish all remaining processes
									return finished



				def 					UpperCAmelCase_		(			self     ,					_A     ,					_A     ):
									__A	:						deque[Process]       =				deque()  # sequence deque of terminated process
									# just for 1 cycle and unfinished processes will go back to queue
									for _ in range(len(_A     )     ):
														__A	:						Any       =				ready_queue.popleft()  # current process

														# if process's arrival time is later than current time, update current time
														if self.current_time < cp.arrival_time:
																			self.current_time += cp.arrival_time

														# update waiting time of unfinished processes
														self.update_waiting_time(_A     )
														# if the burst time of process is bigger than time-slice
														if cp.burst_time > time_slice:
																			# use CPU for only time-slice
																			self.current_time += time_slice
																			# update remaining burst time
																			cp.burst_time -= time_slice
																			# update end point time
																			__A	:						str       =				self.current_time
																			# locate the process behind the queue because it is not finished
																			ready_queue.append(_A     )
														else:
																			# use CPU for remaining burst time
																			self.current_time += cp.burst_time
																			# set burst time 0 because the process is finished
																			__A	:						Any       =				0
																			# set the finish time
																			__A	:						str       =				self.current_time
																			# update the process' turnaround time because it is finished
																			__A	:						Optional[int]       =				self.current_time - cp.arrival_time
																			# add the process to queue that has finished queue
																			finished.append(_A     )

									self.finish_queue.extend(_A     )  # add finished process to finish queue
									# return finished processes queue and remaining processes queue
									return finished, ready_queue





				def 					UpperCAmelCase_		(			self     ):

									#  all queues except last one have round_robin algorithm
									for i in range(self.number_of_queues - 1     ):
														__A    ,				__A	:						Optional[Any]       =				self.round_robin(
														    self.ready_queue     ,					self.time_slices[i]     )
									#  the last queue has first_come_first_served algorithm
									self.first_come_first_served(self.ready_queue     )

									return self.finish_queue


if __name__ == "__main__":
				import doctest

				UpperCAmelCase						:   Any			  =     Process('''P1''', 0, 53)
				UpperCAmelCase						:   Dict			  =     Process('''P2''', 0, 17)
				UpperCAmelCase						:   List[str]			  =     Process('''P3''', 0, 68)
				UpperCAmelCase						:   Optional[int]			  =     Process('''P4''', 0, 24)
				UpperCAmelCase						:   List[Any]			  =     3
				UpperCAmelCase						:   int			  =     [17, 25]
				UpperCAmelCase						:   Any			  =     deque([Pa, Pa, Pa, Pa])

				if len(time_slices) != number_of_queues - 1:
								raise SystemExit(0)

				doctest.testmod(extraglobs={'''queue''': deque([Pa, Pa, Pa, Pa])})

				UpperCAmelCase						:   List[Any]			  =     Process('''P1''', 0, 53)
				UpperCAmelCase						:   Optional[Any]			  =     Process('''P2''', 0, 17)
				UpperCAmelCase						:   List[str]			  =     Process('''P3''', 0, 68)
				UpperCAmelCase						:   Any			  =     Process('''P4''', 0, 24)
				UpperCAmelCase						:   Dict			  =     3
				UpperCAmelCase						:   List[str]			  =     [17, 25]
				UpperCAmelCase						:   Dict			  =     deque([Pa, Pa, Pa, Pa])
				UpperCAmelCase						:   List[Any]			  =     MLFQ(number_of_queues, time_slices, queue, 0)
				UpperCAmelCase						:   List[str]			  =     mlfq.multi_level_feedback_queue()

				# print total waiting times of processes(P1, P2, P3, P4)
				print(
				    F"""waiting time:\
        \t\t\t{MLFQ.calculate_waiting_time(mlfq, [Pa, Pa, Pa, Pa])}"""
				)
				# print completion times of processes(P1, P2, P3, P4)
				print(
				    F"""completion time:\
        \t\t{MLFQ.calculate_completion_time(mlfq, [Pa, Pa, Pa, Pa])}"""
				)
				# print total turnaround times of processes(P1, P2, P3, P4)
				print(
				    F"""turnaround time:\
        \t\t{MLFQ.calculate_turnaround_time(mlfq, [Pa, Pa, Pa, Pa])}"""
				)
				# print sequence of finished processes
				print(
				    F"""sequence of finished processes:\
        {mlfq.calculate_sequence_of_finish_queue()}"""
				)











from __future__ import annotations







def  _SCREAMING_SNAKE_CASE				(   a  )      ->      int:
					if not nums:
										return 0
					__A	:						Optional[int]       =				nums[0]
					__A	:						str       =				0
					for num in nums[1:]:
										__A    ,				__A	:						Tuple       =				(
										    max_excluding + num,
										    max(a					,						a  ),
										)
					return max(a					,						a  )


if __name__ == "__main__":
				import doctest

				doctest.testmod()




