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

001

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

f1([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

002

def f2(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in (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)
    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

f2([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

003

def f3(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    steps = {start: 0} if limit > 0 or limit < 0 else {}
    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:
                    steps[nxt] = steps[cur] + 1
                    queue.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[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

004

def f4(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = 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

f4(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

005

def f5(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < 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)
    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

f5([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

006

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

f6([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

007

def f7(board):
    board = list(board)
    found = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            work = [(row, col)]
            found.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f7(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

008

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

f8([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

009

def f9(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]))
    leftover = 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': leftover, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output

f9([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

010

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

f10([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

011

def f11(left, right, banned):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()[:12]
    banned = {canon(value) for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {canon(value) for value in right if canon(value) != ''} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f11(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

012

def f12(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

013

def f13(left, right, excluded):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f13(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

014

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

f14([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

015

def f15(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip(' \n').upper()
    excluded = {tidy(value) for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f15(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

016

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

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

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

017

def f17(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    levels = {start: 0} 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 sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    work.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[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

018

def f18(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
    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([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

019

def f19(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, 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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

020

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

f20([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

021

def f21(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f21(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

022

def f22(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices and count > 0:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    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

f22([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

023

def f23(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    excluded = {tidy(value) for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f23(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

024

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

025

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

f25(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

026

def f26(left, right, banned):
    left = list(left)

    def tidy(value):
        return str(value).strip(' ').upper()[:12]
    banned = {tidy(value) for value in banned}
    a = {tidy(value) for value in left} - banned
    b = {tidy(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f26(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

027

def f27(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':
                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

f27(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

028

def f28(board):
    board = list(board)
    visited = set()
    regions = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        work.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f28(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

029

def f29(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not combined or left > combined[-1][1] + min(gap, 2):
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    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

f29([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

030

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

f30([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

031

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

f31([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

032

def f32(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f32(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

033

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

f33(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

034

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

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

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

035

def f35(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        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 and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

036

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

f36([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

037

def f37(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                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

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

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

038

def f38(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    banned = {normalize(value) for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right if normalize(value) != ''} - banned
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f38(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

039

def f39(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            pending = [(row, col)]
            visited.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f39(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

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] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f40([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

041

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

042

def f42(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            pending = [(row, col)]
            found.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f42(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

043

def f43(left, right, excluded):
    left = list(left)

    def canon(value):
        return str(value).strip(' \r').upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f43(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

044

def f44(board):
    board = list(board)
    known = set()
    regions = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f44(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

045

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

f45([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

046

def f46(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 or len(word) < 2:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f46(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

047

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

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

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

048

def f48(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            queue = [(row, col)]
            visited.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f48(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

049

def f49(rows, keep, factors):
    rows = list(rows)
    matches = []
    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:
            cost = value * abs(factors[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(matches), 'total': sumvalue, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f49([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

050

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

051

def f51(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[: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
        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

f51(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

052

def f52(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    banned = {normalize(value) for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f52(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

053

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

054

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

f54([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

055

def f55(board):
    board = list(board)
    found = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f55(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

056

def f56(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    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

f56([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

057

def f57(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0} if any((start in edge for edge in edges)) else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    pending.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

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

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

058

def f58(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[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f58(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

059

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

f59(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

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[: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
        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

f60(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

061

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

f61([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

062

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

f62([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

063

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

f63(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

064

def f64(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':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    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

f64(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

065

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

f65([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

066

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

067

def f67(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if col >= 12 or board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f67(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

068

def f68(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()[:12]
    banned = {normalize(value) for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f68(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

069

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

f69([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

070

def f70(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 and count > 0:
            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

f70([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

071

def f71(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[:20]:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

072

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

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

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

073

def f73(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        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({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output

f73([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

074

def f74(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * factors[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

f74([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

075

def f75(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        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]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f75([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

076

def f76(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not result or left > result[-1][1] + gap:
            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

f76([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

077

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

f77([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

078

def f78(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[:20]:
        if key in factors and count > 0:
            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(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f78([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

079

def f79(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            queue = [(row, col)]
            known.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 100:
                            continue
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f79(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

080

def f80(board):
    board = list(board)
    visited = set()
    pieces = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            queue = [(row, col)]
            visited.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        queue.append(nxt)
            pieces.append((len(cells), min(cells)))
    pieces.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
    output = dict()
    output.update(returnvalue)
    return output

f80(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

081

def f81(board):
    board = list(board)
    found = set()
    regions = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        queue.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f81(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

082

def f82(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    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 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

083

def f83(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = 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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

084

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

f84([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

085

def f85(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    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

f85([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

086

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

f86([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

087

def f87(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        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]))
    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({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f87([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

088

def f88(left, right, ignored):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()
    ignored = {normalize(value) for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f88(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

089

def f89(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], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f89([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

090

def f90(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            pending = [(row, col)]
            found.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f90(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

091

def f91(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()[:12]
    banned = {normalize(value) for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f91(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

092

def f92(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    pending.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

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

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

093

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

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

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

094

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

f94([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

095

def f95(left, right, banned):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    banned = {normalize(value) for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f95(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

096

def f96(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':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    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

f96(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

097

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

f97([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

098

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

f98([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

099

def f99(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    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

f99([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

100

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

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

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

101

def f101(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        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

f101(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

102

def f102(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = 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, 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

103

def f103(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < min(limit, 3):
            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)
    listing = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': lastlevel[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

104

def f104(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        if not combined or left > combined[-1][1] + min(gap, 2):
            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

f104([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

105

def f105(board):
    board = list(board)
    found = set()
    regions = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        queue.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f105(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

106

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

f106([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

107

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

f107([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

108

def f108(board):
    board = list(board)
    known = set()
    pieces = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            pieces.append((len(cells), min(cells)))
    pieces.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
    output = dict()
    output.update(returnvalue)
    return output

f108(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

109

def f109(left, right, banned):
    left = list(left)

    def tidy(value):
        return ' '.join(str(value).split()).upper()
    banned = {tidy(value) for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {tidy(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f109(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

110

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

111

def f111(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()[:12]
    banned = {normalize(value) for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f111(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

112

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

113

def f113(left, right, banned):
    left = list(left)

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    banned = {str(value).upper() for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f113(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

114

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

115

def f115(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

116

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

f116([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

117

def f117(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {str(value).upper() for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f117(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

118

def f118(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                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] = min(9, 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

f118(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

119

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

f119(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

120

def f120(board):
    board = list(board)
    found = set()
    regions = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        queue.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f120(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

121

def f121(rows, keep, ratemap):
    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(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

f121([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

122

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

f122([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

123

def f123(left, right, excluded):
    left = list(left)

    def canon(value):
        return str(value).strip(' \r').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f123(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

124

def f124(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(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f124([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

125

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

f125([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

126

def f126(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] = max(segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(min(100, 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

f126([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

127

def f127(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip(' ').upper()
    ignored = {canon(value) for value in ignored}
    a = {canon(value) for value in left} - ignored
    b = {canon(value) for value in right} - ignored
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f127(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

128

def f128(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()[:12]
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f128(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

129

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

f129([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

130

def f130(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] = right
    breaks = []
    for pos in range(1, min(50, 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

f130([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

131

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

132

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

f132([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

133

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

134

def f134(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}
    pending = [start]
    while pending:
        cur = pending.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
                    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

f134([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap and count > 0:
            items.append((key, count * ratemap[key] + fee))
    items.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 items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f135([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

136

def f136(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    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} 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(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f136([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

137

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

f137(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

138

def f138(board):
    board = list(board)
    visited = set()
    pieces = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        work.append(nxt)
            pieces.append((len(cells), min(cells)))
    pieces.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
    output = dict()
    output.update(returnvalue)
    return output

f138(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

139

def f139(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

140

def f140(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip(' \r').upper()
    ignored = {canon(value) for value in ignored}
    a = {str(value).upper() for value in left} - ignored
    b = {canon(value) for value in right} - ignored
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f140(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

141

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

142

def f142(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] < min(limit, 3):
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    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

f142([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

143

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

f143(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

144

def f144(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

145

def f145(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap and count > 0:
            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

f145([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

146

def f146(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            queue = [(row, col)]
            found.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f146(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

147

def f147(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f147(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

148

def f148(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, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

149

def f149(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] = max(segments[-1][1], right)
    spaces = []
    for pos in range(1, min(50, len(segments))):
        left = segments[pos][0]
        spaces.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f149([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

150

def f150(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f150(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

151

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

f151([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

152

def f152(board):
    board = list(board)
    visited = set()
    regions = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if col >= 12 or board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            pending = [(row, col)]
            visited.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        pending.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f152(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

153

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

f153([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

154

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

f154([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

155

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

f155([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

156

def f156(board):
    board = list(board)
    visited = set()
    regions = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            pending = [(row, col)]
            visited.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        pending.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f156(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

157

def f157(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    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

f157(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

158

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

f158([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

159

def f159(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    excluded = {normalize(value) for value in excluded}
    a = {str(value).upper() for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f159(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

160

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

f160([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

161

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

f161([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

162

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

f162(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

163

def f163(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right if normalize(value) != ''} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f163(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

164

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

f164([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

165

def f165(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        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

f165([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

166

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

167

def f167(board):
    board = list(board)
    known = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f167(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

168

def f168(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:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f168(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

169

def f169(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] + min(gap, 2):
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    spaces = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        spaces.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': min(100, max((right - left for left, right in result)))}
    output = dict()
    output.update(returnvalue)
    return output

f169([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

170

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

f170([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

171

def f171(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:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f171([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

172

def f172(left, right, excluded):
    left = list(left)

    def canon(value):
        return str(value).strip(' ').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {str(value).upper() for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f172(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

173

def f173(left, right, ignored):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()[:12]
    ignored = {str(value).upper() for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f173(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

174

def f174(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(0, combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f174([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

175

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

f175([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

176

def f176(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    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 = 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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

177

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

178

def f178(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = 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 ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f178(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

179

def f179(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            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, 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

180

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

181

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

f181(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

182

def f182(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
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f182(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

183

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

f183([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

184

def f184(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f184(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

185

def f185(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, 64)):
            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 = (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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

186

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

f186([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

187

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

f187([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

188

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

f188([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

189

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

f189([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

190

def f190(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()
    excluded = {normalize(value) for value in excluded}
    a = {str(value).upper() for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f190(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

191

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

f191([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

192

def f192(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y = max(-64, min(64, 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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

193

def f193(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' 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
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f193(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

194

def f194(left, right, banned):
    left = list(left)

    def tidy(value):
        return str(value).strip(' \n').upper()
    banned = {str(value).upper() for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {tidy(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f194(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

195

def f195(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            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

f195(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

196

def f196(board):
    board = list(board)
    visited = set()
    regions = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            queue = [(row, col)]
            visited.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        queue.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f196(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

197

def f197(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] < min(limit, 3):
            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)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

f197([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

198

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

f198([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

199

def f199(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, 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 = (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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

200

def f200(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 and count > 0:
            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(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f200([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

201

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

f201([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

202

def f202(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' 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
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f202(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

203

def f203(left, right, banned):
    left = list(left)

    def canon(value):
        return str(value).strip(' ').upper()
    banned = {canon(value) for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {canon(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f203(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

204

def f204(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) > 12:
            continue
        tallies[word] = min(9, 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': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f204(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

205

def f205(board):
    board = list(board)
    known = set()
    pieces = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(min(len(board[row]), 10)):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            pieces.append((len(cells), min(cells)))
    pieces.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
    output = dict()
    output.update(returnvalue)
    return output

f205(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

206

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

f206(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

207

def f207(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        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)
    listing = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f207([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

208

def f208(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 * prices[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(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f208([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

209

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

f209([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

210

def f210(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(0, result[-1][1], right)
    gaps = []
    for pos in range(1, min(50, len(result))):
        left = result[pos][0]
        gaps.append(min(100, left - result[pos - 1][1]))
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output

f210([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

211

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

212

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

f212([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

213

def f213(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f213(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

214

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

f214([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

215

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

f215([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

216

def f216(board):
    board = list(board)
    found = set()
    regions = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            work = [(row, col)]
            found.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        work.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f216(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

217

def f217(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)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.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

f217([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

218

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

f218(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

219

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

f219([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

220

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

f220([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

221

def f221(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, 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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

222

def f222(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[: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
        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

f222(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

223

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

f223([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

224

def f224(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left:
        if key in ratemap:
            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({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f224([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

225

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

f225([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

226

def f226(left, right, banned):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()
    banned = {str(value).upper() for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {canon(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f226(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

227

def f227(left, right, banned):
    left = list(left)

    def canon(value):
        return ' '.join(str(value).split()).upper()
    banned = {str(value).upper() for value in banned}
    a = {canon(value) for value in left} - banned
    b = {canon(value) for value in right} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f227(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

228

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

f228([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

229

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

f229([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

230

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

231

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

f231([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

232

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

f232([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

233

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

f233(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

234

def f234(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.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(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.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

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

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

235

def f235(left, right, banned):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    banned = {tidy(value) for value in banned}
    a = {tidy(value) for value in left if tidy(value) != tidy(value) or tidy(value) != ''} - banned
    b = {tidy(value) for value in right if tidy(value) != ''} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f235(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

236

def f236(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    pending = [start]
    while pending:
        cur = pending.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
                    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

f236([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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(board):
    board = list(board)
    visited = set()
    regions = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        work.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f237(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

238

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

f238(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

239

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

f239([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

240

def f240(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    steps = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.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
                    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

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

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

241

def f241(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    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

f241([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

242

def f242(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    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

f242([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

243

def f243(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: pair[0]):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, min(50, len(combined))):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((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

f243([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

244

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

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

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

245

def f245(board):
    board = list(board)
    known = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            queue = [(row, col)]
            known.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f245(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

246

def f246(board):
    board = list(board)
    found = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            pending = [(row, col)]
            found.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f246(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

247

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

f247([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

248

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

f248(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

249

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

f249([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

250

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

251

def f251(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.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
                    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, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

f251([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

252

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

f252([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

253

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

f253([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

254

def f254(left, right, excluded):
    left = list(left)

    def canon(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).upper() for value in excluded}
    a = {str(value).upper() for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f254(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

255

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

256

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

f256([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

257

def f257(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f257(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

258

def f258(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip(' \n').upper()
    ignored = {canon(value) for value in ignored}
    a = {str(value).upper() for value in left} - ignored
    b = {canon(value) for value in right} - ignored
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f258(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

259

def f259(rows, keep, factors):
    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 * factors[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(dict.fromkeys(matches)), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f259([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

260

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

f260([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

261

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

f261([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

262

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

f262([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

263

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

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

{"bounds":[0,-13,8,0],"end":[8,-11],"far":21,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":35}

264

def f264(board):
    board = list(board)
    known = set()
    regions = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

f264(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

265

def f265(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    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)
    sequence = list(levels)
    edge = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': edge, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

266

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

f266([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

267

def f267(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f267(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

268

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

f268([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

269

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

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

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

270

def f270(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':
                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

f270(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

271

def f271(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            queue = [(row, col)]
            visited.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f271(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

272

def f272(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in prices and count > 0:
            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

f272([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

273

def f273(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[:20]:
        if key in prices:
            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

f273([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

274

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

f274([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

275

def f275(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[:20]:
        if key in factors and count > 0:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f275([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

276

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

f276([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

277

def f277(left, right, excluded):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()[:12]
    excluded = {str(value).upper() for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right} - excluded
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f277(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

278

def f278(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * prices[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': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f278([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

279

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

280

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

f280([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

281

def f281(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    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

f281(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

282

def f282(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            pending = [(row, col)]
            visited.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        if len(visited) >= 100:
                            continue
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f282(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

283

def f283(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 100:
                            continue
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f283(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

284

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

f284([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

285

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

f285([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

286

def f286(left, right, excluded):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()[:12]
    excluded = {str(value).upper() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(value) for value in right if tidy(value) != ''} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f286(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

287

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

f287([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

288

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

f288([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

289

def f289(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(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 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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

290

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

f290([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

291

def f291(board):
    board = list(board)
    known = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f291(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

292

def f292(board):
    board = list(board)
    known = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            pending = [(row, col)]
            known.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 100:
                            continue
                        pending.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f292(['##.#..', '..##..', '.#.#.#', '#####.', '#..#.#', '.#....'])

{"anchors":[[0,3],[0,0],[2,5],[4,5],[5,1]],"count":5,"filled":17,"sizes":[12,2,1,1,1]}

293

def f293(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        work.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

f293(['##....', '..##..', '.#.#.#', '#####.', '#..#.#', '......'])

{"anchors":[[1,2],[0,0],[2,5],[4,5]],"count":4,"filled":15,"sizes":[11,2,1,1]}

294

def f294(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()[:12]
    banned = {normalize(value) for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    listing = sorted
    returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f294(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

295

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

f295([(4, 11), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67)], 2)

{"cover":49,"holes":[4,3,3,4],"longest":12,"segments":[[4,11],[15,26],[29,41],[44,56],[60,67]]}

296

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

f296([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

297

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

f297([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

298

def f298(left, right, banned):
    left = list(left)

    def tidy(value):
        return str(value).strip().upper()
    banned = {tidy(value) for value in banned}
    a = {str(value).upper() for value in left} - banned
    b = {tidy(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f298(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

299

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

f299(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

300

def f300(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        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

f300(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

301

def f301(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    breaks = []
    for pos in range(1, min(50, 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': min(100, max((right - left for left, right in segments)))}
    output = dict()
    output.update(returnvalue)
    return output

f301([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

302

def f302(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

303

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

304

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

f304([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

305

def f305(left, right, excluded):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \r').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f305(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['helium'])

{"all":["AMBER","BLUE","CYAN","EMBER","FROST","GARNET","IVORY"],"both":["EMBER","FROST","GARNET","IVORY"],"left":["BLUE"],"right":["AMBER","CYAN"],"score":21}

306

def f306(left, right, ignored):
    left = list(left)

    def normalize(value):
        return str(value).strip().upper()
    ignored = {str(value).upper() for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f306(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

307

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

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

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

308

def f308(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]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output

f308([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

309

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

f309([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 10), ('BR', 9), ('CX', 6), ('DL', 15), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["DL",109],["EV",88],["CX",70],["AN",44],["BR",40]],"missing":[],"total":445}

310

def f310(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' ').upper()
    banned = {str(value).upper() for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f310(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

311

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

f311(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['amber'])

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

312

def f312(left, right, banned):
    left = list(left)

    def normalize(value):
        return str(value).strip(' \n').upper()
    banned = {str(value).upper() for value in banned}
    a = {normalize(value) for value in left} - banned
    b = {normalize(value) for value in right} - banned
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f312(['helium', 'frost', 'Ember', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['frost', 'Ember', ' Amber', 'cyan ', 'GARNET', 'ivory', 'Ember'], ['Ember'])

{"all":["AMBER","BLUE","CYAN","FROST","GARNET","HELIUM","IVORY"],"both":["FROST","GARNET","IVORY"],"left":["BLUE","HELIUM"],"right":["AMBER","CYAN"],"score":16}

313

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

f313(['Blue, cyan. helium blue', 'Cyan, ember. ember ember ember', 'Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'], ['frost'])

{"counts":{"amber":2,"blue":4,"cyan":8,"delta":2,"ember":7,"garnet":3,"helium":2},"initials":{"a":2,"b":4,"c":8,"d":2,"e":7,"g":3,"h":2},"size":133,"top":["cyan","ember","blue","garnet","amber"]}

314

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

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

{"bounds":[0,-10,10,0],"end":[10,-8],"far":20,"revisits":[[0,-4],[0,-3],[0,-2],[3,-3],[3,-2]],"steps":34}

315

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

f315([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":9,"groups":{"core":352,"north":49,"south":290},"top":["DL25","BR40","CX51"],"total":691}

316

def f316(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 {}
    work = [start]
    while work:
        cur = work.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 and (not nxt.startswith('Z')):
                    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

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

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

317

def f317(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}
    work = [start]
    while work:
        cur = work.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
                    work.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

f317([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')], '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"]}

318

def f318(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:
        if key in factors:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

f318([('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12), ('FP', 2), ('GQ', 9), ('HR', 7)], [('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7), ('FP', 10), ('GQ', 3), ('HR', 5)], 4)

{"count":8,"items":[["EV",88],["DL",74],["CX",70],["AN",52],["BR",40]],"missing":[],"total":418}

319

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

f319([('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11), ('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":1,"groups":{"north":77},"top":["BR03"],"total":77}

320

def f320(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] + min(gap, 2):
            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

f320([(3, 10), (6, 11), (15, 22), (19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67)], 2)

{"cover":50,"holes":[4,3,3,4],"longest":16,"segments":[[3,11],[15,26],[29,41],[44,47],[51,67]]}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'E')))
start = 'A'
limit = 3
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)}
signal = record['aa'][3]
left = list((('AN', 4), ('BR', 4), ('CX', 11), ('DL', 7), ('EV', 12)) + (('FP', 2), ('GQ', 9), ('HR', 7)))
right = list((('AN', 12), ('BR', 9), ('CX', 6), ('DL', 10), ('EV', 7)) + (('FP', 10), ('GQ', 3), ('HR', 5)))
fee = 4
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)}
token = record['bb']
route = signal
cases = {
    'F': list((('S', 2), ('S', 3), ('N', 3), ('E', 3), ('S', 2), ('N', 2), ('S', 2)) + (('E', 3), ('E', 2), ('W', 1), ('S', 3), ('S', 5), ('S', 1), ('E', 1), ('N', 2))),
    'D': list((('S', 2), ('S', 3), ('N', 3), ('E', 3), ('S', 2), ('N', 2), ('S', 2)) + (('E', 3), ('E', 2), ('W', 1), ('S', 3), ('S', 2), ('S', 1), ('E', 3), ('N', 2))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
memo = record['bb']
gap = 2
route = token
cases = {
    418: list(((4, 11), (6, 11), (15, 22)) + ((19, 26), (29, 33), (34, 41), (44, 47), (49, 56), (60, 67))),
    445: list(((3, 10), (6, 11), (15, 22)) + ((19, 26), (29, 33), (34, 41), (44, 47), (51, 58), (60, 67))),
}
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))}
clue = record['cc']
route = (signal, token)
cases = {
    ('F', 445): list(('##....', '..##..', '.#.#.#', '#####.') + ('#..#.#', '......')),
    ('F', 418): list(('##....', '..##..', '.#.#.#', '#####.') + ('#..#.#', '......')),
    ('D', 445): list(('##....', '..##..', '.#.#.#', '#####.') + ('#..#.#', '......')),
    ('D', 418): list(('##.#..', '..##..', '.#.#.#', '#####.') + ('#..#.#', '.#....')),
}
board = cases[route]
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
stamp = record['cc']
rows = list((('DL81', 'edge', 'hold', 18), ('CX18', 'north', 'ready', 7), ('DL55', 'north', 'void', 13), ('DL92', 'south', 'ready', 8), ('BR29', 'core', 'ready', 4), ('AN66', 'core', 'void', 5), ('BR03', 'north', 'checked', 11)) + (('BR40', 'south', 'ready', 18), ('AN77', 'core', 'ready', 4), ('CX14', 'edge', 'hold', 14), ('CX51', 'south', 'ready', 14), ('BR88', 'south', 'ready', 8), ('DL25', 'core', 'ready', 24), ('AN62', 'south', 'ready', 10)))
rates = dict((('north', 7), ('south', 5)) + (('core', 11), ('edge', 3)))
route = (memo, stamp)
cases = {
    (20, 17): ['checked'],
    (20, 15): ['ready'],
    (21, 17): ['ready'],
    (21, 15): ['ready'],
}
keep = 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}
ticket = record['bb']
lines = list(('Blue, cyan. helium blue', 'Cyan, ember. ember ember ember') + ('Frost, amber. cyan delta', 'Ember, delta. blue cyan cyan', 'Ember, cyan. amber ember', 'Blue, helium. garnet frost garnet', 'Cyan, frost. cyan garnet'))
route = (clue, ticket)
cases = {
    (50, 691): ['amber'],
    (50, 77): ['amber'],
    (49, 691): ['amber'],
    (49, 77): ['frost'],
}
stop = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
badge = record['dd']
left = list(('helium', 'frost', 'Ember', 'ivory') + ('GARNET', 'BLUE', 'Ember'))
right = list(('frost', 'Ember', ' Amber', 'cyan ') + ('GARNET', 'ivory', 'Ember'))
route = badge
cases = {
    133: ['Ember'],
    138: ['helium'],
}
blocked = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
out['ee'] = record['ee']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))