1class Candy:
  2
  3    def __init__(self, mass, uranium):
  4        self.mass = mass
  5        self.uranium = uranium
  6
  7    def get_uranium_quantity(self):
  8        return self.mass * self.uranium
  9
 10    def get_mass(self):
 11        return self.mass
 12
 13
 14class Person:
 15
 16    def __init__(self, position):
 17        self.position = position
 18
 19    def get_position(self):
 20        return self.position
 21
 22    def set_position(self, position):
 23        self.position = position
 24
 25
 26class Kid(Person):
 27
 28    def __init__(self, position, initiative):
 29        super().__init__(position)
 30        self.initiative = initiative
 31        self.candy_basket = []
 32        self.CONST_CRITICAL = 20
 33
 34    def get_initiative(self):
 35        return self.initiative
 36
 37    def add_candy(self, candy):
 38        self.candy_basket.append(candy)
 39
 40    def is_critical(self):
 41        return sum(candy.get_uranium_quantity() for candy in self.candy_basket) > self.CONST_CRITICAL
 42
 43
 44class Host(Person):
 45
 46    def __init__(self, position, candies):
 47        super().__init__(position)
 48        self.candy_basket = [Candy(mass, uranium) for mass, uranium in candies]
 49
 50    def remove_candy(self, func):
 51        if not self.candy_basket:
 52            return None
 53        removed_candy = func(self.candy_basket)
 54        self.candy_basket.remove(removed_candy)
 55        return removed_candy
 56
 57
 58class FluxCapacitor:
 59    def __init__(self, participants):
 60        self.participants = participants
 61        self.all_hosts = [participant for participant in self.participants if isinstance(participant, Host)]
 62        self.all_kids = [participant for participant in self.participants if isinstance(participant, Kid)]
 63
 64    def get_victim(self):
 65        victims = set()
 66        visited_hosts = {kid: set() for kid in self.all_kids}
 67
 68        while True:
 69            new_victims = False
 70
 71            for kid in [k for k in self.all_kids if k not in victims]:
 72                closest_host = FluxCapacitor.find_closest_host(kid, visited_hosts[kid], self.all_hosts)
 73
 74                if closest_host is None:
 75                    continue
 76
 77                visited_hosts[kid].add(closest_host)
 78                kid.set_position(closest_host.get_position())
 79                candy = closest_host.remove_candy(FluxCapacitor.choose_candy_with_max_weight)
 80
 81                if candy is not None:
 82                    kid.add_candy(candy)
 83                    if kid.is_critical():
 84                        victims.add(kid)
 85                        new_victims = True
 86
 87            if new_victims or len(visited_hosts[kid]) == len(self.all_hosts):
 88                break
 89
 90        return victims if victims else None
 91
 92    @staticmethod
 93    def find_closest_host(kid, visited_hosts, hosts):
 94        closest_host = None
 95        closest_distance = float("inf")
 96        closest_info_tuple = (closest_distance, 0, 0)
 97
 98        for host in [h for h in hosts if h not in visited_hosts]:
 99            distance = FluxCapacitor.calculate_distance(kid.get_position(), host.get_position())
100            current_info_tuple = (distance, host.get_position()[0], host.get_position()[1])
101
102            if current_info_tuple < closest_info_tuple:
103                closest_host = host
104                closest_distance = distance
105                closest_info_tuple = (closest_distance, closest_host.get_position()[0], closest_host.get_position()[1])
106
107        return closest_host
108
109    @staticmethod
110    def calculate_distance(position1, position2):
111        return ((position1[0] - position2[0]) ** 2 + (position1[1] - position2[1]) ** 2) ** 0.5
112
113    @staticmethod
114    def choose_candy_with_max_weight(candies):
115        if not candies:
116            return None
117        return max(candies, key=lambda candy: candy.get_mass())