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

001

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

Example call:

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

Output example:

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

002

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

Example call:

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

Output example:

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

003

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

Example call:

f3([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

004

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

Example call:

f4([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

005

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

Example call:

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

Output example:

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

006

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

Example call:

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

Output example:

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

007

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

Example call:

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

Output example:

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

008

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

Example call:

f8([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

009

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

Example call:

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

Output example:

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

010

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

Example call:

f10([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

011

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

Example call:

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

Output example:

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

012

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

Example call:

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

Output example:

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

013

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

Example call:

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

Output example:

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

014

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

Example call:

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

Output example:

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

015

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

016

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

Example call:

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

Output example:

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

017

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

Example call:

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

Output example:

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

018

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

Example call:

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

Output example:

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

019

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

Example call:

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

Output example:

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

020

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

Example call:

f20([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

021

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

022

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

Example call:

f22([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

023

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

Example call:

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

Output example:

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

024

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

Example call:

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

Output example:

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

025

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

Example call:

f25([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

026

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

Example call:

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

Output example:

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

027

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

Example call:

f27([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

028

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

Example call:

f28([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

029

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

Example call:

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

Output example:

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

030

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

Example call:

f30([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

031

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

Example call:

f31([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

032

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

Example call:

f32([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

033

def f33(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    handled = set()
    listing = []
    groups = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[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

Example call:

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

Output example:

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

034

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

Example call:

f34([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

035

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

Example call:

f35([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

036

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

Example call:

f36([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

037

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

Example call:

f37([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

038

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

Example call:

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

Output example:

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

039

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

040

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

Example call:

f40([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

041

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

Example call:

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

Output example:

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

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

Example call:

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

Output example:

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

043

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

Example call:

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

Output example:

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

044

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

Example call:

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

Output example:

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

045

def f45(rows, keep, factors):
    rows = list(rows)
    matches = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            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], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': groupmap, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

f45([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

046

def f46(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, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

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

Output example:

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

047

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

Example call:

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

Output example:

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

048

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

Example call:

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

Output example:

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

049

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

Example call:

f49([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

050

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

Example call:

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

Output example:

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

051

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

Example call:

f51([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

052

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

Example call:

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

Output example:

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

053

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

Example call:

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

Output example:

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

054

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

Example call:

f54([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

055

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

056

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

Example call:

f56([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

057

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

058

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

Example call:

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

Output example:

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

059

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

Example call:

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

Output example:

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

060

def f60(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
    initial = dict(needs)
    finished = set()
    result = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        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 routes[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

Example call:

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

Output example:

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

061

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

Example call:

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

Output example:

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

062

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

Example call:

f62([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

063

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

Example call:

f63([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

064

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

Example call:

f64([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

065

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

Example call:

f65([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

066

def f66(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
    startdegree = dict(needs)
    complete = set()
    listing = []
    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)
            listing.append(node)
        for node in current:
            for nxt in routes[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

Example call:

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

Output example:

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

067

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

Example call:

f67([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

068

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

Example call:

f68([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

069

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

Example call:

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

Output example:

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

070

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

Example call:

f70([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

071

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

Example call:

f71([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

072

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

Example call:

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

Output example:

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

073

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

Example call:

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

Output example:

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

074

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

Example call:

f74([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

075

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

Example call:

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

Output example:

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

076

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

077

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

Example call:

f77([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

078

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

Example call:

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

Output example:

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

079

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

Example call:

f79([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

080

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

Example call:

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

Output example:

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

081

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

Example call:

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

Output example:

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

082

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

Example call:

f82([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

083

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

Example call:

f83([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

084

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

Example call:

f84([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

085

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

Example call:

f85([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

086

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

087

def f87(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        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

Example call:

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

Output example:

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

088

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

Example call:

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

Output example:

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

089

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

Example call:

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

Output example:

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

090

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

Example call:

f90([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

091

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

Example call:

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

Output example:

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

092

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

093

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

Example call:

f93([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

094

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

Example call:

f94([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

095

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

096

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

Example call:

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

Output example:

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

097

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

Example call:

f97([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

098

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

Example call:

f98([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

099

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

Example call:

f99([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

100

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

Example call:

f100([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

101

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

Example call:

f101([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

102

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

Example call:

f102([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

103

def f103(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(factors[group])
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    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

Example call:

f103([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

104

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

Example call:

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

Output example:

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

105

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

Example call:

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

Output example:

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

106

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

Example call:

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

Output example:

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

107

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

Example call:

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

Output example:

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

108

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

109

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

Example call:

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

Output example:

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

110

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

Example call:

f110([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

111

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

Example call:

f111([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

112

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

Example call:

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

Output example:

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

113

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

Example call:

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

Output example:

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

114

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

Example call:

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

Output example:

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

115

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

Example call:

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

Output example:

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

116

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

Example call:

f116([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

117

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

Example call:

f117([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

118

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

Example call:

f118([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

119

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

Example call:

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

Output example:

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

120

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

Example call:

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

Output example:

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

121

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

Example call:

f121([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

122

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

123

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

Example call:

f123([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

124

def f124(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], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

f124([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

125

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

Example call:

f125([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

126

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

Example call:

f126([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

127

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

128

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

Example call:

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

Output example:

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

129

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

Example call:

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

Output example:

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

130

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

Example call:

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

Output example:

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

131

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

Example call:

f131([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

132

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

133

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

Example call:

f133([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

134

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

Example call:

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

Output example:

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

135

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

Example call:

f135([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

136

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

Example call:

f136([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

137

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

Example call:

f137([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

138

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

Example call:

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

Output example:

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

139

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

Example call:

f139([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

140

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

Example call:

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

Output example:

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

141

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

Example call:

f141([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

142

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

Example call:

f142([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

143

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

Example call:

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

Output example:

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

144

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

Example call:

f144([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

145

def f145(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 sorted(children.get(cur, [])):
                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

Example call:

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

Output example:

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

146

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

Example call:

f146([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

147

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

Example call:

f147([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

148

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

Example call:

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

Output example:

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

149

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

Example call:

f149([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

150

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

Example call:

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

Output example:

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

151

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

Example call:

f151([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

152

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

Example call:

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

Output example:

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

153

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

Example call:

f153([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

154

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

Example call:

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

Output example:

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

155

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

Example call:

f155([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

156

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

Example call:

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

Output example:

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

157

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

Example call:

f157([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

158

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

Example call:

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

Output example:

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

159

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

Example call:

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

Output example:

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

160

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

Example call:

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

Output example:

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

161

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

Example call:

f161([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

162

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

Example call:

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

Output example:

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

164

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

Example call:

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

Output example:

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

165

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

166

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

167

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

Example call:

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

Output example:

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

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

169

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

Example call:

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

Output example:

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

170

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

Example call:

f170([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

171

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

Example call:

f171([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

172

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

173

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

Example call:

f173([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

174

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

175

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

176

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

Example call:

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

Output example:

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

177

def f177(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    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=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                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

Example call:

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

Output example:

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

178

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

Example call:

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

Output example:

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

179

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

Example call:

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

Output example:

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

180

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

Example call:

f180([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

181

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

Example call:

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

Output example:

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

182

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

183

def f183(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    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

Example call:

f183([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

184

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

Example call:

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

Output example:

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

185

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

Example call:

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

Output example:

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

186

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

187

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

Example call:

f187([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

188

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

Example call:

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

Output example:

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

189

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

Example call:

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

Output example:

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

190

def f190(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            cost = value * abs(ratemap[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

Example call:

f190([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

191

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

Example call:

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

Output example:

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

192

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

Example call:

f192([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

193

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

Example call:

f193([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

194

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

Example call:

f194([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

195

def f195(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} 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(routes.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    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

Example call:

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

Output example:

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

196

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

197

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

Example call:

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

Output example:

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

198

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

Example call:

f198([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

199

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

Example call:

f199([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

200

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

Example call:

f200([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

201

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

202

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

Example call:

f202([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

203

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

Example call:

f203([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

204

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

Example call:

f204([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

205

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

Example call:

f205([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

206

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

Example call:

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

Output example:

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

207

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

208

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

Example call:

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

Output example:

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

209

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

Example call:

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

Output example:

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

210

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

Example call:

f210([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

211

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

Example call:

f211([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

212

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

213

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

Example call:

f213([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

214

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

Example call:

f214([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

215

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

216

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

Example call:

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

Output example:

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

217

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

Example call:

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

Output example:

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

218

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

Example call:

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

Output example:

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

219

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

Example call:

f219([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

220

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

Example call:

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

Output example:

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

221

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

Example call:

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

Output example:

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

222

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

Example call:

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

Output example:

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

223

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

Example call:

f223([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

224

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

Example call:

f224([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

225

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

Example call:

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

Output example:

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

226

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

227

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

Example call:

f227([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

228

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

Example call:

f228([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

229

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

Example call:

f229([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

230

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

Example call:

f230([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

231

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

Example call:

f231([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

232

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

233

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

Example call:

f233([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

234

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

235

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

236

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

Example call:

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

Output example:

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

237

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

Example call:

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

Output example:

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

238

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

Example call:

f238([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

239

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

Example call:

f239([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

240

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

241

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

Example call:

f241([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

242

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

Example call:

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

Output example:

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

243

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

Example call:

f243([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

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

Example call:

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

Output example:

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

245

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

246

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

Example call:

f246([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

247

def f247(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state 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(dict.fromkeys(matches)), 'total': amount, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

f247([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

248

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

Example call:

f248([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

249

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

Example call:

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

Output example:

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

250

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

Example call:

f250([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

251

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

Example call:

f251([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

252

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

Example call:

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

Output example:

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

253

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

Example call:

f253([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

254

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

Example call:

f254([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

255

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

Example call:

f255([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

256

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

257

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

258

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

Example call:

f258([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

259

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

Example call:

f259([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

260

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

Example call:

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

Output example:

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

261

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

Example call:

f261([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

262

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

Example call:

f262([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

263

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

264

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

Example call:

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

Output example:

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

265

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

Example call:

f265([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

266

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

Example call:

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

Output example:

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

267

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

Example call:

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

Output example:

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

268

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

Example call:

f268([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

269

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

Example call:

f269([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

270

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

Example call:

f270([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

271

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

Example call:

f271([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

272

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

Example call:

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

Output example:

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

273

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

Example call:

f273([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

274

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

Example call:

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

Output example:

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

275

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

Example call:

f275([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

276

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

Example call:

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

Output example:

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

277

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

Example call:

f277([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

278

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

Example call:

f278([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

279

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

Example call:

f279([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 1)

Output example:

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

280

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

Example call:

f280([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

281

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

Example call:

f281([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

282

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

Example call:

f282([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

283

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

284

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

285

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

Example call:

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

Output example:

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

286

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

Example call:

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

Output example:

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

287

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

288

def f288(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            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

Example call:

f288([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

289

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

290

def f290(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[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

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

Output example:

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

291

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

292

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

Example call:

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

Output example:

{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","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
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

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

Output example:

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

294

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

Example call:

f294([('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8), ('FP', 3), ('GQ', 8), ('HR', 3)], [('AN', 7), ('CX', 3), ('DL', 5), ('FP', 7), ('HR', 6)], 0)

Output example:

{"count":5,"items":[["AN",70],["CX",42],["FP",21],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":171}

295

def f295(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 = 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': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

296

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

297

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

Example call:

f297([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

298

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

Example call:

f298([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 10, 50)

Output example:

{"best":145,"hits":[0,1,2,3,4,5],"rises":1,"sums":[145,140,137,137,122,131]}

299

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

Example call:

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

Output example:

{"count":5,"items":[["AN",70],["FP",42],["CX",27],["DL",20],["HR",18]],"missing":["BR","EV","GQ"],"total":177}

300

def f300(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 sorted(children.get(cur, []))[:20]:
                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

Example call:

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

Output example:

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

301

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

Example call:

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

Output example:

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

302

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

Example call:

f302([(2, 7), (5, 10), (14, 20), (18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,3,2,8,5],"longest":11,"segments":[[2,10],[14,25],[28,31],[33,35],[43,54],[59,65]]}

303

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

Example call:

f303([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

304

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

Example call:

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

Output example:

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

305

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

Example call:

f305([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

306

def f306(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if indegree[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)
            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 initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

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

Output example:

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

307

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

Example call:

f307([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

308

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

Example call:

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

Output example:

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

309

def f309(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.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] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

Example call:

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

Output example:

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

310

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

Example call:

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

Output example:

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

311

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

Example call:

f311([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

312

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

Example call:

f312([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":160,"south":360},"top":["CX98","DL24","AN50"],"total":751}

313

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

314

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

Example call:

f314([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

315

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

Example call:

f315([(2, 7), (5, 10), (14, 20), (18, 25), (30, 33), (33, 35), (43, 49), (48, 54), (59, 65)], 1)

Output example:

{"cover":41,"holes":[4,5,8,5],"longest":11,"segments":[[2,10],[14,25],[30,35],[43,54],[59,65]]}

316

def f316(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
    startdegree = dict(indegree)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[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

Example call:

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

Output example:

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

317

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

Example call:

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

Output example:

{"bounds":[0,-2,17,6],"end":[17,1],"far":18,"revisits":[[6,1],[9,5],[9,4],[9,3]],"steps":36}

318

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

Example call:

f318([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

319

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

Example call:

f319([('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23), ('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

Output example:

{"accepted":6,"groups":{"core":231,"north":112,"south":648},"top":["CX98","AN50","AN39"],"total":991}

320

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

Example call:

f320([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 2, 50)

Output example:

{"best":40,"hits":[],"rises":5,"sums":[32,26,33,29,17,16,23,38,40,31,24,23,18,23]}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
spans = sorted(list(((2, 7), (5, 10), (14, 20)) + ((18, 25), (28, 31), (33, 35), (43, 49), (48, 54), (59, 65))))
gap = 1
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
rows = list((('BR17', 'south', 'void', 16), ('AN54', 'south', 'ready', 14), ('DL91', 'south', 'hold', 10), ('DL28', 'edge', 'void', 8), ('CX65', 'south', 'ready', 18), ('CX02', 'edge', 'hold', 23)) + (('AN39', 'south', 'ready', 19), ('DL76', 'north', 'hold', 22), ('BR13', 'edge', 'hold', 24), ('AN50', 'south', 'ready', 21), ('BR87', 'south', 'hold', 23), ('DL24', 'north', 'ready', 16), ('DL61', 'south', 'void', 23), ('CX98', 'core', 'ready', 21)))
keep = list(('ready',) + ('checked',))
route = record['aa'][2][0]
cases = {
    28: dict((('north', 10),) + (('south', 5), ('core', 11), ('edge', 3))),
    30: dict((('north', 7),) + (('south', 9), ('core', 11), ('edge', 3))),
}
rates = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
right = list((('AN', 7), ('CX', 3), ('DL', 5)) + (('FP', 7), ('HR', 6)))
fee = 0
route = record['bb']
cases = {
    991: list((('AN', 10), ('BR', 10), ('CX', 14), ('DL', 4), ('EV', 8)) + (('FP', 3), ('GQ', 8), ('HR', 3))),
    751: list((('AN', 10), ('BR', 10), ('CX', 9), ('DL', 4), ('EV', 8)) + (('FP', 6), ('GQ', 8), ('HR', 3))),
}
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)}
route = record['bb']
cases = {
    177: list((('E', 3), ('E', 2), ('N', 1), ('E', 2), ('W', 1), ('N', 2), ('E', 3), ('N', 3), ('S', 3)) + (('S', 2), ('S', 3), ('E', 3), ('E', 1), ('E', 3), ('N', 3), ('N', 3))),
    171: list((('E', 3), ('E', 2), ('N', 1), ('E', 2), ('W', 1), ('N', 2), ('E', 3), ('N', 3), ('S', 3)) + (('S', 2), ('S', 3), ('E', 3), ('E', 1), ('E', 3), ('N', 3), ('E', 1))),
}
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}
route = record['bb']
cases = {
    18: list(('##.##.', '####.#', '...#..') + ('..#..#', '#.#..#', '..#...')),
    20: list(('##.##.', '.###.#', '#..#..') + ('..#..#', '#.#..#', '..#...')),
}
board = cases[route]
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
start = 'A'
route = record['dd']
cases = {
    5: 3,
    6: 1,
}
limit = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
nodes = list(('db', 'ui', 'cache', 'worker') + ('jobs', 'auth', 'api', 'proxy'))
route = record['dd']
cases = {
    3: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache'))),
    8: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'db'))),
}
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)}
values = list((18, 14, 12, 21, 8, 9) + (7, 16, 22, 18, 13, 11, 12, 6, 17))
limit = 50
route = record['aa'][1]
cases = {
    'db': 10,
    'cache': 2,
}
width = 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['cc'] = record['cc']
out['bb'] = record['bb']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))