tasks/program-execution-tracing/contexts/sample-00045.md

001

def f1(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f1(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

002

def f2(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f2([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

003

def f3(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f3([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

004

def f4(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f4([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

005

def f5(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f5([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

006

def f6(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f6(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

007

def f7(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices and count > 0:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f7([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

008

def f8(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices and count > 0:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f8([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

009

def f9(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f9(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

010

def f10(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f10([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

011

def f11(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f11([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

012

def f12(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not combined or left > combined[-1][1] + min(gap, 2):
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f12([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

013

def f13(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f13([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

014

def f14(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f14([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

015

def f15(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f15([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

016

def f16(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f16(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

017

def f17(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f17(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

018

def f18(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f18([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

019

def f19(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * abs(ratemap[group])
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f19([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

020

def f20(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f20([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

021

def f21(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    result = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f21([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

022

def f22(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f22(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

023

def f23(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output

f23([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

024

def f24(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output

f24([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

025

def f25(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in crossings:
                crossings.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f25([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

026

def f26(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f26([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

027

def f27(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f27([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

028

def f28(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f28(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

029

def f29(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * ratemap[group]
            kept.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': amount, 'groups': totals, 'top': [code for code, charge in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f29([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

030

def f30(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f30(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

031

def f31(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f31([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

032

def f32(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f32([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

033

def f33(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f33(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

034

def f34(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f34([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

035

def f35(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f35([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

036

def f36(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value >= limit]
    ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max([0] + series), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f36([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

037

def f37(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f37(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

038

def f38(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f38([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

039

def f39(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f39([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

040

def f40(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    items = []
    for key, count in left:
        if key in factors:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f40([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

041

def f41(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    series = []
    for pos in range(min(64, len(values) - size + 1)):
        series.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f41([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

042

def f42(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f42([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

043

def f43(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    spaces = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        spaces.append(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((min(100, right - left) for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f43([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

044

def f44(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f44([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

045

def f45(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + max(0, gap):
            result.append([left, right])
        else:
            result[-1][1] = right
    spaces = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        spaces.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f45([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

046

def f46(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f46(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

047

def f47(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    pending.append(nxt)
    listing = list(steps)
    edge = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': edge, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f47([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

048

def f48(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f48([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

049

def f49(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            score = value * abs(prices[group])
            selected.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f49([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

050

def f50(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f50([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

051

def f51(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    listing = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f51(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

052

def f52(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f52(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

053

def f53(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: pair[0]):
        if not combined or left > combined[-1][1] + gap + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f53([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

054

def f54(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f54([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

055

def f55(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in prices and count > 0:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f55([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

056

def f56(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f56([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

057

def f57(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f57([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

058

def f58(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    sequence = []
    rounds = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f58(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

059

def f59(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f59([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

060

def f60(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f60([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

061

def f61(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f61([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

062

def f62(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    pending.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f62([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

063

def f63(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f63([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

064

def f64(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in tallies.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f64(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

065

def f65(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f65([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

066

def f66(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    complete = set()
    result = []
    groups = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f66(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

067

def f67(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f67(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

068

def f68(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f68([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

069

def f69(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f69(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

070

def f70(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap % 5:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    breaks = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        breaks.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f70([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

071

def f71(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * ratemap[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': amount, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f71([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

072

def f72(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = right
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(min(100, left - result[pos - 1][1]))
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f72([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

073

def f73(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f73(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

074

def f74(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f74(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

075

def f75(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap % 5:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    spaces = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        spaces.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f75([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

076

def f76(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * factors[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f76([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

077

def f77(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f77(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

078

def f78(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f78(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

079

def f79(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = max(0, segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f79([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

080

def f80(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in crossings:
                crossings.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f80([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

081

def f81(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            score = value * ratemap[group]
            matches.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            amount += score
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': groupmap, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f81([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

082

def f82(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f82([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

083

def f83(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f83(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

084

def f84(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f84([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

085

def f85(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    groups = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f85(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

086

def f86(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f86(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

087

def f87(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f87(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

088

def f88(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f88(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

089

def f89(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    breaks = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        breaks.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f89([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

090

def f90(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f90([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

091

def f91(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f91(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

092

def f92(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * abs(prices[group])
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f92([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

093

def f93(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f93([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

094

def f94(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f94(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

095

def f95(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f95(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

096

def f96(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(prices[group])
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f96([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

097

def f97(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f97([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

098

def f98(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    handled = set()
    result = []
    rounds = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        rounds.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f98(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

099

def f99(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f99([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

100

def f100(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f100([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

101

def f101(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f101([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

102

def f102(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f102([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

103

def f103(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f103(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

104

def f104(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in factors:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f104([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

105

def f105(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output

f105([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

106

def f106(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f106([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

107

def f107(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f107([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

108

def f108(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f108([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

109

def f109(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f109([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

110

def f110(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f110([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

111

def f111(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f111([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

112

def f112(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output

f112([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

113

def f113(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f113([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

114

def f114(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f114([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

115

def f115(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f115(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

116

def f116(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f116([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

117

def f117(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f117([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

118

def f118(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f118([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

119

def f119(rows, keep, factors):
    rows = list(rows)
    kept = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * factors[group]
            kept.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f119([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

120

def f120(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f120([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

121

def f121(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f121([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

122

def f122(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f122([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

123

def f123(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f123([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

124

def f124(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap % 5 + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f124([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

125

def f125(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f125(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

126

def f126(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in ratemap:
            combined.append((key, count * ratemap[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f126([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

127

def f127(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f127(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

128

def f128(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            charge = value * prices[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f128([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

129

def f129(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f129([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

130

def f130(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            selected.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            grand += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': buckets, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f130([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

131

def f131(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f131(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

132

def f132(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f132([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

133

def f133(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f133([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

134

def f134(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f134(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

135

def f135(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f135([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

136

def f136(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap and rate0 != 0:
            ratemap[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in ratemap:
            combined.append((key, count * ratemap[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f136([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

137

def f137(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f137(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

138

def f138(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    finished = set()
    result = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f138(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

139

def f139(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f139(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

140

def f140(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f140([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

141

def f141(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f141(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

142

def f142(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            score = value * factors[group]
            kept.append((code, score))
            totals[group] = totals.get(group, 0) + score
            sumvalue += score
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': totals, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f142([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

143

def f143(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(series) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, len(series))) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f143([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

144

def f144(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f144(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

145

def f145(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value != 0:
            cost = value * prices[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f145([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

146

def f146(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f146([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

147

def f147(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f147(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

148

def f148(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            score = value * abs(prices[group])
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            grand += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f148([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

149

def f149(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f149([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

150

def f150(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    listing = list(levels)
    edge = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': edge[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f150([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

151

def f151(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f151([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

152

def f152(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    steps = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f152([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

153

def f153(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f153([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

154

def f154(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f154([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

155

def f155(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output

f155([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

156

def f156(rows, keep, factors):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            score = value * abs(factors[group])
            matches.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f156([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

157

def f157(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals[:64]) if value > limit]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f157([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

158

def f158(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value > limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f158([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

159

def f159(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f159(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

160

def f160(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f160([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

161

def f161(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f161([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

162

def f162(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f162(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

163

def f163(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f163([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

164

def f164(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f164(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

165

def f165(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f165([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

166

def f166(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f166([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

167

def f167(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + max(0, gap) + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f167([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

168

def f168(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges[:16]:
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in levels and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f168([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

169

def f169(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f169(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

170

def f170(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(factors[group])
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f170([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

171

def f171(rows, keep, factors):
    rows = list(rows)
    matches = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * factors[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f171([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

172

def f172(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not segments or left > segments[-1][1] + gap + 1:
            segments.append([left, right])
        else:
            segments[-1][1] = max(0, segments[-1][1], right)
    breaks = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        breaks.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f172([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

173

def f173(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f173(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

174

def f174(rows, keep, factors):
    rows = list(rows)
    kept = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * factors[group]
            kept.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            grand += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': buckets, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f174([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

175

def f175(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f175([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

176

def f176(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f176([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

177

def f177(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output

f177([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

178

def f178(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f178([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

179

def f179(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    levels = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    listing = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f179([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

180

def f180(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in factors and count > 0:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f180([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

181

def f181(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f181(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

182

def f182(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices and count > 0:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f182([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

183

def f183(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f183([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

184

def f184(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f184([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

185

def f185(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in result)))}
    output = dict()
    output.update(returnvalue)
    return output

f185([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

186

def f186(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f186([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

187

def f187(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f187([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

188

def f188(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f188([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

189

def f189(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f189([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

190

def f190(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f190(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

191

def f191(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output

f191([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

192

def f192(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(min(64, len(values) - size + 1)):
        series.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(series[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f192([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

193

def f193(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * ratemap[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f193([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

194

def f194(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(totals) if value > limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f194([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

195

def f195(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f195([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

196

def f196(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f196([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

197

def f197(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f197([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

198

def f198(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f198([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

199

def f199(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output

f199([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

200

def f200(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f200(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

201

def f201(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f201(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

202

def f202(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            score = value * prices[group]
            kept.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f202([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

203

def f203(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    items = []
    for key, count in left:
        if key in prices and count > 0:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f203([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

204

def f204(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f204(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

205

def f205(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f205([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

206

def f206(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f206([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

207

def f207(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop or len(word) > 12:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f207(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

208

def f208(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f208(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

209

def f209(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    listing = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f209([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

210

def f210(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges[:16]:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f210([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

211

def f211(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f211([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

212

def f212(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices and count > 0:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f212([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

213

def f213(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            score = value * prices[group]
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f213([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

214

def f214(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value > limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f214([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

215

def f215(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f215([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

216

def f216(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(min(64, len(values) - size + 1)):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value >= limit]
    ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f216([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

217

def f217(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f217([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

218

def f218(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(ratemap[group])
            matches.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f218([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

219

def f219(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f219(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

220

def f220(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f220([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

221

def f221(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f221([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

222

def f222(rows, keep, prices):
    rows = list(rows)
    kept = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            kept.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            grand += score
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': grand, 'groups': groupmap, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f222([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

223

def f223(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f223([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

224

def f224(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in ratemap and count > 0:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f224([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

225

def f225(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f225(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

226

def f226(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f226([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

227

def f227(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f227([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

228

def f228(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f228([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

229

def f229(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * ratemap[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f229([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

230

def f230(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(series) if value > limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f230([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

231

def f231(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f231([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

232

def f232(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f232([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

233

def f233(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f233([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

234

def f234(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f234([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

235

def f235(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f235(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

236

def f236(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, []))[:20]:
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    result = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f236([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

237

def f237(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + min(gap, 2):
            segments.append([left, right])
        else:
            segments[-1][1] = right
    breaks = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        breaks.append(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f237([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

238

def f238(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            cost = value * abs(prices[group])
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f238([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

239

def f239(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output

f239([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

240

def f240(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in crossings:
                crossings.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f240([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

241

def f241(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not result or left > result[-1][1] + gap % 5 + 1:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    breaks = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        breaks.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f241([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

242

def f242(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f242(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

243

def f243(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f243(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

244

def f244(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not combined or left > combined[-1][1] + min(gap, 2):
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f244([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

245

def f245(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
        if not result or left > result[-1][1] + max(0, gap):
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, min(50, len(result))):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f245([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

246

def f246(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f246([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

247

def f247(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f247([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

248

def f248(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f248([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

249

def f249(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f249(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

250

def f250(rows, keep, factors):
    rows = list(rows)
    matches = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            cost = value * factors[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': grand, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f250([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

251

def f251(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    complete = set()
    result = []
    rounds = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f251(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

252

def f252(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f252([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

253

def f253(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f253([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

254

def f254(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    listing = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f254(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

255

def f255(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + max(0, gap) + 1:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((min(100, right - left) for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f255([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

256

def f256(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f256([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

257

def f257(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f257([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

258

def f258(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    result = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f258(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

259

def f259(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value > limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f259([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 13, 31)

{"best":188,"hits":[0,1,2],"rises":2,"sums":[168,171,188]}

260

def f260(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = right
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((min(100, right - left) for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f260([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

261

def f261(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f261([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

262

def f262(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f262([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

263

def f263(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            score = value * prices[group]
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            sumvalue += score
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f263([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

264

def f264(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f264(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

265

def f265(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in crossings:
                crossings.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f265([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

266

def f266(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f266(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

267

def f267(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f267(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

268

def f268(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f268(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

269

def f269(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap and rate0 != 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap and count > 0:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f269([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

270

def f270(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap + 1:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f270([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

271

def f271(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f271(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

272

def f272(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f272([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

273

def f273(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f273([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

274

def f274(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: pair[0]):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, min(50, len(combined))):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f274([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

275

def f275(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            cost = value * factors[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f275([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

276

def f276(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * ratemap[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f276([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

277

def f277(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap + 1:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f277([(3, 10), (6, 11), (15, 17), (19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)], 2)

{"cover":37,"holes":[4,8,5,7],"longest":11,"segments":[[3,11],[15,21],[29,40],[45,53],[60,64]]}

278

def f278(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f278(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

279

def f279(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f279([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

280

def f280(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f280(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

281

def f281(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            score = value * ratemap[group]
            kept.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            grand += score
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': buckets, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f281([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

282

def f282(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f282([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

283

def f283(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f283(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

284

def f284(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f284(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

285

def f285(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f285([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

286

def f286(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f286([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

287

def f287(rows, keep, factors):
    rows = list(rows)
    kept = []
    groupmap = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            cost = value * factors[group]
            kept.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': grand, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f287([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

288

def f288(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f288([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

289

def f289(rows, keep, prices):
    rows = list(rows)
    kept = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * abs(prices[group])
            kept.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            amount += score
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f289([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

290

def f290(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f290([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

291

def f291(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    listing = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f291([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'E', 3)

{"count":5,"depth":{"A":2,"B":3,"C":3,"E":0,"G":1},"frontier":["B","C"],"order":["E","G","A","B","C"]}

292

def f292(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f292([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

293

def f293(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f293(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

294

def f294(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f294([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

295

def f295(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f295(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

296

def f296(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f296(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db","ui"],["api","jobs","proxy"],["worker"]],"count":8,"order":["auth","cache","db","ui","api","jobs","proxy","worker"],"roots":["auth","cache","db","ui"]}

297

def f297(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f297([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

298

def f298(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f298(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

299

def f299(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    spaces = []
    for pos in range(1, min(50, len(segments))):
        left = segments[pos][0]
        spaces.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': min(100, max((right - left for left, right in segments)))}
    output = dict()
    output.update(returnvalue)
    return output

f299([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

300

def f300(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    result = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f300([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

301

def f301(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    gaps = []
    for pos in range(1, min(50, len(segments))):
        left = segments[pos][0]
        gaps.append(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((min(100, right - left) for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f301([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

302

def f302(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f302([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

303

def f303(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in levels and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    listing = list(levels)
    edge = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': edge[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f303([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

304

def f304(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    levels = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f304([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

305

def f305(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f305([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

306

def f306(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f306([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1)])

{"bounds":[-1,0,2,12],"end":[0,11],"far":12,"revisits":[[0,0],[1,0],[2,0],[0,11]],"steps":27}

307

def f307(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f307([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6), ('FP', 8), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["CX",65],["EV",61],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":333}

308

def f308(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    complete = set()
    sequence = []
    groups = []
    while len(complete) < len(nodes) and len(complete) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f308(['jobs', 'api', 'auth', 'db', 'cache', 'proxy', 'worker', 'ui'], [('auth', 'api'), ('db', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy')])

{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}

309

def f309(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in crossings:
                crossings.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f309([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

310

def f310(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

f310([('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2), ('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2)])

{"bounds":[-1,0,2,12],"end":[2,12],"far":14,"revisits":[[0,0],[1,0],[2,0]],"steps":28}

311

def f311(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f311(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"quartz":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"q":1},"size":133,"top":["helium","blue","ember","garnet","cyan"]}

312

def f312(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(series) if value >= limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f312([15, 7, 8, 18, 5, 20, 7, 21, 24, 12, 8, 15, 8, 18, 24], 15, 31)

{"best":210,"hits":[0],"rises":0,"sums":[210]}

313

def f313(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f313([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

314

def f314(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not segments or left > segments[-1][1] + gap + 1:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in segments)))}
    output = dict()
    output.update(returnvalue)
    return output

f314([(3, 10), (6, 11), (15, 17), (19, 21), (31, 35), (34, 40), (44, 49), (49, 53), (60, 64)], 2)

{"cover":36,"holes":[4,10,4,7],"longest":9,"segments":[[3,11],[15,21],[31,40],[44,53],[60,64]]}

315

def f315(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(prices[group])
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f315([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

316

def f316(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    levels = {start: 0} if limit > 0 or limit < 0 else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    work.append(nxt)
    result = list(levels)
    edge = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': edge, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f316([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'H', 3)

{"count":5,"depth":{"B":1,"D":2,"E":2,"G":3,"H":0},"frontier":["G"],"order":["H","B","D","E","G"]}

317

def f317(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors and count > 0:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f317([('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10), ('FP', 5), ('GQ', 3), ('HR', 10)], [('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4), ('FP', 13), ('GQ', 10), ('HR', 5)], 1)

{"count":7,"items":[["FP",66],["CX",65],["HR",51],["BR",43],["DL",41]],"missing":["AN"],"total":338}

318

def f318(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f318(['Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue', 'Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet'], ['delta'])

{"counts":{"amber":2,"blue":5,"cyan":3,"ember":5,"garnet":4,"helium":6,"vivid":1},"initials":{"a":2,"b":5,"c":3,"e":5,"g":4,"h":6,"v":1},"size":132,"top":["helium","blue","ember","garnet","cyan"]}

319

def f319(rows, keep, factors):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            score = value * abs(factors[group])
            selected.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f319([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":168,"north":168,"south":170},"top":["DL02","DL91","DL98"],"total":506}

320

def f320(rows, keep, factors):
    rows = list(rows)
    kept = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            score = value * factors[group]
            kept.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            amount += score
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f320([('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24), ('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"edge":180,"north":168,"south":155},"top":["DL02","DL91","DL98"],"total":503}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
spans = list(((3, 10), (6, 11), (15, 17)) + ((19, 21), (29, 33), (34, 40), (45, 50), (49, 53), (60, 64)))
gap = 2
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
ticket = record['cc']
values = list((15, 7, 8, 18, 5, 20, 7, 21) + (24, 12, 8, 15, 8, 18, 24))
limit = 31
route = ticket
cases = {
    36: 13,
    37: 15,
}
width = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
badge = record['bb']
stop = ['delta']
route = ticket
cases = {
    37: list(('Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue') + ('Cyan, helium. delta ember garnet', 'Delta, helium. amber blue vivid', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet')),
    36: list(('Amber, ember. delta blue', 'Helium, ember. cyan garnet helium', 'Helium, garnet. delta blue') + ('Cyan, helium. delta ember garnet', 'Delta, helium. amber blue', 'Delta, blue. ember delta helium', 'Cyan, blue. ember garnet quartz')),
}
lines = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
permit = record['dd']
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
route = (badge, permit)
cases = {
    (188, 133): list((('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24)) + (('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8))),
    (188, 132): list((('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24)) + (('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8))),
    (210, 133): list((('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 22), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 4), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24)) + (('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8))),
    (210, 132): list((('AN54', 'edge', 'checked', 17), ('DL91', 'south', 'ready', 19), ('CX28', 'south', 'ready', 5), ('AN65', 'edge', 'ready', 8), ('DL02', 'north', 'ready', 16), ('CX39', 'edge', 'hold', 24)) + (('BR76', 'south', 'void', 11), ('DL13', 'core', 'hold', 4), ('BR50', 'edge', 'ready', 14), ('AN87', 'south', 'hold', 15), ('BR24', 'south', 'ready', 7), ('DL61', 'north', 'void', 18), ('DL98', 'edge', 'checked', 21), ('BR35', 'north', 'checked', 8))),
}
rows = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
signal = record['bb']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G')) + (('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
limit = 3
route = signal
cases = {
    503: 'E',
    506: 'H',
}
start = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
token = record['aa'][0]
nodes = list(('jobs', 'api', 'auth', 'db') + ('cache', 'proxy', 'worker', 'ui'))
route = token
cases = {
    'H': list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
    'E': list((('auth', 'api'), ('db', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
memo = record['aa'][3]
route = memo
cases = {
    'api': list((('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2)) + (('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('S', 1))),
    'ui': list((('N', 1), ('S', 1), ('E', 1), ('E', 1), ('W', 2), ('W', 1), ('E', 2)) + (('W', 1), ('E', 2), ('N', 2), ('N', 1), ('W', 2), ('N', 3), ('N', 3), ('N', 3), ('E', 2))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
clue = record['bb']
left = list((('AN', 8), ('BR', 7), ('CX', 8), ('DL', 8), ('EV', 10)) + (('FP', 5), ('GQ', 3), ('HR', 10)))
fee = 1
route = clue
cases = {
    14: list((('BR', 6), ('CX', 8), ('DL', 5), ('EV', 4)) + (('FP', 13), ('GQ', 10), ('HR', 5))),
    12: list((('BR', 6), ('CX', 8), ('DL', 5), ('EV', 6)) + (('FP', 8), ('GQ', 10), ('HR', 5))),
}
right = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))