import cProfile
import sys
from collections import defaultdict

sys.setrecursionlimit(10_000)

Node = tuple[int, int, int, int]


class Cidr4MergerError(Exception):
    pass


def get_data(input_file):
    with open(input_file, "r") as file:
        data = file.read().splitlines()
    return data


def cidr4_to_node(cidr4: str) -> Node:
    ip_address, mask_len = cidr4.strip().split("/")
    mask_len = int(mask_len)
    a, b, c, d = list(map(int, ip_address.split(".")))
    ip = a * 256**3 + b * 256**2 + c * 256**1 + d * 256**0
    added_ips_number = 0
    parent_ip = get_parent_ip(ip, mask_len)
    return ip, mask_len, added_ips_number, parent_ip


def sort_nodes(nodes: list[Node]) -> list[Node]:
    return sorted(nodes, key=lambda x: (x[1], x[0]))


def get_net_addr(ip: int, mask_len: int) -> int:
    mask = ((1 << mask_len) - 1) << (32 - mask_len)
    net_addr = ip & mask
    return net_addr


def get_parent_ip(ip: int, mask_len: int) -> int:
    if mask_len == 0:
        raise Cidr4MergerError("The top of the tree has no parent!")
    return get_net_addr(ip, mask_len - 1)


def have_same_parent(mask_len_a, parent_ip_a, mask_len_b, parent_ip_b) -> bool:
    return mask_len_a == mask_len_b and parent_ip_a == parent_ip_b


def get_group_with_max_mask_len(nodes: list[Node]) -> list[Node]:
    max_mask_len = max(nodes, key=lambda x: x[1])[1]
    return list(filter(lambda x: x[1] == max_mask_len, nodes))


def make_parent(a: Node, b: Node | None = None) -> Node:
    ip_a, mask_len_a, added_ips_number_a, parent_ip_a = a
    if b:
        ip_b, mask_len_b, added_ips_b, parent_ip_b = b
        if not have_same_parent(mask_len_a, parent_ip_a, mask_len_b, parent_ip_b):
            raise Cidr4MergerError("Nodes must be neighbors!")
        added_ips_number = added_ips_number_a + added_ips_b
    else:
        added_ips_number = added_ips_number_a + 2 ** (32 - mask_len_a)
    ip = parent_ip_a
    mask_len = mask_len_a - 1
    parent_ip = get_parent_ip(ip, mask_len)
    return ip, mask_len, added_ips_number, parent_ip


def reduce_nodes(nodes: list[Node]) -> list[Node]:
    group = get_group_with_max_mask_len(nodes)

    neighbours = []
    loners = []
    i = 0
    while i < len(group) - 1:
        a, b = group[i], group[i + 1]
        ip_a, mask_len_a, _, parent_ip_a = a
        ip_b, mask_len_b, _, parent_ip_b = b
        if have_same_parent(mask_len_a, parent_ip_a, mask_len_b, parent_ip_b):
            neighbours.append((a, b))
            i += 2
        else:
            loners.append(a)
            i += 1
    if i == len(group) - 1:
        loners.append(group[i])

    if neighbours:
        zipped = zip(neighbours, map(lambda x: make_parent(x[0], x[1]), neighbours))
        min_zipped = min(zipped, key=lambda x: x[1][2])
        (a, b), parent = min_zipped
        nodes.remove(a)
        nodes.remove(b)
        nodes.append(parent)
    elif loners:
        zipped = zip(loners, map(make_parent, loners))
        min_zipped = min(zipped, key=lambda x: x[1][2])
        a, parent = min_zipped
        nodes.remove(a)
        nodes.append(parent)
    else:
        assert False, "Error"

    return sort_nodes(nodes)


def merge_nodes_deprecated(nodes: list[Node], required_len: int) -> list[Node]:
    while len(nodes) > required_len:
        nodes = reduce_nodes(nodes)
    return nodes


def make_cidr4(ip, mask_len) -> str:
    lst = [str(ip >> (i << 3) & 0xFF) for i in reversed(range(4))]
    ip_address = ".".join(lst)
    return f"{ip_address}/{mask_len}"


def lift_lonely_node(nodes: list[Node], singles: list[Node]) -> list[Node]:
    # find single whose parent has the least added addresses
    min_single, min_parent = singles[0], make_parent(singles[0])
    for node in singles[1:]:
        parent = make_parent(node)
        if parent[2] < min_parent[2]:
            min_single, min_parent = node, parent

    new_nodes = [x for x in nodes]
    new_nodes.remove(min_single)
    new_nodes.append(min_parent)
    new_nodes = sort_nodes(new_nodes)
    return new_nodes


def merge_neighbors(
    nodes: list[Node], neighbours: list[tuple[Node, Node]]
) -> list[Node]:
    new_nodes = [x for x in nodes]
    for a, b in neighbours:
        parent = make_parent(a, b)
        new_nodes.remove(a)
        new_nodes.remove(b)
        new_nodes.append(parent)
    return sort_nodes(new_nodes)


def find_neighbours_singles(groups: defaultdict) -> tuple[list, list]:
    neighbours = []
    singles = []
    for group in groups.values():
        i = 0
        while i < len(group) - 1:
            a, b = group[i], group[i + 1]
            ip_a, mask_len_a, _, parent_ip_a = a
            ip_b, mask_len_b, _, parent_ip_b = b
            if have_same_parent(mask_len_a, parent_ip_a, mask_len_b, parent_ip_b):
                neighbours.append((a, b))
                i += 2
            else:
                singles.append(a)
                i += 1
        if i == len(group) - 1:
            singles.append(group[i])
    return neighbours, singles


def make_groups(nodes: list[Node]) -> defaultdict:
    groups = defaultdict(list)
    for n in nodes:
        groups[n[1]].append(n)
    return groups


def merge_nodes_recursion(nodes: list[Node], required_len: int) -> list[Node]:
    if len(nodes) <= required_len:
        return nodes
    groups = make_groups(nodes)
    neighbours, singles = find_neighbours_singles(groups)
    if neighbours:
        new_nodes = merge_neighbors(nodes, neighbours)
        return merge_nodes_recursion(new_nodes, required_len)
    new_nodes = lift_lonely_node(nodes, singles)
    return merge_nodes_recursion(new_nodes, required_len)


def main():
    file = "cidr4.txt"
    required_len = 20

    data = get_data(file)
    nodes = list(map(cidr4_to_node, data))

    nodes = sort_nodes(nodes)
    # merged_nodes = merge_nodes(nodes, required_len)
    merged_nodes = merge_nodes_recursion(nodes, required_len)

    cidr4s = []
    sum_added_ips = 0
    for ip_value, mask_len, added_ips, _ in merged_nodes:
        cidr4s.append(make_cidr4(ip_value, mask_len))
        sum_added_ips += added_ips

    cidr4s_str = "\n".join(cidr4s)
    print(
        f"Исходный список длины {len(nodes)} сокращен до {len(cidr4s)}\n"
        f"Количество добавленных ip адресов: {sum_added_ips:_}\n"
        f"Список объединенных cidr4:\n"
        f"{cidr4s_str}"
    )


if __name__ == "__main__":
    cProfile.run("main()")