from math import ceil

DURATIONS = [2, 6, 1, 4]


def static_time(slots):
    return sum(max(DURATIONS[i:i + slots])
               for i in range(0, len(DURATIONS), slots))


def refill_time(slots):
    # FIFO list scheduling: admit the next request in the first free lane.
    available = [0] * slots
    for duration in DURATIONS:
        lane = min(range(slots), key=lambda i: (available[i], i))
        available[lane] += duration
    return max(available)


def result(slots):
    static, refill = static_time(slots), refill_time(slots)
    return {"static": static, "refill": refill,
            "static_occupancy": 13 / (slots * static),
            "refill_occupancy": 13 / (slots * refill)}


# Verification: two-slot timeline, one-slot serialization, full admission.
assert result(2)["static"] == 10
assert result(2)["refill"] == 7
assert result(1)["static"] == result(1)["refill"] == 13
assert result(4)["static"] == result(4)["refill"] == 6
fixtures = [{"inputs": {"slots": str(s)}, "expected": result(s)}
            for s in range(1, 5)]

import json
print(json.dumps({"fixtures": fixtures, "checks_passed": True}))
