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

001

def f1(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        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 (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    sequence = list(steps)
    edge = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

002

def f2(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 and (limit >= 0 or pos > 0)]
    ups = sum((1 for pos in range(1, 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

f2([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

003

def f3(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 = []
    groups = []
    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
        groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f3(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

004

def f4(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[:64]) 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

f4([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

005

def f5(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[:64]:
        if word in stop:
            continue
        frequency[word] = 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

f5(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

006

def f6(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        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)
    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

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

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

007

def f7(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, []))[:20]:
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.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[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f7([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

008

def f8(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 or len(word) < 2:
            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': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f8(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

009

def f9(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 += 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 = (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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

010

def f10(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 % 100):
            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, 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

011

def f11(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans, key=lambda pair: pair[0]):
        if not result or left > result[-1][1] + gap % 5:
            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

f11([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

012

def f12(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)
    steps = {start: 0} if any((start in edge for edge in edges)) 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)
    sequence = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': lastlevel[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f12([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

013

def f13(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]))
    leftover = 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': leftover, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f13([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

014

def f14(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] = min(9, 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

f14(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

015

def f15(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:
            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

f15([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

016

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

f16([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

017

def f17(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[:64]) if value >= limit]
    ups = 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': ups}
    output = dict()
    output.update(returnvalue)
    return output

f17([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

018

def f18(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = max(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

f18([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

019

def f19(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 sorted(nextmap.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, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

020

def f20(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 = max(-64, min(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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

021

def f21(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[:20]:
        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(items)}
    output = dict()
    output.update(returnvalue)
    return output

f21([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

022

def f22(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]
    growth = 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': growth}
    output = dict()
    output.update(returnvalue)
    return output

f22([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

023

def f23(nodes, edges):
    nodes = list(nodes)
    needs = {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)
        needs[b] += 1
    rootsource = dict(needs)
    complete = set()
    sequence = []
    groups = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete))
        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:
            complete.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 rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f23(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

024

def f24(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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
    initial = dict(indegree)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        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 routes[node]:
                indegree[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

f24(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

025

def f25(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:
            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
    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

f25(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

026

def f26(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)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.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': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

027

def f27(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]
    growth = 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': growth}
    output = dict()
    output.update(returnvalue)
    return output

f27([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

028

def f28(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(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': min(100, max((right - left for left, right in segments)))}
    output = dict()
    output.update(returnvalue)
    return output

f28([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

029

def f29(rows, keep, prices):
    rows = list(rows)
    selected = []
    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]
            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(selected), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f29([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

030

def f30(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(min(count, 3 + (count - 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 = (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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

031

def f31(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] = 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

f31([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

032

def f32(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:
        if word in stop:
            continue
        frequency[word] = min(9, 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

f32(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

033

def f33(rows, keep, prices):
    rows = list(rows)
    selected = []
    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:
            cost = value * prices[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(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f33([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

034

def f34(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        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 sorted(nextmap.get(cur, [])):
                if nxt not in levels and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    pending.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, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f34([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

035

def f35(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            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]))
    absent = 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': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f35([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

036

def f36(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

f36(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

037

def f37(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
    initial = dict(indegree)
    complete = set()
    result = []
    layers = []
    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[: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 children[node]:
                indegree[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

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

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

038

def f38(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(series) if value > limit]
    growth = 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': growth}
    output = dict()
    output.update(returnvalue)
    return output

f38([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

039

def f39(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 = []
    rounds = []
    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[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        rounds.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': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

040

def f40(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

f40([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

041

def f41(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 and count > 0:
            combined.append((key, count * ratemap[key] + fee))
    combined.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 combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f41([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

042

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

f42([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

043

def f43(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]
    ups = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': max([0] + series), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f43([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

044

def f44(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

f44(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

045

def f45(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:
            combined.append([left, right])
        else:
            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

f45([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

046

def f46(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] = 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

f46([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

047

def f47(lines, stop):
    lines = list(lines)
    wordmap = {}
    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[:64]:
        if word in stop:
            continue
        wordmap[word] = 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': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f47(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

048

def f48(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 = 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

049

def f49(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]))
    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

f49([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

050

def f50(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)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        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 startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

051

def f51(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]))
    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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f51([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

052

def f52(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(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)
    spaces = []
    for pos in range(1, 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': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f52([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

053

def f53(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(min(count, 64)):
            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 = (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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

054

def f54(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}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    result = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    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')], 'A', 1)

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

055

def f55(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} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    listing = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': listing, 'depth': levels, 'frontier': lastlevel[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f55([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

056

def f56(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, 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]
    growth = 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': growth}
    output = dict()
    output.update(returnvalue)
    return output

f56([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

057

def f57(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

f57([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

058

def f58(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

f58([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

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(count % 100):
            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 = 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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

060

def f60(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:
            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
    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

f60(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

061

def f61(lines, stop):
    lines = list(lines)
    wordmap = {}
    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' 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:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = 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 ranking[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f61(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

062

def f62(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, 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

f62([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

063

def f63(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
    startdegree = dict(incoming)
    finished = set()
    listing = []
    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)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

f63(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

064

def f64(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:
            items.append((key, count * prices[key] + fee))
    items.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 items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f64([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

065

def f65(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

f65([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

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(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker')])

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

067

def f67(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]
    increases = 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': increases}
    output = dict()
    output.update(returnvalue)
    return output

f67([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

068

def f68(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(min(count, 3 + (count - 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 = 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

069

def f69(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:
            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

f69(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

070

def f70(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()
    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), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

071

def f71(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    levels = {start: 0} if any((start in edge for edge in edges)) else {}
    pending = [start]
    while pending:
        cur = pending.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
                    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

f71([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

072

def f72(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
        if not combined or left > combined[-1][1] + gap:
            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

f72([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

073

def f73(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:
            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) > 12:
            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

f73(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

074

def f74(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        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)
    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

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

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

075

def f75(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, min(65, 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

f75([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

076

def f76(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] < 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)
    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

f76([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

077

def f77(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
    startdegree = dict(needs)
    complete = set()
    result = []
    rounds = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        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:
            complete.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 startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

078

def f78(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):
            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 = 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

079

def f79(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:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.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 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

f79([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

080

def f80(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
    startdegree = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        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)
            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 startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f80(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

081

def f81(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[:20]:
        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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

082

def f82(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    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)
    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

f82([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

083

def f83(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 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
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f83([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

084

def f84(rows, keep, prices):
    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}:
            charge = value * prices[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(kept), 'total': amount, 'groups': totals, 'top': [code for code, charge in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f84([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

085

def f85(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], 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

f85([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

086

def f86(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 = 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, 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

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:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = 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 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(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

088

def f88(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * prices[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

f88([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

089

def f89(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(items)}
    output = dict()
    output.update(returnvalue)
    return output

f89([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

090

def f90(nodes, edges):
    nodes = list(nodes)
    indegree = {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)
        indegree[b] += 1
    rootsource = dict(indegree)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[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

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

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

091

def f91(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] < min(limit, 3):
            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

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

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

092

def f92(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([0] + totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f92([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

093

def f93(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] = 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

f93([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

094

def f94(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        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)
    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

f94([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

095

def f95(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
        if not combined or left > combined[-1][1] + min(gap, 2):
            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': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output

f95([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

096

def f96(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = 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 initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f96(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

097

def f97(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:
            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]))
    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

f97(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

098

def f98(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        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

f98([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

099

def f99(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:
            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

f99([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

100

def f100(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(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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

101

def f101(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[:64]) 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

f101([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

102

def f102(rows, keep, factors):
    rows = list(rows)
    matches = []
    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 state in keep and value != 0:
            cost = value * factors[group]
            matches.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f102([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

103

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

f103([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

104

def f104(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(min(count, 3 + (count - count))):
            x = max(-64, min(64, 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 = (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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

105

def f105(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])))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    growth = 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': growth}
    output = dict()
    output.update(returnvalue)
    return output

f105([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

106

def f106(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]))
    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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f106([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

107

def f107(lines, stop):
    lines = list(lines)
    wordmap = {}
    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 or len(word) < 2:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f107(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

108

def f108(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[: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
    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

f108(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

109

def f109(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 = (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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

110

def f110(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:
            cost = value * factors[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f110([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

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(min(count, 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

112

def f112(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()
    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), 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)
            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 startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f112(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

113

def f113(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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()
    result = []
    layers = []
    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[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                needs[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

f113(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

114

def f114(lines, stop):
    lines = list(lines)
    wordmap = {}
    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' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f114(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

115

def f115(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 = max(-64, min(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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

116

def f116(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[:20]:
        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 = 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

117

def f117(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:
            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]))
    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

f117(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

118

def f118(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[:64]:
        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

f118(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

119

def f119(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)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes):
        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
        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

f119(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

120

def f120(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    sumvalue = 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
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f120([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

121

def f121(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[:20]:
        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

f121([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

122

def f122(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 {}
    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)
    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

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

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

123

def f123(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            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]))
    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

f123([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

124

def f124(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
    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': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f124(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

125

def f125(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * ratemap[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(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f125([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

126

def f126(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        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, 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

f126([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

127

def f127(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] = 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

f127([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

128

def f128(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]))
    positions = [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': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f128([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

129

def f129(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap and rate0 != 0:
            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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f129([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

130

def f130(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 limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                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

f130([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

131

def f131(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    groupmap = {}
    grand = 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
            grand += score
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': grand, 'groups': groupmap, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f131([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

132

def f132(nodes, edges):
    nodes = list(nodes)
    indegree = {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)
        indegree[b] += 1
    initial = dict(indegree)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[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

f132(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

133

def f133(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 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

f133([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

134

def f134(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 (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                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[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

135

def f135(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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

136

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

f136([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

137

def f137(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]
    ups = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': max([0] + series), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f137([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

138

def f138(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(min(count, 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 = 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

139

def f139(rows, keep, prices):
    rows = list(rows)
    kept = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * 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(dict.fromkeys(kept)), 'total': amount, 'groups': buckets, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f139([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

140

def f140(nodes, edges):
    nodes = list(nodes)
    indegree = {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)
        indegree[b] += 1
    startdegree = dict(indegree)
    finished = set()
    result = []
    groups = []
    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
        groups.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[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

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

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

141

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

f141([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

142

def f142(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
        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((min(100, 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

f142([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

143

def f143(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            charge = value * prices[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            sumvalue += charge
    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, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f143([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

144

def f144(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[:64]:
        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]))
    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

f144(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

145

def f145(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(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)
    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': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f145([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

146

def f146(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] + max(0, gap):
            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

f146([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

147

def f147(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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()
    result = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = 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 nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        rounds.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': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

f147(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

148

def f148(lines, stop):
    lines = list(lines)
    wordmap = {}
    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
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f148(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

149

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

f149([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

150

def f150(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)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        layers.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': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f150(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

151

def f151(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
    rootsource = dict(needs)
    complete = set()
    sequence = []
    rounds = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete))
        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:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[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

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

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

152

def f152(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    spaces = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        spaces.append(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

f152([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

153

def f153(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:
            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

f153([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

154

def f154(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 sorted(nextmap.get(cur, [])):
                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, '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')], 'A', 1)

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

155

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

f155([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

156

def f156(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    pending.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

f156([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

157

def f157(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}:
            score = value * abs(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

f157([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

158

def f158(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]))
    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

f158([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

159

def f159(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    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 str(state).lower() in {str(item).lower() for item in keep}:
            score = value * ratemap[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

f159([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

160

def f160(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

f160([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

161

def f161(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(totals) 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': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f161([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

162

def f162(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)
    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

f162([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

163

def f163(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

f163([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

164

def f164(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, 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

165

def f165(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]))
    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

f165([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

166

def f166(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        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:
                    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

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

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

167

def f167(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices or rate0 <= 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]))
    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(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f167([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

168

def f168(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, 64)):
            x = max(-64, min(64, 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

169

def f169(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 (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

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

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

170

def f170(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

f170([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

171

def f171(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])))
    indexes = [pos for pos, value in enumerate(totals) 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': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output

f171([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

172

def f172(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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)
    complete = set()
    sequence = []
    rounds = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[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

f172(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

173

def f173(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

f173([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

174

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

f174([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

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[:64]) 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

f175([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

176

def f176(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
    rootsource = dict(indegree)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.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': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

177

def f177(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(prices[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

f177([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

178

def f178(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, 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

179

def f179(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 = (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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

180

def f180(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 = 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

181

def f181(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

f181([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

182

def f182(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        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

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

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

183

def f183(rows, keep, prices):
    rows = list(rows)
    kept = []
    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 and value >= 0:
            cost = value * prices[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    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

f183([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

184

def f184(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
        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(min(100, 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

f184([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

185

def f185(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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f185([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

186

def f186(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)
    complete = set()
    result = []
    rounds = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        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 nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

187

def f187(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[:20]:
        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 crossings:
                crossings.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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

188

def f188(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

f188([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

189

def f189(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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f189([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

190

def f190(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + max(0, gap):
            segments.append([left, right])
        else:
            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((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

f190([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

191

def f191(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            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

f191([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

192

def f192(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])))
    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(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f192([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

193

def f193(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': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f193([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

194

def f194(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        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 sorted(routes.get(cur, [])):
                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[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f194([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

195

def f195(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}:
            charge = value * abs(prices[group])
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            sumvalue += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f195([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

196

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

f196([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

197

def f197(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)
    breaks = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        breaks.append(min(100, left - result[pos - 1][1]))
    returnvalue = {'segments': result, 'cover': sum((min(100, 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

f197([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

198

def f198(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap and 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]))
    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

f198([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

199

def f199(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]))
    positions = [pos for pos, value in enumerate(windows[:64]) 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': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f199([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

200

def f200(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[:64]:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f200(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

201

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

f201([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

202

def f202(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]))
    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([0] + windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f202([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

203

def f203(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
    initial = dict(indegree)
    complete = set()
    result = []
    layers = []
    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=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)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[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

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

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

204

def f204(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    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 str(state).lower() in {str(item).lower() for item in keep}:
            score = value * ratemap[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

f204([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

205

def f205(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[:20]:
        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

f205([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

206

def f206(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)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.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
                    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

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

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

207

def f207(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

f207([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

208

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

f208([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

209

def f209(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}
    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)
    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

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

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

210

def f210(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, min(65, 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

f210([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

211

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

f211([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

212

def f212(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': min(256, max(series)), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f212([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

213

def f213(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
    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

f213([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

214

def f214(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:
            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

f214([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

215

def f215(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    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 and value >= 0:
            charge = value * abs(ratemap[group])
            kept.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, charge in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f215([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

216

def f216(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or 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

f216([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

217

def f217(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[: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
    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

f217(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

218

def f218(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}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    listing = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

219

def f219(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]))
    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

f219([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

220

def f220(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[:20]:
        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

f220([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

221

def f221(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        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[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f221(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

222

def f222(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    matches = [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': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f222([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

223

def f223(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) 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] = 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

f223(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

224

def f224(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]))
    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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f224([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

225

def f225(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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

226

def f226(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        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
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = 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 sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f226(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

227

def f227(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in prices:
            items.append((key, count * prices[key] + fee))
    items.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 items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f227([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

228

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

f228([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

229

def f229(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[:64]:
        if word in stop or len(word) > 12:
            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

f229(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

230

def f230(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 += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.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': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

231

def f231(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[:64]:
            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) > 12:
            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

f231(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

232

def f232(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]))
    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({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f232([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

233

def f233(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(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f233([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

234

def f234(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
    initial = 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))
        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 routes[node]:
                indegree[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

f234(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

235

def f235(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(min(count, 64)):
            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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

236

def f236(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                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')], 'A', 3)

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

237

def f237(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 % 5:
            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((min(100, 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

f237([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

238

def f238(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 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': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f238([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

239

def f239(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 (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)
    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

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

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

240

def f240(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        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]))
    unmatched = 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': unmatched, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

f240([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

241

def f241(lines, stop):
    lines = list(lines)
    wordmap = {}
    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
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f241(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

242

def f242(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] + min(gap, 2):
            result.append([left, right])
        else:
            result[-1][1] = max(0, 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

f242([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

243

def f243(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 += 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

244

def f244(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 = max(-64, min(64, 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 = 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

245

def f245(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(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

f245([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

246

def f246(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} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.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

f246([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

247

def f247(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(min(count, 3 + (count - 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, 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

248

def f248(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    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:
            charge = value * prices[group]
            selected.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            sumvalue += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f248([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":45,"north":406},"top":["DL80","AN39","BR17"],"total":649}

249

def f249(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

f249([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

250

def f250(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)
    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(children.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

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

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

251

def f251(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:
        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

f251(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

252

def f252(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges[:16]:
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    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[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f252([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

253

def f253(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(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

f253([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

254

def f254(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, min(65, 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

f254([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

255

def f255(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:
            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(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((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

f255([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

256

def f256(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

f256([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

257

def f257(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    levels = {start: 0} if any((start in edge for edge in edges)) else {}
    work = [start]
    while work:
        cur = work.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
                    work.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[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f257([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

258

def f258(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:
            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
    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

f258(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

259

def f259(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
    startdegree = dict(incoming)
    finished = set()
    result = []
    rounds = []
    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
        rounds.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': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

260

def f260(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[:64]) if value >= limit and (limit >= 0 or pos > 0)]
    growth = 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': growth}
    output = dict()
    output.update(returnvalue)
    return output

f260([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

261

def f261(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)
    distance = {start: 0}
    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)
    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

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

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

262

def f262(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, 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

263

def f263(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] < min(limit, 3):
            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, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f263([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

264

def f264(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(count):
            x += dx
            y = max(-64, min(64, 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

265

def f265(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

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

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

266

def f266(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {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)
        indegree[b] += 1
    initial = dict(indegree)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[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

f266(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

267

def f267(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap % 5:
            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

f267([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

268

def f268(nodes, edges):
    nodes = list(nodes)
    indegree = {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)
        indegree[b] += 1
    startdegree = dict(indegree)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        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)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[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

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

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

269

def f269(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] = right
    spaces = []
    for pos in range(1, 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': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f269([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

270

def f270(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] + max(0, 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

f270([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

271

def f271(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 = []
    groups = []
    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
        groups.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': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

272

def f272(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 = 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

273

def f273(lines, stop):
    lines = list(lines)
    wordmap = {}
    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:
        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

f273(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

274

def f274(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 += 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 = (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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

275

def f275(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[: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

f275(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

276

def f276(rows, keep, factors):
    rows = list(rows)
    kept = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        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(dict.fromkeys(kept)), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f276([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

277

def f277(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)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            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, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

f277([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

278

def f278(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': max([0] + windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f278([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 1, 34)

{"best":24,"hits":[],"rises":7,"sums":[7,23,9,11,8,6,7,21,24,16,6,12,11,8,18]}

279

def f279(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[: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

f279(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

280

def f280(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)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[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

f280(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

281

def f281(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
    rootsource = dict(indegree)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes):
        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)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[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

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

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

282

def f282(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]
    ups = 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': ups}
    output = dict()
    output.update(returnvalue)
    return output

f282([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

283

def f283(lines, stop):
    lines = list(lines)
    wordmap = {}
    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
        wordmap[word] = 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': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f283(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

284

def f284(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = 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 initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

f284(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

285

def f285(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}
    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)
    result = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f285([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

286

def f286(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 % 100):
            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 = 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

287

def f287(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(combined[-1][1], right)
    spaces = []
    for pos in range(1, min(50, 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

f287([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

288

def f288(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)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps:
                    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

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

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

289

def f289(lines, stop):
    lines = list(lines)
    wordmap = {}
    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[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f289(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

290

def f290(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 % 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(min(100, 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

f290([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

291

def f291(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]
    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

f291([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

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(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([('W', 1), ('S', 1), ('W', 1), ('E', 3), ('E', 1), ('N', 1), ('E', 3), ('W', 1), ('S', 1), ('S', 1), ('S', 3), ('N', 2), ('S', 1), ('E', 1), ('S', 2), ('N', 2)])

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

293

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

f293([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

294

def f294(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[: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

f294(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

295

def f295(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap and 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(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f295([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

296

def f296(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 = 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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

297

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

f297([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

298

def f298(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:
        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

f298([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

299

def f299(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
    initial = dict(indegree)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.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': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

300

def f300(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((min(100, 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

f300([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

301

def f301(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() 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:
            continue
        tallies[word] = min(9, 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': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f301(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['delta', 'ember'])

{"counts":{"amber":5,"blue":3,"cyan":4,"frost":4,"garnet":2,"helium":3},"initials":{"a":5,"b":3,"c":4,"f":4,"g":2,"h":3},"size":103,"top":["amber","cyan","frost","blue","helium"]}

302

def f302(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:
            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

f302([('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["HR",112],["EV",100],["BR",77],["GQ",72],["DL",28]],"missing":["AN","CX","FP"],"total":389}

303

def f303(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()
    sequence = []
    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))
        if not available:
            break
        current = available
        rounds.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': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

304

def f304(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.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[:3], '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')], 'A', 3)

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

305

def f305(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, min(50, len(combined))):
        left = combined[pos][0]
        gaps.append(min(100, 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

f305([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

306

def f306(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 = 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

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

{"bounds":[-2,-6,6,0],"end":[6,-6],"far":12,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3]],"steps":24}

307

def f307(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 and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    queue.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

f307([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

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

308

def f308(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:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = 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 ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f308(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

309

def f309(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]))
    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

f309(['Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet', 'Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'], ['amber', 'blue'])

{"counts":{"cyan":4,"delta":7,"ember":3,"frost":4,"garnet":2,"helium":3},"initials":{"c":4,"d":7,"e":3,"f":4,"g":2,"h":3},"size":116,"top":["delta","cyan","frost","ember","helium"]}

310

def f310(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()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if indegree[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
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[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

f310(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

311

def f311(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:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.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 matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f311([('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7), ('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9)], [('BR', 7), ('DL', 4), ('EV', 10), ('GQ', 8), ('HR', 8)], 0)

{"count":5,"items":[["EV",100],["BR",77],["GQ",72],["HR",72],["DL",28]],"missing":["AN","CX","FP"],"total":349}

312

def f312(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}
    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)
    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

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

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

313

def f313(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(0, 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

f313([(2, 9), (5, 9), (14, 16), (18, 24), (28, 33), (33, 39), (43, 47), (48, 50), (59, 62)], 1)

{"cover":36,"holes":[5,2,4,4,9],"longest":11,"segments":[[2,9],[14,16],[18,24],[28,39],[43,50],[59,62]]}

314

def f314(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[:64]) 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

f314([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

315

def f315(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] = 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

f315([(2, 9), (5, 9), (14, 16), (18, 25), (28, 33), (33, 36), (43, 47), (48, 50), (59, 62)], 1)

{"cover":34,"holes":[5,2,3,7,9],"longest":8,"segments":[[2,9],[14,16],[18,25],[28,36],[43,50],[59,62]]}

316

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

f316([7, 23, 9, 11, 8, 6, 7, 21, 24, 16, 6, 12, 11, 8, 18], 3, 34)

{"best":61,"hits":[0,1,5,6,7,8,9,12],"rises":6,"sums":[39,43,28,25,21,34,52,61,46,34,29,31,37]}

317

def f317(rows, keep, factors):
    rows = list(rows)
    kept = []
    buckets = {}
    amount = 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
            amount += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': amount, 'groups': buckets, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f317([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

318

def f318(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 = 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

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

{"bounds":[-2,-6,5,0],"end":[5,-4],"far":11,"revisits":[[-1,-1],[4,0],[4,-4],[4,-3],[5,-5]],"steps":25}

319

def f319(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    buckets = {}
    sumvalue = 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])
            matches.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f319([('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18), ('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":8,"groups":{"core":198,"edge":39,"north":427},"top":["DL80","AN39","BR17"],"total":664}

320

def f320(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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
    startdegree = dict(needs)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        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
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[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

f320(['auth', 'api', 'proxy', 'worker', 'ui', 'db', 'cache', 'jobs'], [('db', 'api'), ('cache', '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"]}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
lines = list(('Cyan, cyan. helium delta', 'Amber, blue. amber frost blue', 'Amber, ember. amber delta', 'Delta, delta. helium frost garnet') + ('Amber, frost. delta helium', 'Blue, cyan. frost ember delta', 'Garnet, delta. cyan ember'))
stop = list(('amber',) + ('blue',))
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))}
ticket = record['dd']
nodes = list(('auth', 'api', 'proxy', 'worker') + ('ui', 'db', 'cache', 'jobs'))
route = ticket
cases = {
    103: list((('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
    116: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'))),
}
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)}
badge = record['aa'][3]
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
route = badge
cases = {
    'proxy': list((('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 11), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18)) + (('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 8), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5))),
    'api': list((('AN95', 'north', 'checked', 3), ('AN32', 'edge', 'ready', 5), ('BR69', 'north', 'ready', 8), ('DL06', 'core', 'hold', 8), ('BR43', 'edge', 'hold', 6), ('DL80', 'core', 'checked', 18)) + (('BR17', 'north', 'checked', 18), ('BR54', 'edge', 'hold', 14), ('AN91', 'core', 'hold', 10), ('CX28', 'south', 'hold', 23), ('CX65', 'edge', 'hold', 9), ('CX02', 'edge', 'ready', 10), ('AN39', 'north', 'ready', 24), ('BR76', 'north', 'ready', 5))),
}
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}
permit = record['bb']
gap = 1
route = permit
cases = {
    649: list(((2, 9), (5, 9), (14, 16), (18, 25), (28, 33)) + ((33, 36), (43, 47), (48, 50), (59, 62))),
    664: list(((2, 9), (5, 9), (14, 16), (18, 24), (28, 33)) + ((33, 39), (43, 47), (48, 50), (59, 62))),
}
spans = cases[route]
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))}
signal = record['cc']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
start = 'A'
route = badge
cases = {
    'proxy': 3,
    'api': 1,
}
limit = 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['dd']
route = (signal, token)
cases = {
    (34, 3): list((('W', 1), ('S', 1), ('W', 1), ('E', 3), ('E', 1), ('N', 1), ('E', 3)) + (('W', 1), ('S', 1), ('S', 1), ('S', 3), ('N', 2), ('S', 1), ('E', 1), ('S', 2), ('N', 2))),
    (34, 8): list((('W', 1), ('S', 1), ('W', 1), ('E', 3), ('E', 1), ('N', 1), ('E', 3)) + (('W', 1), ('S', 1), ('S', 1), ('S', 3), ('N', 2), ('S', 1), ('E', 1), ('S', 2), ('N', 2))),
    (36, 3): list((('W', 1), ('S', 1), ('W', 1), ('E', 3), ('E', 1), ('N', 1), ('E', 3)) + (('W', 1), ('S', 1), ('S', 1), ('S', 3), ('N', 2), ('S', 1), ('E', 1), ('S', 2), ('N', 2))),
    (36, 8): list((('W', 1), ('S', 1), ('W', 1), ('E', 3), ('E', 1), ('N', 1), ('E', 3)) + (('W', 1), ('S', 1), ('S', 1), ('S', 3), ('N', 2), ('S', 1), ('E', 1), ('S', 2), ('E', 1))),
}
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}
memo = record['bb']
values = list((7, 23, 9, 11, 8, 6, 7, 21) + (24, 16, 6, 12, 11, 8, 18))
limit = 34
route = memo
cases = {
    12: 3,
    11: 1,
}
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}
clue = record['bb']
right = list((('BR', 7), ('DL', 4)) + (('EV', 10), ('GQ', 8), ('HR', 8)))
fee = 0
route = clue
cases = {
    24: list((('AN', 7), ('BR', 11), ('CX', 10), ('DL', 7)) + (('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 9))),
    61: list((('AN', 7), ('BR', 11), ('CX', 7), ('DL', 7)) + (('EV', 10), ('FP', 4), ('GQ', 9), ('HR', 14))),
}
left = 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))