





from collections import deque

class 		SCREAMING_SNAKE_CASE__				:


      def __init__(self       :      Any				,			a__       :      str				,			a__       :      int				,			a__       :      int      ):





         """simple docstring"""



         __snake_case							       =   process_name  # process name
         __snake_case							       =   arrival_time  # arrival time of the process
         # completion time of finished process or last interrupted time
         __snake_case							       =   arrival_time
         __snake_case							       =   burst_time  # remaining burst time
         __snake_case							       =   0  # total time of the process wait in ready queue
         __snake_case							       =   0  # time from arrival time to completion time






class 		SCREAMING_SNAKE_CASE__				:


      def __init__(self       :      List[str]				,			a__       :      int				,			a__       :      list[int]				,			a__       :      deque[Process]				,			a__       :      int				,			):





         """simple docstring"""



         __snake_case							       =   number_of_queues
         # time slice of queues that round robin algorithm applied
         __snake_case							       =   time_slices
         # unfinished process is in this ready_queue
         __snake_case							       =   queue
         # current time
         __snake_case							       =   current_time
         # finished process is in this sequence queue
         __snake_case							       =   deque()


      def    a (self       :      Optional[int]      ):





         """simple docstring"""



         __snake_case							       =   []
         for i in range(len(self.finish_queue      )      ):
            sequence.append(self.finish_queue[i].process_name      )
         return sequence


      def    a (self       :      Tuple				,			a__       :      list[Process]      ):





         """simple docstring"""



         __snake_case							       =   []
         for i in range(len(a__      )      ):
            waiting_times.append(queue[i].waiting_time      )
         return waiting_times


      def    a (self       :      Any				,			a__       :      list[Process]      ):





         """simple docstring"""



         __snake_case							       =   []
         for i in range(len(a__      )      ):
            turnaround_times.append(queue[i].turnaround_time      )
         return turnaround_times


      def    a (self       :      str				,			a__       :      list[Process]      ):





         """simple docstring"""



         __snake_case							       =   []
         for i in range(len(a__      )      ):
            completion_times.append(queue[i].stop_time      )
         return completion_times


      def    a (self       :      Optional[Any]				,			a__       :      deque[Process]      ):





         """simple docstring"""



         return [q.burst_time for q in queue]


      def    a (self       :      int				,			a__       :      Process      ):





         """simple docstring"""



         process.waiting_time += self.current_time - process.stop_time
         return process.waiting_time


      def    a (self       :      Tuple				,			a__       :      deque[Process]      ):





         """simple docstring"""



         __snake_case							       =   deque()  # sequence deque of finished process
         while len(a__      ) != 0:
            __snake_case							       =   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
            __snake_case							       =   0
            # set the process's turnaround time because it is finished
            __snake_case							       =   self.current_time - cp.arrival_time
            # set the completion time
            __snake_case							       =   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    a (self       :      Optional[int]				,			a__       :      deque[Process]				,			a__       :      int      ):





         """simple docstring"""



         __snake_case							       =   deque()  # sequence deque of terminated process
         # just for 1 cycle and unfinished processes will go back to queue
         for _ in range(len(a__      )      ):
            __snake_case							       =   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
               __snake_case							       =   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
               __snake_case							       =   0
               # set the finish time
               __snake_case							       =   self.current_time
               # update the process' turnaround time because it is finished
               __snake_case							       =   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    a (self       :      List[Any]      ):





         """simple docstring"""



         for i in range(self.number_of_queues - 1      ):
            __snake_case       ,	__snake_case							       =   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

    snake_case_				=			Process('P1', 0, 53)
    snake_case_				=			Process('P2', 0, 17)
    snake_case_				=			Process('P3', 0, 68)
    snake_case_				=			Process('P4', 0, 24)
    snake_case_				=			3
    snake_case_				=			[17, 25]
    snake_case_				=			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])})

    snake_case_				=			Process('P1', 0, 53)
    snake_case_				=			Process('P2', 0, 17)
    snake_case_				=			Process('P3', 0, 68)
    snake_case_				=			Process('P4', 0, 24)
    snake_case_				=			3
    snake_case_				=			[17, 25]
    snake_case_				=			deque([Pa, Pa, Pa, Pa])
    snake_case_				=			MLFQ(number_of_queues, time_slices, queue, 0)
    snake_case_				=			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()}'
    )






"""simple docstring"""







def 				UpperCamelCase_    (    lowerCAmelCase__      :				Optional[Any]						)						->   Optional[int]:

  """simple docstring"""




  lowerCAmelCase_   :				Tuple								= [0] * len(lowerCAmelCase__						)
  lowerCAmelCase_   :				List[str]								= []
  lowerCAmelCase_   :				Tuple								= [1] * len(lowerCAmelCase__						)

  for values in graph.values():
    for i in values:
      indegree[i] += 1

  for i in range(len(lowerCAmelCase__						)						):
    if indegree[i] == 0:
      queue.append(lowerCAmelCase__						)

  while queue:
    lowerCAmelCase_   :				Union[str, Any]								= queue.pop(0						)
    for x in graph[vertex]:
      indegree[x] -= 1

      if long_dist[vertex] + 1 > long_dist[x]:
        lowerCAmelCase_   :				Any								= long_dist[vertex] + 1

      if indegree[x] == 0:
        queue.append(lowerCAmelCase__						)

  print(max(lowerCAmelCase__						)						)


# Adjacency list of Graph
lowercase__		:				Any          =	{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}
longest_distance(graph)





