def min_det_bound(m, n_cycles):
    """
    Computes the accumulated cost of the algorithm so far in the last m cycles. The output consists of two lists that
    can be used to plot the line representing the accumulated costs of MIN^det at the times when the corresponding
    algorithm was used by MIN^det the last time. The first list contains the x-coordinates of the important points of
    the line, the second list contains the y-coordinates. The first and the last entries of both lists are used to
    extend the line at its ends so that it does not end in the middle of the bars.
    :return: 2 lists of the same size, can be used to plot a line.
    """
    x = [-0.5] + list(range(m)) + [m - 0.5]
    y_iterator = [n_cycles - m + 1] + list(range(n_cycles - m + 1, n_cycles + 1)) + [n_cycles]
    y = [(n_cycles - m + 1) + (i % m) for i in y_iterator]

    return x, y