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

001

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

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

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

002

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

f2([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

003

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

f3([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

004

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

f4([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

005

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

006

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

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

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

007

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

f7([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

008

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

f8([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

009

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

f9([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

010

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

f10([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

011

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

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

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

012

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

f12([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

013

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

f13([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

014

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

f14([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

015

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

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

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

016

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

f16([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

017

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

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

f17(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

018

def f18(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = 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 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)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[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

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

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

019

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

020

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

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

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

021

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

f21([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

022

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

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

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

023

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

024

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

f24([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

025

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

f25([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

026

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

f26([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

027

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

028

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

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

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

029

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

f29([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

030

def f30(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
    initial = dict(incoming)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        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 initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

031

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

f31([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

032

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

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

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

033

def f33(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    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))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

034

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

f34([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

035

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

036

def f36(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)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            complete.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

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

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

037

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

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

f37(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

038

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

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

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

039

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

f39([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

040

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

f40([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

041

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

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

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

042

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

043

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

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

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

044

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

f44([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

045

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

f45([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

046

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

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

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

047

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

f47(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

048

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

049

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

f49([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

050

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

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

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

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

051

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

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

f51(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

052

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

053

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

054

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

055

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

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

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

056

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

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

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

057

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

f57([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

058

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

059

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

f59([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

060

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

f60([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

061

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

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

f61(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

062

def f62(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 = {str(value).upper() 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

f62(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

063

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

f63([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

064

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

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

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

065

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

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

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

066

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

f66([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

067

def f67(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[: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([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

068

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

069

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

f69([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

070

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

f70([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

071

def f71(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 (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    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

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

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

072

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

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

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

073

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

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

f73(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

074

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

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

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

075

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

f75([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

076

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

077

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

f77([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

078

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

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

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

079

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

f79([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

080

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

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

f80(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

081

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

f81([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

082

def f82(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), 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)
            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 startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

083

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

f83([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

084

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

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

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

085

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

f85([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

086

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

087

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

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

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

088

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

f88([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

089

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

f89([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

090

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

f90([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

091

def f91(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 = {str(value).upper() 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

f91(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

092

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

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

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

093

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

f93([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

094

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

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

f94(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

095

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

096

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

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

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

097

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

f97([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

098

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

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

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

099

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

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

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

100

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

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

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

101

def f101(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 = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

102

def f102(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
    startdegree = dict(incoming)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else 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 startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

103

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

104

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

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

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

105

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

f105([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

106

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

f106([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

107

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

f107([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

108

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

f108([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

109

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

f109([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

110

def f110(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(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)]
    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

f110([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

111

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

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

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

112

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

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

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

113

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

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

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

114

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

115

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

f115([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

116

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

f116([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

117

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

f117([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

118

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

119

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

f119([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

120

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

121

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

122

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

123

def f123(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
    startdegree = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[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

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

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

124

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

125

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

126

def f126(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    complete = set()
    sequence = []
    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)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

127

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

128

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

f128([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

129

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

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

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

130

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

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

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

131

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

f131([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

132

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

f132([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

133

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

134

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

135

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

f135([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

136

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

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

f136(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

137

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

138

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

f138([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

139

def f139(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    result = []
    groups = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[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

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

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

140

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

141

def f141(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)
    handled = set()
    sequence = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[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

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

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

142

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

f142(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

143

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

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

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

144

def f144(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 if tidy(value) != tidy(value) or tidy(value) != ''} - 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

f144(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

145

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

146

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

f146([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

147

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

f147([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

148

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

149

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

f149([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

150

def f150(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 and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f150([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

151

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

152

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

153

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

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

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

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

154

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

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

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

155

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

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

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

156

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

157

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

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

f157(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

158

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

159

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

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

f159(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

160

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

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

f160(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

161

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

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

f161(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

162

def f162(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 = {str(value).upper() 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

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

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

163

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

f163([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

164

def f164(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            finished.add(node)
            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 startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

165

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

f165([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

166

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

f166([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

167

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

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

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

168

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

f168([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

169

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

f169([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

170

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

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

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

171

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

172

def f172(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()
    result = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            handled.add(node)
            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

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

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

173

def f173(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.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

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

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

174

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

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

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

175

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

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

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

176

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

f176([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

177

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

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

f177(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

178

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

179

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

f179([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

180

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

f180([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

181

def f181(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
    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=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                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

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

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

182

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

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

f182(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

183

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

f183([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

184

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

f184([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

185

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

f185([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

186

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

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

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

187

def f187(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()
    result = []
    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))
        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 children[node]:
                incoming[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

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

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

188

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

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

f188(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

189

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

f189([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

190

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

191

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

f191([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

192

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

193

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

f193([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

194

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

f194([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

195

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

f195([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

196

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

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

f196(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

197

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

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

f197(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

198

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

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

f198(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

199

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

200

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

201

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

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

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

202

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

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

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

203

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

f203([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

204

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

205

def f205(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    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[:1] if any((str(node).isupper() for node in nodes)) else 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 rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

206

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

f206([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

207

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

208

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

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

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

209

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

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

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

210

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

f210([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

211

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

f211([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

212

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

213

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

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

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

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:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

215

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

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

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

216

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

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

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

217

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

f217([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

218

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

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

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

219

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

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

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

220

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

f220([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

221

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

222

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

f222([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

223

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

224

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

f224([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

225

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

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

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

226

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

227

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

f227([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

228

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

229

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

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

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

230

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

f230([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

231

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

f231([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

232

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

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

f232(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

233

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

f233([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

234

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

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

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

235

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

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

f235(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

236

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

f236([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

237

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

f237([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

238

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

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

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

239

def f239(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = 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 nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

240

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

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

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

241

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

f241([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

242

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

243

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

f243([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

244

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

f244([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

245

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

f245([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

246

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

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

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

247

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

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

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

248

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

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

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

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]))
    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': min(256, max(windows)), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f249([19, 17, 10, 13, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":6,"sums":[46,40,41,35,38,36,45,51,59,55,55,42,52]}

250

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

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

f250(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

251

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

f251([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

252

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

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

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

253

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

254

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

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

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

255

def f255(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    listing = []
    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), reverse=len(nodes) > 20)
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

256

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

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

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

257

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

f257([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

258

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

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

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

259

def f259(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)
    complete = set()
    listing = []
    groups = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                needs[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

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

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

260

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

261

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

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

f261(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

262

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

f262([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

263

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

f263([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

264

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

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

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

265

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

f265([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

266

def f266(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 = {str(value).upper() 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

f266(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

267

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

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

f267(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

268

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

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

f268(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

269

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

f269([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

270

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

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

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

271

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

272

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

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

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

273

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

f273([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

274

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

f274([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

275

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

276

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

f276([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

277

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

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

f277(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

278

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

f278([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

279

def f279(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    steps = {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 steps[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                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

f279([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

280

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

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

f280(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

281

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

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

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

282

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

f282([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

283

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

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

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

284

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

f284([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

285

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

f285([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

286

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

f286([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

287

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

f287([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":150,"south":65},"top":["CX26","DL37","DL85"],"total":655}

288

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

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

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

289

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

f289([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

290

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

291

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

f291([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

292

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

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

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

293

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

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

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

294

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

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

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

295

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

f295([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 0)

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

296

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

297

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

f297([('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15), ('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":440,"north":105,"south":117},"top":["CX26","DL37","DL85"],"total":662}

298

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

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

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

299

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

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

{"count":6,"items":[["HR",100],["FP",77],["DL",60],["GQ",42],["CX",21]],"missing":["AN","BR"],"total":320}

300

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

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

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

301

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

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

f301(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

302

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

f302([('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5), ('FP', 7), ('GQ', 6), ('HR', 10)], [('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7), ('GQ', 7), ('HR', 10)], 0)

{"count":6,"items":[["HR",100],["DL",60],["FP",49],["GQ",42],["EV",25]],"missing":["AN","BR"],"total":297}

303

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

f303(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

304

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

305

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

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

f305(['BLUE', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Emberx'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

{"all":["BLUE","CYAN","DELTA","EMBERX","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","DELTA","HELIUM","IVORY"],"left":["CYAN","EMBERX","FROST"],"right":["GARNET"],"score":20}

306

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

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

{"bounds":[-3,-9,7,3],"end":[7,-9],"far":16,"revisits":[[-1,0],[-1,2],[-1,1],[-1,-1],[-3,-1]],"steps":38}

307

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

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

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

308

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

f308([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

309

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

f309([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], 'A', 2)

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

310

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

f310([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

311

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

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

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

312

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

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

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

313

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

f313([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

314

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

f314([19, 19, 10, 9, 18, 4, 16, 16, 13, 22, 24, 9, 22, 11, 19], 3, 37)

{"best":59,"hits":[0,1,2,4,6,7,8,9,10,11,12],"rises":5,"sums":[48,38,37,31,38,36,45,51,59,55,55,42,52]}

315

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

316

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

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

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

317

def f317(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            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 initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

318

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

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

{"bounds":[-3,-8,7,1],"end":[7,-8],"far":15,"revisits":[[-1,0],[-1,-1],[-1,-2],[-1,-3],[-3,-3]],"steps":37}

319

def f319(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 if normalize(value) != ''} - excluded
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f319(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

320

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

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

f320(['BLUEx', 'frost', 'cyan ', 'helium', 'ivory', 'delta', 'Ember'], ['delta', 'Ember', 'helium', 'ivory', 'GARNET', 'BLUE', 'Ember'], ['EMBER'])

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

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
rows = list((('CX26', 'core', 'ready', 20), ('AN63', 'north', 'void', 6), ('DL00', 'north', 'void', 9), ('DL37', 'core', 'ready', 20), ('DL74', 'south', 'checked', 6), ('DL11', 'core', 'hold', 14), ('BR48', 'north', 'hold', 9), ('DL85', 'north', 'ready', 15)) + (('CX22', 'north', 'void', 3), ('AN59', 'core', 'void', 19), ('BR96', 'edge', 'void', 9), ('BR33', 'south', 'ready', 7), ('AN70', 'core', 'hold', 17), ('DL07', 'north', 'void', 13)))
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7), ('south', 9), ('core', 11)) + (('edge', 3),))
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
stamp = record['bb']
moves = list((('W', 3), ('S', 4), ('E', 2), ('N', 2), ('N', 3), ('S', 2), ('N', 1)) + (('S', 3), ('W', 2), ('S', 2), ('E', 3), ('E', 1), ('E', 3), ('E', 3), ('S', 3)))
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}
ticket = record['bb']
width = 3
limit = 37
route = stamp
cases = {
    655: list((19, 19, 10, 9, 18, 4) + (16, 16, 13, 22, 24, 9, 22, 11, 19)),
    662: list((19, 17, 10, 13, 18, 4) + (16, 16, 13, 22, 24, 9, 22, 11, 19)),
}
values = 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}
badge = record['cc']
left = list((('AN', 2), ('BR', 3), ('CX', 7), ('DL', 12), ('EV', 5)) + (('FP', 7), ('GQ', 6), ('HR', 10)))
fee = 0
route = ticket
cases = {
    15: list((('CX', 3), ('DL', 5), ('EV', 5), ('FP', 7)) + (('GQ', 7), ('HR', 10))),
    16: list((('CX', 3), ('DL', 5), ('EV', 4), ('FP', 11)) + (('GQ', 7), ('HR', 10))),
}
right = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
permit = record['bb']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')))
start = 'A'
route = (stamp, ticket)
cases = {
    (655, 16): 0,
    (655, 15): 0,
    (662, 16): 0,
    (662, 15): 2,
}
limit = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
signal = record['dd']
right = list(('delta', 'Ember') + ('helium', 'ivory', 'GARNET', 'BLUE', 'Ember'))
blocked = ['EMBER']
route = (badge, signal)
cases = {
    (6, 6): list(('BLUE', 'frost') + ('cyan ', 'helium', 'ivory', 'delta', 'Emberx')),
    (6, 1): list(('BLUEx', 'frost') + ('cyan ', 'helium', 'ivory', 'delta', 'Ember')),
    (5, 6): list(('BLUEx', 'frost') + ('cyan ', 'helium', 'ivory', 'delta', 'Ember')),
    (5, 1): list(('BLUEx', 'frost') + ('cyan ', 'helium', 'ivory', 'delta', '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))}
token = record['ee']
route = (permit, token)
cases = {
    (320, 16): list(('####..', '....#.', '...#..', '..###.') + ('##...#', '#.##.#')),
    (320, 20): list(('####..', '....#.', '...#..', '..###.') + ('##...#', '#.##.#')),
    (297, 16): list(('####..', '....#.', '...#..', '..###.') + ('##...#', '#.##.#')),
    (297, 20): 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)}
memo = record['dd']
nodes = list(('db', 'ui', 'api', 'proxy') + ('auth', 'worker', 'jobs', 'cache'))
route = memo
cases = {
    5: list((('auth', 'api'), ('db', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'))),
    6: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('auth', 'proxy'), ('proxy', 'ui'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))