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

001

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

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

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

002

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

003

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

f3([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

004

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

005

def f5(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    complete = set()
    sequence = []
    groups = []
    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), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

006

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

f6([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

007

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

f7([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

008

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

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

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

009

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

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

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

010

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

f10(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

011

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

f11([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

012

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

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

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

013

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

014

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

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

f14(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

015

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

f15([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

016

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

f16([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

017

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

018

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

019

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

020

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

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

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

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

021

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

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

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

022

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

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

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

023

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

f23([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

024

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

f24([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

025

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

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

f25(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

026

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

027

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

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

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

028

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

f28([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

029

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

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

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

030

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

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

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

031

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

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

f31(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

032

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

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

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

033

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

034

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

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

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

035

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

036

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

037

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

f37([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

038

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

039

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

040

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

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

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

041

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

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

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

042

def f42(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges[:16]:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.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[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

043

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

f43([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

044

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

045

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

f45([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

046

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

047

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

048

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

f48([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

049

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

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

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

050

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

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

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

051

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

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

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

052

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

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

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

053

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

f53([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

054

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

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

f54(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

055

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

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

f55(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

056

def f56(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} - ignored
    b = {str(value).upper() for value in right} - ignored
    both = a & b
    result = sorted
    returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f56(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

057

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

058

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

059

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

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

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

060

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

061

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

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

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

062

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

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

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

063

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

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

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

064

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

f64([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

065

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

f65([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

066

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

067

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

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

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

068

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

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

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

069

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

f69([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

070

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

f70([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

071

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

f71([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

072

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

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

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

073

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

074

def f74(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0} if any((start in edge for edge in edges)) else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(nextmap.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, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

075

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

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

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

076

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

f76([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

077

def f77(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] < limit:
            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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

078

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

079

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

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

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

080

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

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

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

081

def f81(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 if canon(value) != canon(value) or canon(value) != ''} - ignored
    b = {canon(value) for value in right} - ignored
    both = a & b
    sequence = sorted
    returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f81(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

082

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

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

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

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

083

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

f83([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

084

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

f84([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

085

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

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

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

086

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

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

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

087

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

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

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

088

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

f88([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

089

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

f89([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

090

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

f90([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

091

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

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

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

092

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

093

def f93(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    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=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.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': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

094

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

095

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

096

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

097

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

098

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

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

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

099

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

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

f99(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

100

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

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

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

101

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

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

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

102

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

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

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

103

def f103(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes) and len(complete) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                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

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

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

104

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

105

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

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

f105(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

106

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

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

f106(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

107

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

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

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

108

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

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

f108(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

109

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

f109([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

110

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

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

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

111

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

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

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

112

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

113

def f113(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    buckets = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            cost = value * ratemap[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(matches), 'total': grand, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f113([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

114

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

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

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

115

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

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

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

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

116

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

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

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

117

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

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

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

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

118

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

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

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

119

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

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

f119(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

120

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

f120([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

121

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

f121([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

122

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

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

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

123

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

f123([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

124

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

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

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

125

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

126

def f126(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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()
    sequence = []
    rounds = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[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

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

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

127

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

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

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

128

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

129

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

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

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

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

130

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

131

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

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

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

132

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

f132([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

133

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

134

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

135

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

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

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

136

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

f136([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

137

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

f137([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

138

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

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

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

139

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

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

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

140

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

f140([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

141

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

f141(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

142

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

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

f142(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

143

def f143(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):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            finished.add(node)
            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

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

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

144

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

145

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

146

def f146(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[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)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[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

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

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

147

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

148

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

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

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

149

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

f149([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

150

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

151

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

152

def f152(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': min(256, max(windows)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f152([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

153

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

154

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

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

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

155

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

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

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

156

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

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

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

157

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

f157([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

158

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

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

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

159

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

160

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

f160(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

161

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

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

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

162

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

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

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

163

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

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

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

164

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

165

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

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

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

166

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

167

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

168

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

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

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

169

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

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

f169(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

170

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

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

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

171

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

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

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

172

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

173

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

f173([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

174

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

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

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

175

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

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

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

176

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

177

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

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

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

178

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

f178([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

179

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

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

f179(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

180

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

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

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

181

def f181(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(matched)}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

182

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

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

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

183

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

f183([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

184

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

185

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

186

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

f186([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

187

def f187(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)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

188

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

189

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

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

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

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

190

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

f190([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

191

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

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

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

192

def f192(rows, keep, factors):
    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 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], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': buckets, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f192([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

193

def f193(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 = {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

f193(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

194

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

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

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

195

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

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

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

196

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

197

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

198

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

f198([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

199

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

f199([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

200

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

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

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

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

201

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

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

f201(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

202

def f202(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    groups = []
    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
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

203

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

f203([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

204

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

205

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

f205([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

206

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

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

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

207

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

f207([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

208

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

f208(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

209

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

210

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

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

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

211

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

f211([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

212

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

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

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

213

def f213(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)
    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[: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 startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

214

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

f214([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

215

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

216

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

f216([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

217

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

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

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

218

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

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

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

219

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

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

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

220

def f220(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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):
        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
        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

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

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

221

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

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

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

222

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

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

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

223

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

f223([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

224

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

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

f224(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

225

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

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

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

226

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

227

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

228

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

f228([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

229

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

f229([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

230

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

231

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

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

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

232

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

f232(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

233

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

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

f233(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

234

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

f234([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

235

def f235(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(series[: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

f235([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

236

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

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

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

237

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

f237([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

238

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

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

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

239

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

f239([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

240

def f240(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} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(routes.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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

241

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

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

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

242

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

243

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

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

f243(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

244

def f244(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 = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

245

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

246

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

f246([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

247

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

f247([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

248

def f248(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    complete = set()
    listing = []
    rounds = []
    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
        rounds.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[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

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

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

249

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

250

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

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

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

251

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

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

f251(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

252

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

253

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

f253([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

254

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

f254([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

255

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

256

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

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

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

257

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

258

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

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

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

259

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

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

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

260

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

f260([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

261

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

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

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

262

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

f262([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

263

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

264

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

265

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

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

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

266

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

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

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

267

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

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

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

268

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

269

def f269(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 = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (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

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

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

270

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

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

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

271

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

f271([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

272

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

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

f272(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

273

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

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

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

274

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

f274([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

275

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

276

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

f276([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

277

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

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

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

278

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

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

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

279

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

280

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

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

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

281

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

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

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

282

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

f282([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

283

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

f283(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

284

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

f284([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

285

def f285(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    listing = []
    groups = []
    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
        groups.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

286

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

f286([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

287

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

f287([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

288

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

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

f288(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

289

def f289(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, 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

f289([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

290

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

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

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

291

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

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

{"bounds":[-4,0,8,8],"end":[8,8],"far":16,"revisits":[[-2,0],[-3,0],[0,6],[0,4],[0,5]],"steps":36}

292

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

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

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

293

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

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

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

294

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

f294([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":108,"north":350,"south":235},"top":["DL23","DL86","CX60"],"total":979}

295

def f295(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    listing = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': furthest[:3], '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')], 'C', 3)

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

296

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

f296([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

297

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

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

{"count":3,"depth":{"C":0,"F":1,"H":2},"frontier":["H"],"order":["C","F","H"]}

298

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

299

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

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

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

300

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

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

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

301

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",34],["CX",22]],"missing":["AN","DL","GQ"],"total":267}

302

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

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

f302(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], ['delta'])

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

303

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

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

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

304

def f304(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)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            handled.add(node)
            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 startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

305

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

f305([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

306

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

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

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

307

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

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

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

308

def f308(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) and len(complete) < 20:
        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
        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

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

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

309

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

f309([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

310

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

f310([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

311

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

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

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

312

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

f312([('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23), ('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":10,"groups":{"core":286,"edge":111,"north":336,"south":235},"top":["DL23","DL86","CX60"],"total":968}

313

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

f313([9, 5, 9, 11, 9, 18, 7, 17, 21, 8, 6, 4, 7, 21, 16], 4, 54)

{"best":63,"hits":[5],"rises":5,"sums":[34,34,47,45,51,63,53,52,39,25,38,48]}

314

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

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

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

315

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

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

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

316

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

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

{"count":5,"items":[["EV",92],["FP",72],["HR",47],["BR",26],["CX",22]],"missing":["AN","DL","GQ"],"total":259}

317

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

f317([9, 5, 9, 11, 13, 18, 7, 17, 21, 8, 6, 4, 7, 18, 16], 4, 53)

{"best":63,"hits":[4,5,6],"rises":6,"sums":[34,38,51,49,55,63,53,52,39,25,35,45]}

318

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

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

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

319

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

f319(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

320

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

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

f320(['GARNET', 'helium', 'BLUE', ' Amber', 'delta', 'Ember', 'Ember'], ['delta', 'ivory', 'Ember', 'BLUE', 'frost', 'GARNET', 'Ember'], [' Amber'])

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

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')))
start = 'H'
limit = 3
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
signal = record['dd']
route = signal
cases = {
    1: list(('....#.', '..#.#.', '#..#.#') + ('##.###', '..#...', '.##..#')),
    3: 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)}
token = record['dd']
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
route = signal
cases = {
    3: list((('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 10), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23)) + (('CX38', 'edge', 'checked', 25), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3))),
    1: list((('BR16', 'north', 'checked', 8), ('CX53', 'north', 'checked', 12), ('DL90', 'north', 'ready', 14), ('DL27', 'south', 'hold', 12), ('CX64', 'north', 'ready', 16), ('DL01', 'core', 'hold', 23)) + (('CX38', 'edge', 'checked', 24), ('CX75', 'core', 'checked', 10), ('DL12', 'core', 'hold', 24), ('CX49', 'edge', 'ready', 12), ('DL86', 'south', 'ready', 24), ('DL23', 'core', 'ready', 16), ('CX60', 'south', 'ready', 23), ('BR97', 'south', 'hold', 3))),
}
rows = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
memo = record['bb']
left = list(('GARNET', 'helium', 'BLUE', ' Amber') + ('delta', 'Ember', 'Ember'))
right = list(('delta', 'ivory', 'Ember', 'BLUE') + ('frost', 'GARNET', 'Ember'))
route = (token, memo)
cases = {
    (6, 979): [' Amber'],
    (6, 968): ['delta'],
    (5, 979): ['delta'],
    (5, 968): ['delta'],
}
blocked = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
clue = record['ee']
right = list((('BR', 4), ('CX', 5)) + (('EV', 10), ('FP', 10), ('HR', 5)))
fee = 2
route = clue
cases = {
    15: list((('AN', 3), ('BR', 8), ('CX', 4), ('DL', 8)) + (('EV', 9), ('FP', 7), ('GQ', 2), ('HR', 9))),
    20: list((('AN', 3), ('BR', 6), ('CX', 4), ('DL', 9)) + (('EV', 9), ('FP', 7), ('GQ', 2), ('HR', 9))),
}
left = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
stamp = record['bb']
route = stamp
cases = {
    259: list((('W', 3), ('E', 1), ('W', 2), ('N', 3), ('E', 2), ('N', 3), ('E', 3)) + (('W', 1), ('S', 3), ('N', 2), ('E', 3), ('N', 3), ('S', 1), ('E', 2), ('E', 3), ('N', 1))),
    267: list((('W', 3), ('E', 1), ('W', 2), ('N', 3), ('E', 2), ('N', 3), ('E', 3)) + (('W', 1), ('S', 3), ('N', 2), ('E', 3), ('N', 3), ('S', 1), ('E', 2), ('E', 3), ('W', 2))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
ticket = record['bb']
nodes = list(('proxy', 'worker', 'jobs', 'db', 'cache') + ('api', 'auth', 'ui'))
route = ticket
cases = {
    15: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth'))),
    16: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
badge = record['aa'][0]
width = 4
route = badge
cases = {
    'auth': (list((9, 5, 9, 11, 13, 18, 7) + (17, 21, 8, 6, 4, 7, 18, 16)), 53),
    'cache': (list((9, 5, 9, 11, 9, 18, 7) + (17, 21, 8, 6, 4, 7, 21, 16)), 54),
}
values, limit = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))