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

001

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

002

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

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

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

003

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

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

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

004

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

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

f4(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

005

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

006

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

f6([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

007

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

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

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

008

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

f8([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

009

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

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

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

010

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

f10([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

011

def f11(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(min(64, len(values) - size + 1)):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value >= limit]
    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

f11([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

012

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

f12([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

013

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

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

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

014

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

f14([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

015

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

016

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

f16([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

017

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

f17([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

018

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

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

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

019

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

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

f19(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

020

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

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

f20(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

021

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

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

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

022

def f22(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)
    handled = set()
    result = []
    groups = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

023

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

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

f23(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

024

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

025

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

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

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

026

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

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

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

027

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

028

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

f28([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

029

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

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

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

030

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

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

f30(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

031

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

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

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

032

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

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

f32(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

033

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

034

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

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

f34(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

035

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

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

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

036

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

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

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

037

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

f37([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

038

def f38(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:
        if word in stop or len(word) > 12:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    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

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

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

039

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

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

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

040

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

f40([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

041

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

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

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

042

def f42(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)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

043

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

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

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

044

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

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

f44(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

045

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

f45(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

046

def f46(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    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

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

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

047

def f47(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)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in 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

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

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

048

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

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

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

049

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

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

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

050

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

f50([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

051

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

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

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

052

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

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

f52(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

053

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

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

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

054

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

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

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

055

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

056

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

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

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

057

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

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

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

058

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

f58([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

059

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

f59([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

060

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

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

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

061

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

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

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

062

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

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

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

063

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

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

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

064

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

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

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

065

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

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

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

066

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

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

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

067

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

f67([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

068

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

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

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

069

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

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

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

070

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

071

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

f71([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

072

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

f72([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

073

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

f73([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

074

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

f74([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

075

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

f75([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

076

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

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

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

077

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

078

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

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

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

079

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

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

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

080

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

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

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

081

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

f81([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

082

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

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

f82(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

083

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

f83([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

084

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

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

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

085

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

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

f85(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

086

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

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

f86(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

087

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

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

f87(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

088

def f88(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' 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
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output

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

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

089

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

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

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

090

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

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

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

091

def f91(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
    initial = dict(indegree)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

092

def f92(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    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

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

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

093

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

094

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

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

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

095

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

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

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

096

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

097

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

f97([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

098

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

f98([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

099

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

f99([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

100

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

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

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

101

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

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

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

102

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

f102([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

103

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

104

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

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

f104(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

105

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

f105([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

106

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

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

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

107

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

f107([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

108

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

f108([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

109

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

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

f109(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

110

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

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

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

111

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

f111([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

112

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

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

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

113

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

f113([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

114

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

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

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

115

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

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

f115(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

116

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

f116([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

117

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

f117([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

118

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

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

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

119

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

f119([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

120

def f120(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    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))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in 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

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

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

121

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

f121([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

122

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

123

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

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

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

124

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

f124([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

125

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

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

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

126

def f126(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()
    result = []
    groups = []
    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[: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 children[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

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

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

127

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

f127([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

128

def f128(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
    startdegree = dict(incoming)
    handled = set()
    listing = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

129

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

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

f129(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

130

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

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

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

131

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

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

f131(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

132

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

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

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

133

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

f133([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

134

def f134(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 or len(word) < 2:
            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

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

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

135

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

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

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

136

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

137

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

138

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

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

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

139

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

140

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

f140([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

141

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

142

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

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

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

143

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

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

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

144

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

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

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

145

def f145(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 = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not available:
            break
        current = available
        groups.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': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

146

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

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

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

147

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

148

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

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

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

149

def f149(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, 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

f149([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

150

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

f150([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

151

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

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

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

152

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

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

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

153

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

154

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

f154([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

155

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

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

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

156

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

157

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

158

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

f158([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

159

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

160

def f160(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    result = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=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:
            finished.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 rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

161

def f161(board):
    board = list(board)
    found = set()
    pieces = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if col >= 12 or board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            work = [(row, col)]
            found.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
                        found.add(nxt)
                        if len(found) >= 100:
                            continue
                        work.append(nxt)
            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

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

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

162

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

163

def f163(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(min(100, 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

f163([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

164

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

f164([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

165

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

166

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

f166(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

167

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

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

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

168

def f168(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)
    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), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            handled.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

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

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

169

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

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

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

170

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

f170([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

171

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

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

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

172

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

f172([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

173

def f173(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        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 rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

174

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

f174([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

175

def f175(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' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    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

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

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

176

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

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

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

177

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

f177([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

178

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

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

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

179

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

f179([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

180

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

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

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

181

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

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

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

182

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

183

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

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

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

184

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

f184(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

185

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

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

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

186

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

f186([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

187

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

f187(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

188

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

189

def f189(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    listing = []
    layers = []
    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
        layers.append(current)
        for node in current:
            complete.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 rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

190

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

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

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

191

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

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

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

192

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

f192([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

193

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

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

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

194

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

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

f194(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

195

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

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

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

196

def f196(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=any((str(node).isupper() for node in nodes)))
        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

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

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

197

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

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

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

198

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

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

f198(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

199

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

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

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

200

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

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

f200(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

201

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

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

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

202

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

f202([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

203

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

204

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

f204([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

205

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

f205([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

206

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

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

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

207

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

f207([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

208

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

f208([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

209

def f209(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    listing = []
    groups = []
    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
        groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

210

def f210(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)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        available = sorted((node for node in nodes if needs[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
        layers.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': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

211

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

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

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

212

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

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

f212(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

213

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

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

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

214

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

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

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

215

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

f215([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

216

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

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

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

217

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

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

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

218

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

219

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

220

def f220(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:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    result = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        rounds.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': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

221

def f221(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    complete = set()
    listing = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            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

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

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

222

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

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

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

223

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

f223([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

224

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

225

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

f225([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

226

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

f226(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

227

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

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

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

228

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

f228([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

229

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

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

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

230

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

231

def f231(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)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

232

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

233

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

234

def f234(board):
    board = list(board)
    known = set()
    regions = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[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)
            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

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

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

235

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

f235([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

236

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

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

f236(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

237

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

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

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

238

def f238(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()
    result = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

239

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

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

f239(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

240

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

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

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

241

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

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

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

242

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

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

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

243

def f243(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)
    handled = set()
    listing = []
    groups = []
    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
        groups.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

244

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

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

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

245

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

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

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

246

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

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

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

247

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

f247([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

248

def f248(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(min(100, 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

f248([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

249

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

f249([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

250

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

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

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

251

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

f251([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

252

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

f252([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

253

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

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

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

254

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

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

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

255

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

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

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

256

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

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

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

257

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

f257(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

258

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

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

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

259

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

f259(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

260

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

f260([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

261

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

f261([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

262

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

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

f262(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

263

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

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

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

264

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

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

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

265

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

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

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

266

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

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

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

267

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

f267([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

268

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

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

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

269

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

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

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

270

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

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

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

271

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

f271([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

272

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

273

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

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

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

274

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

f274([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

275

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

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

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

276

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

277

def f277(board):
    board = list(board)
    visited = set()
    components = []
    for row in range(len(board)):
        for col in range(min(len(board[row]), 10)):
            if board[row][col] != '#' or (row, col) in visited:
                continue
            cells = []
            pending = [(row, col)]
            visited.add((row, col))
            while pending:
                cur = pending.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
                        visited.add(nxt)
                        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

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

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

278

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

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

f278(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

279

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

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

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

280

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

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

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

281

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

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

f281(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

282

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

f282([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

283

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

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

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

284

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

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

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

285

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

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

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

286

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

287

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

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

f287(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

288

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

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

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

289

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

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

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

290

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

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

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

291

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

f291([18, 16, 15, 22, 13, 18, 8, 18, 21, 9, 10, 22, 9, 15, 7], 4, 70)

{"best":71,"hits":[0],"rises":5,"sums":[71,66,68,61,57,65,56,58,62,50,56,53]}

292

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

f292([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

293

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

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

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

294

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

295

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

296

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

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

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

297

def f297(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
    initial = dict(indegree)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

298

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

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

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

299

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

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

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

300

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

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

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

301

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

f301(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

302

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

f302([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 1)

{"cover":33,"holes":[3,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

303

def f303(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    growth = sum((1 for pos in range(1, 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

f303([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

304

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

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

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

305

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

f305([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

306

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

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

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

307

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

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

{"bounds":[-8,0,0,13],"end":[-6,13],"far":21,"revisits":[[-6,4],[-7,4],[-6,13]],"steps":27}

308

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

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

{"bounds":[-7,0,0,11],"end":[-5,8],"far":18,"revisits":[[-6,4],[-7,4],[-7,10],[-7,9],[-7,8]],"steps":27}

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(['Ember, frost. amber frost', 'Cyan, ember. amber delta garnet', 'Ember, amber. frost blue', 'Frost, helium. helium blue blue', 'Garnet, garnet. garnet cyan vivid', 'Frost, blue. amber amber helium', 'Blue, helium. helium helium'], ['frost'])

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

310

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

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

f310(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

311

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

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

f311(['helium', 'GARNET', 'Ember', 'deltax', 'ivory', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

312

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

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

f312(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

313

def f313(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((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f313([18, 16, 15, 22, 16, 18, 8, 18, 21, 9, 6, 22, 9, 15, 7], 4, 71)

{"best":71,"hits":[0,2],"rises":5,"sums":[71,69,71,64,60,65,56,54,58,46,52,53]}

314

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

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

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

315

def f315(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    listing = []
    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)
            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 startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

316

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

f316([(2, 8), (5, 11), (14, 17), (18, 22), (28, 30), (33, 37), (43, 45), (48, 54), (59, 61)], 0)

{"cover":32,"holes":[3,1,6,3,6,3,5],"longest":9,"segments":[[2,11],[14,17],[18,22],[28,30],[33,37],[43,45],[48,54],[59,61]]}

317

def f317(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch[: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 nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

318

def f318(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
    rootsource = dict(incoming)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

319

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

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

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

320

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

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

f320(['helium', 'GARNET', 'Ember', 'delta', 'ivoryx', 'frost', 'Ember'], ['BLUE', 'Ember', 'ivory', 'delta', ' Amber', 'helium', 'Ember'], ['EMBER'])

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

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
moves = list((('W', 3), ('W', 1), ('N', 3), ('N', 1), ('W', 3), ('E', 1), ('W', 1), ('N', 3)) + (('N', 2), ('W', 1), ('N', 1), ('N', 3), ('E', 1), ('E', 2), ('W', 1)))
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
badge = record['bb']
width = 4
route = badge
cases = {
    21: (list((18, 16, 15, 22, 13, 18, 8) + (18, 21, 9, 10, 22, 9, 15, 7)), 70),
    18: (list((18, 16, 15, 22, 16, 18, 8) + (18, 21, 9, 6, 22, 9, 15, 7)), 71),
}
values, limit = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
permit = record['dd'][1]
route = badge
cases = {
    18: list(('.#.#.#', '....#.') + ('.###..', '...#..', '.#....', '.##.#.')),
    21: list(('.#.#.#', '....#.') + ('.###..', '#..#..', '#.....', '..#.#.')),
}
board = cases[route]
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
signal = record['dd']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G')) + (('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
limit = 3
options = {
    21: ('near', permit),
    18: ('far', signal),
}
route = options[badge]
cases = {
    ('near', 66): 'A',
    ('near', 69): 'D',
    ('far', 8): 'D',
    ('far', 7): 'D',
}
start = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
token = record['dd']
spans = list(((2, 8), (5, 11), (14, 17), (18, 22)) + ((28, 30), (33, 37), (43, 45), (48, 54), (59, 61)))
route = signal
cases = {
    7: 0,
    8: 1,
}
gap = 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))}
memo = record['cc']
right = list(('BLUE', 'Ember') + ('ivory', 'delta', ' Amber', 'helium', 'Ember'))
blocked = ['EMBER']
route = (token, memo)
cases = {
    (8, 33): list(('helium', 'GARNET') + ('Ember', 'deltax', 'ivory', 'frost', 'Ember')),
    (8, 32): list(('helium', 'GARNET') + ('Ember', 'delta', 'ivoryx', 'frost', 'Ember')),
    (5, 33): list(('helium', 'GARNET') + ('Ember', 'delta', 'ivoryx', 'frost', 'Ember')),
    (5, 32): list(('helium', 'GARNET') + ('Ember', 'delta', 'ivoryx', 'frost', 'Ember')),
}
left = 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))}
clue = record['aa'][0]
nodes = list(('worker', 'ui', 'proxy', 'auth', 'jobs') + ('api', 'cache', 'db'))
route = clue
cases = {
    'DELTA': list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth'))),
    'HELIUM': list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache'))),
}
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)}
stamp = record['aa'][0]
stop = ['frost']
route = stamp
cases = {
    'auth': list(('Ember, frost. amber frost', 'Cyan, ember. amber delta garnet', 'Ember, amber. frost blue') + ('Frost, helium. helium blue blue', 'Garnet, garnet. garnet cyan vivid', 'Frost, blue. amber amber helium', 'Blue, helium. helium helium')),
    'cache': list(('Ember, frost. amber frost', 'Cyan, ember. amber delta garnet', 'Ember, amber. frost blue') + ('Frost, helium. helium blue blue', 'Garnet, garnet. garnet cyan', 'Frost, blue. amber amber helium', 'Blue, helium. helium helium quartz')),
}
lines = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))