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

001

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

f1([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

002

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

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

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

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

003

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

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

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

004

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

f4([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

005

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

f5([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

006

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

f6([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

007

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

f7([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

008

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

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

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

009

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

f9(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

010

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

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

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

011

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

f11([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

012

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

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

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

013

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

f13([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

014

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

f14(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

015

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

f15([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

016

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

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

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

017

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

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

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

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

018

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

f18(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

019

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

f19([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

020

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

f20(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

021

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

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

f21(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

022

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

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

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

023

def f23(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + max(0, gap):
            result.append([left, right])
        else:
            result[-1][1] = right
    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([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

024

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

025

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

026

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

f26([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

027

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

f27([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

028

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

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

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

029

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

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

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

030

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

f30([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

031

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

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

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

032

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

f32(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

033

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

f33([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

034

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

f34([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

035

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

f35([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

036

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

f36([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

037

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

f37([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

038

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

f38(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

039

def f39(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            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

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

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

040

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

f40([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

041

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

f41([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

042

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

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

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

043

def f43(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' 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
        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

f43(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

044

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

f44([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

045

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

f45([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

046

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

f46([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

047

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

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

f47(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

048

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

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

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

049

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

f49(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

050

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

f50(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

051

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

f51([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

052

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

053

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

f53([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

054

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

f54([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

055

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

056

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

f56([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

057

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

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

f57(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

058

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

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

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

059

def f59(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 % 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

f59([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

060

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

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

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

061

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

062

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

f62([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

063

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

f63([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

064

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

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

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

065

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

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

f65(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

066

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

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

f66(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

067

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

f67([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

068

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

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

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

069

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

f69(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

070

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

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

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

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

071

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

f71([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

072

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

f72([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

073

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

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

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

074

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

    def normalize(value):
        return str(value).strip(' \r').upper()
    excluded = {str(value).upper() for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right} - excluded
    both = a & b
    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

f74(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

075

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

076

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

f76([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

077

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

f77(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

078

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

f78([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

079

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

f79([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

080

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

f80([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

081

def f81(rows, keep, factors):
    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:
            cost = value * factors[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': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f81([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

082

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

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

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

083

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

f83([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

084

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

f84([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

085

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

f85(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

086

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

f86(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

087

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

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

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

088

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

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

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

089

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

090

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

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

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

091

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

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

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

092

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

f92([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

093

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

f93([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

094

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

f94([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

095

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

    def canon(value):
        return str(value).strip(' ').upper()[:12]
    excluded = {str(value).strip() 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(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

096

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

f96([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

097

def f97(board):
    board = list(board)
    visited = set()
    regions = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            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)
            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

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

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

098

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

f98([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

099

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

f99([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

100

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

f100([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

101

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

f101([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

102

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

f102([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

103

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

f103(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

104

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

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

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

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

105

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

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

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

106

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

f106([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

107

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

108

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

109

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

110

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

f110([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

111

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

f111(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

112

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

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

f112(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

113

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

f113([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

114

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

f114([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

115

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

116

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

f116([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

117

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

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

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

118

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

f118(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

119

def f119(board):
    board = list(board)
    visited = set()
    pieces = []
    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)
                        if len(visited) >= 100:
                            continue
                        queue.append(nxt)
            pieces.append((len(cells), min(cells)))
    pieces.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

120

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

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

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

121

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

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

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

122

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

f122(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

123

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

f123(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

124

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

f124([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

125

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

f125([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

126

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

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

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

127

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

f127(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

128

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

f128([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

129

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

f129([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

130

def f130(rows, keep, factors):
    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 * abs(factors[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': [code for code, charge in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f130([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

131

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

f131([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

132

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

133

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

f133(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

134

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

f134([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

135

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

f135([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

136

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

f136([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

137

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

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

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

138

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

f138(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

139

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

f139([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

140

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

f140(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

141

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

f141(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

142

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

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

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

143

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

f143([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

144

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

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

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

145

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

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

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

146

def f146(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)
                        if len(found) >= 100:
                            continue
                        queue.append(nxt)
            components.append((len(cells), min(cells)))
    components.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

147

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

f147([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

148

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

f148(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

149

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

f149([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

150

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

f150([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

151

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

f151([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

152

def f152(board):
    board = list(board)
    visited = set()
    regions = []
    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)
            regions.append((len(cells), min(cells)))
    regions.sort(key=lambda item: (-item[0], item[1]))
    returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

153

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

f153(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

154

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

155

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

f155([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

156

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

f156([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

157

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

    def tidy(value):
        return str(value).strip().upper()[:12]
    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
    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

f157(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

158

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

f158([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

159

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

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

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

160

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

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

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

161

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

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

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

162

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

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

f162(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

163

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

f163(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

164

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

f164([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

165

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

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

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

166

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

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

f166(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

167

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

f167([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

168

def f168(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} - 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

f168(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

169

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

f169([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

170

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

f170(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

171

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

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

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

172

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

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

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

173

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

f173([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

174

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

f174([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

175

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

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

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

176

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

f176([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

177

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

f177([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

178

def f178(rows, keep, prices):
    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 * prices[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

f178([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

179

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

f179(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

180

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

f180([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

181

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

f181([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

182

def f182(board):
    board = list(board)
    known = set()
    regions = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            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)
            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

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

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

183

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

f183(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

184

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

f184([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

185

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

f185([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

186

def f186(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)
                        if len(known) >= 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

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

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

187

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

f187([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

188

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

f188([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

189

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

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

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

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

190

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

f190([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

191

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

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

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

192

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

f192([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

193

def f193(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            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

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

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

194

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

f194([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

195

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

f195([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

196

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

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

f196(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

197

def f197(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 = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 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

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

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

198

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

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

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

199

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

f199([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

200

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

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

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

201

def f201(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 board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 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

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

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

202

def f202(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            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

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

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

203

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

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

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

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

204

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

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

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

205

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

f205([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

206

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

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

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

207

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

f207(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

208

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

f208([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

209

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

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

f209(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

210

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

f210([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

211

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

f211([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

212

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

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

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

213

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

f213([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

214

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

f214([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

215

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

f215([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

216

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

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

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

217

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

f217([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

218

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

f218(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

219

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

f219([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

220

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

    def normalize(value):
        return str(value).strip(' \n').upper()
    excluded = {normalize(value) for value in excluded}
    a = {normalize(value) for value in left} - excluded
    b = {normalize(value) for value in right if normalize(value) != ''} - excluded
    both = a & b
    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

f220(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

221

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

f221([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

222

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

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

f222(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

223

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

f223([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

224

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

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

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

225

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

f225([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

226

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

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

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

227

def f227(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((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

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

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

228

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

f228([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

229

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

230

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

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

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

231

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

    def canon(value):
        return str(value).strip().upper()[:12]
    banned = {str(value).upper() for value in banned}
    a = {canon(value) for value in left} - banned
    b = {canon(value) for value in right} - banned
    both = a & b
    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

f231(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

232

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

f232([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

233

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

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

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

234

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

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

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

235

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

f235(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

236

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

f236(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

237

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

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

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

238

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

f238([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

239

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

f239([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

240

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

f240([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

241

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

f241(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

242

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

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

f242(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

243

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

f243(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

244

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

f244([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

245

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

246

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

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

f246(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

247

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

f247([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

248

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

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

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

249

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

f249(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

250

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

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

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

251

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

f251([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

252

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

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

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

253

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

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

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

254

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

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

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

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

255

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

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

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

256

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

f256([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

257

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

f257([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

258

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

f258([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

259

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

f259([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

260

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

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

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

261

def f261(board):
    board = list(board)
    known = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            queue = [(row, col)]
            known.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        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

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

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

262

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

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

f262(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

263

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

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

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

264

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

f264([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

265

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

f265(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

266

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

f266([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

267

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

f267([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

268

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

f268([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

269

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

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

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

270

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

271

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

272

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

f272([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

273

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

f273([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

274

def f274(board):
    board = list(board)
    found = set()
    regions = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if 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)
                        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

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

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

275

def f275(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * factors[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(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

f275([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

276

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

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

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

277

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

f277([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

278

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

f278(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

279

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

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

f279(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

280

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

f280([('AN', 10), ('BR', 10), ('CX', 9), ('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)], [('AN', 9), ('CX', 10), ('FP', 9), ('GQ', 5)], 3)

{"count":4,"items":[["AN",93],["CX",93],["GQ",43],["FP",21]],"missing":["BR","DL","EV","HR"],"total":250}

281

def f281(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            cost = value * abs(ratemap[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

f281([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":130,"south":85},"top":["CX13","CX83","CX61"],"total":628}

282

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

283

def f283(board):
    board = list(board)
    known = 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 known:
                continue
            cells = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        work.append(nxt)
            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

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

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

284

def f284(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} - 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

f284(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

285

def f285(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            queue = [(row, col)]
            known.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        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

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

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

286

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

f286(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

287

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

f287([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

288

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

f288([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

289

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

f289([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

290

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

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

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

291

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

f291(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Emberx', 'delta', 'frost', 'cyan '], ['CYAN'])

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

292

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

293

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

f293([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

294

def f294(board):
    board = list(board)
    found = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[row])):
            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

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

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

295

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

f295(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

296

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

f296(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

297

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

f297([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

298

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

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

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

299

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

f299([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

300

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

f300([('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13), ('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":374,"edge":39,"north":91,"south":153},"top":["DL98","CX13","CX83"],"total":657}

301

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

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

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

302

def f302(board):
    board = list(board)
    known = set()
    components = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 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

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

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

303

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

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

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

304

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

f304(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

305

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

f305(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

306

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

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

{"count":4,"items":[["AN",94],["CX",94],["GQ",44],["FP",22]],"missing":["BR","DL","EV","HR"],"total":254}

307

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

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

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

308

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

f308([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

309

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

f309(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['amber', 'blue'])

{"counts":{"cyan":9,"delta":4,"ember":5,"frost":1,"garnet":1,"helium":3},"initials":{"c":9,"d":4,"e":5,"f":1,"g":1,"h":3},"size":110,"top":["cyan","ember","delta","helium","frost"]}

310

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

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

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

311

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

f311([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 6, 44)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8,9],"rises":3,"sums":[97,86,97,97,107,96,96,102,95,91]}

312

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

f312(['Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan', 'Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'], ['delta', 'ember'])

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

313

def f313(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[0])):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            work = [(row, col)]
            visited.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        work.append(nxt)
            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

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

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

314

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

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

f314(['Ember', 'ivory', ' Amber', 'BLUE', 'GARNET', 'delta', 'cyan '], ['ivory', 'GARNET', 'helium', 'Ember', 'deltax', 'frost', 'cyan '], ['CYAN'])

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

315

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

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

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

316

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

f316([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

317

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

f317([(3, 6), (6, 8), (15, 21), (19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64)], 2)

{"cover":38,"holes":[7,6,5,5],"longest":11,"segments":[[3,8],[15,25],[31,39],[44,55],[60,64]]}

318

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

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

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

319

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

f319([24, 9, 14, 9, 21, 20, 13, 20, 14, 19, 10, 20, 19, 13, 10], 4, 44)

{"best":74,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":3,"sums":[56,53,64,63,74,67,66,63,63,68,62,62]}

320

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

f320([(3, 6), (6, 8), (15, 21), (19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64)], 2)

{"cover":36,"holes":[7,4,3,6,5],"longest":10,"segments":[[3,8],[15,25],[29,31],[34,39],[45,55],[60,64]]}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
values = list((24, 9, 14, 9, 21, 20, 13, 20) + (14, 19, 10, 20, 19, 13, 10))
width = 6
limit = 44
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
badge = record['bb']
nodes = list(('worker', 'auth', 'api', 'jobs') + ('cache', 'db', 'proxy', 'ui'))
route = badge
cases = {
    107: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui'))),
    74: list((('auth', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
permit = record['aa'][3]
left = list((('AN', 10), ('BR', 10), ('CX', 9)) + (('DL', 5), ('EV', 3), ('FP', 2), ('GQ', 8), ('HR', 6)))
right = list((('AN', 9),) + (('CX', 10), ('FP', 9), ('GQ', 5)))
route = permit
cases = {
    'api': 4,
    'proxy': 3,
}
fee = 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)}
signal = record['bb']
lines = list(('Cyan, helium. delta cyan', 'Cyan, delta. cyan amber delta', 'Cyan, ember. blue cyan', 'Blue, cyan. ember blue cyan') + ('Helium, cyan. delta blue', 'Ember, amber. helium frost ember', 'Garnet, amber. blue ember'))
route = signal
cases = {
    250: list(('amber',) + ('blue',)),
    254: list(('delta',) + ('ember',)),
}
stop = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
token = record['dd']
left = list(('Ember', 'ivory', ' Amber') + ('BLUE', 'GARNET', 'delta', 'cyan '))
blocked = ['CYAN']
route = permit
cases = {
    'api': list(('ivory', 'GARNET', 'helium') + ('Ember', 'deltax', 'frost', 'cyan ')),
    'proxy': list(('ivory', 'GARNET', 'helium') + ('Emberx', 'delta', 'frost', '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))}
memo = record['aa'][0]
gap = 2
route = (token, memo)
cases = {
    (110, 'DELTA'): list(((3, 6), (6, 8), (15, 21)) + ((19, 25), (29, 31), (34, 39), (45, 51), (49, 55), (60, 64))),
    (110, 'EMBER'): list(((3, 6), (6, 8), (15, 21)) + ((19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64))),
    (100, 'DELTA'): list(((3, 6), (6, 8), (15, 21)) + ((19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64))),
    (100, 'EMBER'): list(((3, 6), (6, 8), (15, 21)) + ((19, 25), (31, 33), (34, 39), (44, 50), (49, 55), (60, 64))),
}
spans = cases[route]
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
clue = record['cc']
rows = list((('AN02', 'core', 'void', 11), ('BR39', 'north', 'void', 6), ('AN76', 'edge', 'ready', 9), ('CX13', 'core', 'ready', 12), ('AN50', 'core', 'ready', 10), ('DL87', 'south', 'void', 4), ('CX24', 'south', 'void', 16), ('CX61', 'north', 'checked', 13)) + (('DL98', 'south', 'checked', 17), ('BR35', 'south', 'void', 23), ('CX72', 'core', 'void', 20), ('AN09', 'edge', 'ready', 4), ('CX46', 'core', 'hold', 7), ('CX83', 'core', 'ready', 12)))
keep = list(('ready',) + ('checked',))
route = clue
cases = {
    38: dict((('north', 10), ('south', 5), ('core', 11)) + (('edge', 3),)),
    36: dict((('north', 7), ('south', 9), ('core', 11)) + (('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}
stamp = record['bb']
route = stamp
cases = {
    657: list(('..#..#', '#...#.', '....##') + ('##....', '.#.#.#', '#..#..')),
    628: 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)}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))