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

001

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

    def canon(value):
        return str(value).strip(' ').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

f1(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

002

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

    def tidy(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).upper() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f2(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

003

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

f3([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

004

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

f4([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

005

def f5(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[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)
                        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

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

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

006

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

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

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

007

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

f7([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

008

def f8(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[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

f8(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

009

def f9(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]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

010

def f10(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            score = value * prices[group]
            matches.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            amount += score
    matches.sort(key=lambda item: (-item[1], item[0]))
    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

f10([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

011

def f11(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            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

f11([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

012

def f12(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]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f12([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

013

def f13(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            charge = value * prices[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

f13([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

014

def f14(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            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': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output

f14(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

015

def f15(board):
    board = list(board)
    known = set()
    components = []
    for row in range(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)
                        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

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

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

016

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

f16([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

017

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

    def normalize(value):
        return str(value).strip(' \n').upper()
    ignored = {str(value).strip() for value in ignored}
    a = {normalize(value) for value in left} - ignored
    b = {normalize(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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f17(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

018

def f18(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)
    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(children.get(cur, [])) if len(str(node)) == 1):
                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

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

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

019

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

f19([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

020

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

021

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

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

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

022

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

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

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

023

def f23(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] + 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((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

f23([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

024

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

f24([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

025

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

f25([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

026

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

    def normalize(value):
        return str(value).strip().upper()
    ignored = {str(value).strip() 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

f26(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

027

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

f27([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

028

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

f28(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

029

def f29(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[row])):
            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

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

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

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

f30([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

031

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

032

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

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

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

033

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

f33([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

034

def f34(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[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)
            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

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

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

035

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

f35(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

036

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

f36([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

037

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

f37([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

038

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

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

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

039

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

    def tidy(value):
        return str(value).strip().upper()
    excluded = {str(value).upper() 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

f39(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

040

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

f40(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

041

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

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

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

042

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

f42([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

043

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

f43([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

044

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

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

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

045

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

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

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

046

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

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

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

047

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

f47([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

048

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

f48(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

049

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

f49(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

050

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

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

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

051

def f51(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 if normalize(value) != normalize(value) or normalize(value) != ''} - ignored
    b = {normalize(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

f51(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

052

def f52(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 = []
            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)
                        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

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

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

053

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

    def canon(value):
        return str(value).strip().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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f53(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

054

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

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

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

055

def f55(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    sumvalue = 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
            sumvalue += score
    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, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f55([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

056

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

f56([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

057

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

f57([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

058

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

    def canon(value):
        return ' '.join(str(value).split()).upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left} - excluded
    b = {canon(value) for value in right if canon(value) != ''} - 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

f58(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

059

def f59(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)
                        if len(visited) >= 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

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

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

060

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

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

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

061

def f61(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 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
            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

f61([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

062

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

    def normalize(value):
        return ' '.join(str(value).split()).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
    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

f62(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

063

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

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

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

064

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

f64([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

065

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

f65([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

066

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

f66([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

067

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

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

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

068

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

f68([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

069

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

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

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

070

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

    def tidy(value):
        return str(value).strip(' \n').upper()[:12]
    excluded = {str(value).strip() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(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

f70(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

071

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

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

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

072

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

f72([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

073

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

f73(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

074

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

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

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

075

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

    def normalize(value):
        return str(value).strip().upper()
    excluded = {str(value).upper() 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
    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

f75(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

076

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

f76([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

077

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

f77(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

078

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

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

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

079

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

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

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

080

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

f80([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

081

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

082

def f82(board):
    board = list(board)
    known = set()
    pieces = []
    for row in range(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)
            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

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

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

083

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

f83([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

084

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

f84([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

085

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

f85([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

086

def f86(board):
    board = list(board)
    visited = set()
    pieces = []
    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 = []
            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)
            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

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

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

087

def f87(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    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((min(100, right - left) for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output

f87([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

088

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

f88([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

089

def f89(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 = max(-64, min(64, 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 crossings:
                crossings.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

090

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

f90(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

091

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

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

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

092

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

    def tidy(value):
        return str(value).strip(' \n').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f92(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

093

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

f93([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

094

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

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

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

095

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

    def canon(value):
        return str(value).strip(' \n').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
    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

f95(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

096

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

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

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

097

def f97(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(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, 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

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

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

098

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

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

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

099

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

    def normalize(value):
        return str(value).strip(' \n').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
    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

f99(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

100

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

f100([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

101

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

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

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

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

103

def f103(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] < 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
                    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

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

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

104

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

    def tidy(value):
        return ' '.join(str(value).split()).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
    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

f104(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

105

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

f105([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

106

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

107

def f107(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 if normalize(value) != normalize(value) or normalize(value) != ''} - 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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f107(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

108

def f108(board):
    board = list(board)
    known = set()
    pieces = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            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)
            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,0],[0,2],[2,4],[4,5]],"count":4,"filled":14,"sizes":[10,2,1,1]}

109

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

110

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

    def normalize(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).strip() 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

f110(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

111

def f111(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 if normalize(value) != normalize(value) or normalize(value) != ''} - 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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f111(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

112

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

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

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

113

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

f113([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

114

def f114(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' 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 or len(word) > 12:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    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

f114(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

115

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

f115([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

116

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

f116([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

117

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

f117(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

118

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

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

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

119

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

f119([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

120

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

f120([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

121

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

f121([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

122

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

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

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

123

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

f123([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

124

def f124(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels and (not nxt.startswith('Z')):
                    levels[nxt] = levels[cur] + 1
                    queue.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[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

125

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

    def tidy(value):
        return str(value).strip(' \n').upper()
    excluded = {str(value).strip() 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

f125(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

126

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

    def normalize(value):
        return str(value).strip().upper()
    excluded = {str(value).strip() for value in excluded}
    a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - 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((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f126(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

127

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

f127([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

128

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

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

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

129

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

f129([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

130

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

f130([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

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

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

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

132

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

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

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

133

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

f133([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

134

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

135

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

f135([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

136

def f136(board):
    board = list(board)
    visited = set()
    regions = []
    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)
            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

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

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

137

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

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

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

138

def f138(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[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)
            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

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

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

139

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

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

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

140

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

    def canon(value):
        return str(value).strip().upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - excluded
    b = {canon(value) for value in right if canon(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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f140(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

141

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

f141([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

142

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

f142([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

143

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

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

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

144

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

f144([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

145

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

f145([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

146

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

f146([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

147

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

    def normalize(value):
        return str(value).strip(' \r').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
    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

f147(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

148

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

f148([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

149

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

f149([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

150

def f150(board):
    board = list(board)
    visited = set()
    regions = []
    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 = []
            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)
                        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

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

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

151

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

152

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

f152([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

153

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

f153([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

154

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

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

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

155

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

f155([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

156

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

f156(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

157

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

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

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

158

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

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

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

159

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

f159([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

160

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

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

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

161

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

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

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

162

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

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

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

163

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

f163(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

164

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

f164([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

165

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

f165([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

166

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

f166(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

167

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

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

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

168

def f168(board):
    board = list(board)
    found = set()
    pieces = []
    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)
            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

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

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

169

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

f169(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

170

def f170(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[row])):
            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)
                        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

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

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

171

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

f171(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

172

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

f172(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

173

def f173(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}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    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

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

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

174

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

f174([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

175

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

f175(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

176

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

f176(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

177

def f177(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]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output

f177([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

178

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

f178([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

179

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

f179([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

180

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

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

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

181

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

f181([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

182

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

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

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

183

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

f183(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

184

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

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

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

185

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

f185([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

186

def f186(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}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    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

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

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

187

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

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

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

188

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

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

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

189

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

f189(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

190

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

    def canon(value):
        return str(value).strip().upper()[:12]
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - excluded
    b = {canon(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

f190(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

191

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

f191(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

192

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

    def canon(value):
        return str(value).strip().upper()
    excluded = {canon(value) for value in excluded}
    a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - 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

f192(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

193

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

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

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

194

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

195

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

f195([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

196

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

197

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

    def normalize(value):
        return str(value).strip().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

f197(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

198

def f198(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)
    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': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output

f198([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

199

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

f199([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

200

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

f200([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

201

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

f201([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

202

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

f202([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

203

def f203(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} and value >= 0:
            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': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f203([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

204

def f204(board):
    board = list(board)
    found = 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 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)
            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

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

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

205

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

    def canon(value):
        return str(value).strip().upper()
    ignored = {str(value).strip() for value in ignored}
    a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - ignored
    b = {canon(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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f205(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

206

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

f206([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

207

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

f207(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

208

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

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

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

209

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

210

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

f210([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

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)}
    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 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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

212

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

f212([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

213

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

    def tidy(value):
        return str(value).strip(' \r').upper()
    banned = {str(value).strip() 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((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f213(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

214

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

f214(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

215

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

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

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

216

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

f216(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

217

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

f217(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

218

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

f218([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

219

def f219(board):
    board = list(board)
    found = 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 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)
                        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

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

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

220

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

221

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

f221(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

222

def f222(board):
    board = list(board)
    found = 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 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)
            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

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

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

223

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

f223([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

224

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

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

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

225

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

f225([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

226

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

f226([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

227

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

f227(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

228

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

f228(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

229

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

    def normalize(value):
        return str(value).strip(' ').upper()
    banned = {str(value).strip() 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

f229(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

230

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

f230([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

231

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

f231([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

232

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

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

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

233

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

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

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

234

def f234(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 if normalize(value) != normalize(value) or normalize(value) != ''} - excluded
    b = {normalize(value) for value in right if normalize(value) != ''} - 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

f234(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

235

def f235(board):
    board = list(board)
    visited = set()
    pieces = []
    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 = []
            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)
            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

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

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

236

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

f236([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

237

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

f237([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

238

def f238(board):
    board = list(board)
    visited = 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 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)
                        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

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

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

239

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

f239(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

240

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

241

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

f241([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

242

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

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

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

243

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

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

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

244

def f244(board):
    board = list(board)
    found = set()
    pieces = []
    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)
                        if len(found) >= 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

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

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

245

def f245(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = 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': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output

f245([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

246

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

f246([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

247

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

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

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

248

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

    def canon(value):
        return str(value).strip(' \n').upper()
    banned = {canon(value) for value in banned}
    a = {canon(value) for value in left} - banned
    b = {canon(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

f248(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

249

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

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

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

250

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

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

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

251

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

252

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

253

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

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

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

254

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

    def tidy(value):
        return str(value).strip(' ').upper()
    ignored = {str(value).upper() for value in ignored}
    a = {tidy(value) for value in left} - ignored
    b = {tidy(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

f254(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

255

def f255(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] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    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

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

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

256

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

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

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

257

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

f257(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

258

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

f258(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

259

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

f259([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

260

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

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

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

261

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

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

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

262

def f262(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(0, 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': min(100, max((right - left for left, right in result)))}
    output = dict()
    output.update(returnvalue)
    return output

f262([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

263

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

f263([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

264

def f264(board):
    board = list(board)
    visited = 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 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

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

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

265

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

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

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

266

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

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

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

267

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

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

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

268

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

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

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

269

def f269(board):
    board = list(board)
    visited = set()
    pieces = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            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)
                        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

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

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

270

def f270(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(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(min(100, left - combined[pos - 1][1]))
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output

f270([(2, 9), (5, 12), (14, 21), (18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61)], 1)

{"cover":39,"holes":[2,9,3,6],"longest":10,"segments":[[2,12],[14,21],[30,40],[43,53],[59,61]]}

271

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

f271([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

272

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

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

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

273

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

f273(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

274

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

f274([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

275

def f275(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 = []
            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)
            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

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

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

276

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

f276([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

277

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

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

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

278

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

279

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

f279([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

280

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

    def tidy(value):
        return ' '.join(str(value).split()).upper()
    excluded = {str(value).strip() for value in excluded}
    a = {tidy(value) for value in left} - excluded
    b = {tidy(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

f280(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

281

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

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

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

282

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

f282(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

283

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

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

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

284

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

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

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

285

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

f285([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

286

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

287

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

f287([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

288

def f288(board):
    board = list(board)
    visited = 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 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)
                        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

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

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

289

def f289(board):
    board = list(board)
    visited = set()
    regions = []
    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)
                        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

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

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

290

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

f290([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

291

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

f291([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

292

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

f292(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

293

def f293(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 = []
            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)
                        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

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

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

294

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

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

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

295

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

f295([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

296

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

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

{"bounds":[-4,-1,1,4],"end":[-4,1],"far":5,"revisits":[[1,0],[1,1],[-1,3],[0,1],[0,0]],"steps":27}

297

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

f297(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

298

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

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

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

299

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

f299([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

300

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

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

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

301

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

    def normalize(value):
        return str(value).strip(' ').upper()
    excluded = {str(value).strip() 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

f301(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNET', 'heliumx', 'BLUE', 'cyan '], ['CYAN'])

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

302

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

f302([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

303

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

f303([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})

{"accepted":6,"groups":{"edge":144,"north":42,"south":125},"top":["CX04","BR78","CX26"],"total":311}

304

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

f304([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

305

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

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

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

306

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

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

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

307

def f307(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]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output

f307([('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["BR",124],["GQ",76],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":410}

308

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

f308([(2, 9), (5, 12), (14, 21), (18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61)], 1)

{"cover":40,"holes":[2,7,4,6],"longest":12,"segments":[[2,12],[14,21],[28,40],[44,53],[59,61]]}

309

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

f309(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

310

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

f310([('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18), ('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":6,"groups":{"edge":240,"north":42,"south":125},"top":["BR78","CX26","CX04"],"total":407}

311

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

f311(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

312

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

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

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

313

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

f313(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['ember', 'frost'])

{"counts":{"amber":3,"blue":3,"cyan":3,"delta":2,"helium":5},"initials":{"a":3,"b":3,"c":3,"d":2,"h":5},"size":79,"top":["helium","amber","blue","cyan","delta"]}

314

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

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

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

315

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

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

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

316

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

f316([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

317

def f317(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 = []
            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)
            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

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

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

318

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

    def tidy(value):
        return str(value).strip(' \n').upper()
    ignored = {tidy(value) for value in ignored}
    a = {tidy(value) for value in left} - ignored
    b = {tidy(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

f318(['ivory', 'helium', ' Amber', 'frost', 'GARNET', 'delta', 'cyan '], ['ivory', 'delta', 'cyan ', 'GARNETx', 'helium', 'BLUE', 'cyan '], ['CYAN'])

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

319

def f319(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[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        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

f319(['Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium', 'Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'], ['delta', 'ember'])

{"counts":{"amber":3,"blue":3,"cyan":3,"frost":7,"helium":5},"initials":{"a":3,"b":3,"c":3,"f":7,"h":5},"size":104,"top":["frost","helium","amber","blue","cyan"]}

320

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

f320([('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5), ('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6)], [('AN', 7), ('BR', 8), ('DL', 10), ('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)], 4)

{"count":7,"items":[["GQ",121],["BR",100],["AN",60],["DL",54],["EV",40]],"missing":["CX"],"total":431}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
lines = list(('Ember, ember. ember frost', 'Blue, amber. amber frost cyan', 'Frost, ember. blue helium', 'Amber, frost. frost helium helium') + ('Delta, helium. frost blue', 'Ember, helium. delta cyan frost', 'Ember, cyan. ember ember'))
stop = list(('delta',) + ('ember',))
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
permit = record['dd']
route = permit
cases = {
    79: list(('..##..', '#.....', '##..#.') + ('####..', '#..#.#', '...#..')),
    104: 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)}
signal = record['dd']
route = permit
cases = {
    104: list((('N', 1), ('E', 1), ('S', 2), ('N', 3), ('N', 2), ('W', 2), ('S', 1)) + (('W', 1), ('E', 2), ('S', 3), ('N', 2), ('W', 2), ('S', 1), ('W', 1), ('E', 1), ('N', 1))),
    79: list((('N', 1), ('E', 1), ('S', 2), ('N', 3), ('N', 2), ('W', 2), ('S', 1)) + (('W', 1), ('E', 2), ('S', 3), ('N', 2), ('W', 2), ('S', 1), ('W', 1), ('E', 1), ('W', 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}
token = record['ee']
rows = list((('DL56', 'south', 'ready', 10), ('AN93', 'north', 'checked', 6), ('CX30', 'south', 'void', 12), ('BR67', 'south', 'hold', 3), ('CX04', 'south', 'ready', 15), ('DL41', 'core', 'hold', 4), ('BR78', 'edge', 'ready', 21), ('AN15', 'north', 'hold', 18)) + (('BR52', 'core', 'hold', 23), ('AN89', 'edge', 'void', 14), ('CX26', 'edge', 'checked', 17), ('AN63', 'edge', 'hold', 13), ('AN00', 'edge', 'ready', 10), ('BR37', 'north', 'void', 16)))
keep = list(('ready',) + ('checked',))
options = {
    104: ('near', signal),
    79: ('far', token),
}
route = options[permit]
cases = {
    ('near', 5): dict((('north', 7), ('south', 5), ('core', 11)) + (('edge', 5),)),
    ('near', 4): dict((('north', 7), ('south', 5), ('core', 12)) + (('edge', 3),)),
    ('far', 26): dict((('north', 7), ('south', 5), ('core', 12)) + (('edge', 3),)),
    ('far', 27): dict((('north', 7), ('south', 5), ('core', 12)) + (('edge', 3),)),
}
rates = 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}
memo = record['bb']
right = list((('AN', 7), ('BR', 8), ('DL', 10)) + (('EV', 6), ('FP', 9), ('GQ', 9), ('HR', 5)))
fee = 4
route = token
cases = {
    26: list((('AN', 8), ('BR', 12), ('CX', 9), ('DL', 5)) + (('EV', 6), ('FP', 2), ('GQ', 13), ('HR', 6))),
    27: list((('AN', 8), ('BR', 15), ('CX', 9), ('DL', 5)) + (('EV', 6), ('FP', 2), ('GQ', 8), ('HR', 6))),
}
left = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
clue = record['bb']
gap = 1
route = (memo, clue)
cases = {
    (311, 410): list(((2, 9), (5, 12), (14, 21)) + ((18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61))),
    (311, 431): list(((2, 9), (5, 12), (14, 21)) + ((18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61))),
    (407, 410): list(((2, 9), (5, 12), (14, 21)) + ((18, 21), (30, 34), (33, 40), (43, 50), (48, 53), (59, 61))),
    (407, 431): list(((2, 9), (5, 12), (14, 21)) + ((18, 21), (28, 32), (33, 40), (44, 51), (48, 53), (59, 61))),
}
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))}
stamp = record['cc']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G')) + (('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
limit = 3
route = stamp
cases = {
    40: 'A',
    39: 'D',
}
start = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
ticket = record['dd']
left = list(('ivory', 'helium', ' Amber') + ('frost', 'GARNET', 'delta', 'cyan '))
blocked = ['CYAN']
route = ticket
cases = {
    5: list(('ivory', 'delta', 'cyan ') + ('GARNET', 'heliumx', 'BLUE', 'cyan ')),
    8: list(('ivory', 'delta', 'cyan ') + ('GARNETx', 'helium', 'BLUE', 'cyan ')),
}
right = 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))