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

001

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

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

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

002

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

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

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

003

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

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

f3(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

004

def f4(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)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                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

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

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

005

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

f5([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

006

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

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

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

007

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

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

f7(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

008

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

009

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

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

f9(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

010

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

011

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

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

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

012

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

f12([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

013

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

014

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

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

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

015

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

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

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

016

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

f16([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

017

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

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

f17(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

018

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

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

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

019

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

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

f19(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

020

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

f20([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

021

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

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

f21(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

022

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

023

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

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

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

024

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

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

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

025

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

f25([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

026

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

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

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

027

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

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

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

028

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

029

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

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

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

030

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

f30([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

031

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

f31([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

032

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

033

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

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

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

034

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

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

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

035

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

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

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

036

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

037

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

f37([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

038

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

f38([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

039

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

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

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

040

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

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

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

041

def f41(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            charge = value * ratemap[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

f41([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

042

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

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

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

043

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

f43([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

044

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

045

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

046

def f46(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    result = []
    rounds = []
    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[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        rounds.append(current)
        for node in current:
            complete.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

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

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

047

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

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

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

048

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

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

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

049

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

050

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

051

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

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

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

052

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

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

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

053

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

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

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

054

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

f54([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

055

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

056

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

057

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

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

f57(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

058

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

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

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

059

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

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

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

060

def f60(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}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    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

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

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

061

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

f61([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

062

def f62(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(nextmap.get(cur, []))[:20]:
                if nxt not in steps and (not nxt.startswith('Z')):
                    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

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

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

063

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

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

f63(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

064

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

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

f64(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

065

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

f65([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

066

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

067

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

f67([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

068

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

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

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

069

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

f69([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

070

def f70(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        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 crossings:
                crossings.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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

071

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

f71([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

072

def f72(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 {}
    pending = [start]
    while pending:
        cur = pending.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
                    pending.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

073

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

f73([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

074

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

f74([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

075

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

076

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

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

f76(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

077

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

078

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

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

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

079

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

f79([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

080

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

f80([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

081

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

082

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

083

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

f83([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

084

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

f84([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

085

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

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

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

086

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

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

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

087

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

f87([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

088

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

f88([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

089

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

090

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

f90([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

091

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

f91([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

092

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

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

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

093

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

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

f93(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

094

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

095

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

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

f95(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

096

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

f96([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

097

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

f97([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

098

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

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

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

099

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

100

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

f100([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

101

def f101(rows, keep, factors):
    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:
            cost = value * factors[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

f101([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

102

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

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

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

103

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

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

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

104

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

105

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

106

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

107

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

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

f107(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

108

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

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

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

109

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

f109([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

110

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

f110([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

111

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

112

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

f112([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

113

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

114

def f114(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 {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    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

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

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

115

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

116

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

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

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

117

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

f117([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

118

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

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

f118(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

119

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

120

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

121

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

f121([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

122

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

123

def f123(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} and value >= 0:
            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(dict.fromkeys(selected)), 'total': grand, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f123([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

124

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

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

f124(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

125

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

f125([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

126

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

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

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

127

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

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

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

128

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

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

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

129

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

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

f129(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

130

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

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

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

131

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

f131([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

132

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

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

f132(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

133

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

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

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

134

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

135

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

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

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

136

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

137

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

f137([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

138

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

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

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

139

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

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

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

140

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

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

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

141

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

f141([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

142

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

f142([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

143

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

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

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

144

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

f144([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

145

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

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

f145(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

146

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

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

f146(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

147

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

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

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

148

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

f148([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

149

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

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

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

150

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

151

def f151(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 % 100):
            x = max(-64, min(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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

152

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

153

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

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

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

154

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

f154([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

155

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

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:
        if before == after:
            continue
        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))
        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

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

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

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

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

158

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

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

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

159

def f159(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(ratemap[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

f159([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

160

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

161

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

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

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

162

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

f162([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

163

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

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

f163(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

164

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

165

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

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

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

166

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

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

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

167

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

f167([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

168

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

f168([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

169

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

170

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

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

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

171

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

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

f171(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

172

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

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

f172(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

173

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

174

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

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

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

175

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

176

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

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

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

177

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

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

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

178

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

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

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

179

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

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

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

180

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

181

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

182

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

183

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

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

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

184

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

f184([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

185

def f185(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()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        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

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

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

186

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

f186([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

187

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

f187([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

188

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

189

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

190

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

f190([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

191

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

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

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

192

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

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

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

193

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

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

f193(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

194

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

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

f194(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

195

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

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

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

196

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

f196([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

197

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

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

f197(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

198

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

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

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

199

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

200

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

f200([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

201

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

f201([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

202

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

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

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

203

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

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

f203(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

204

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

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

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

205

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

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

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

206

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

f206([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

207

def f207(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 and count > 0:
            items.append((key, count * factors[key] + fee))
    items.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 items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

208

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

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

f208(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

209

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

f209([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

210

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

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

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

211

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

f211([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

212

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

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

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

213

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

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

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

214

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

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

f214(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

215

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

f215([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

216

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

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

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

217

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

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

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

218

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

f218([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

219

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

220

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

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

f220(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

221

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

222

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

f222([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

223

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

f223([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

224

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

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

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

225

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

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

f225(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

226

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

227

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

228

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

f228([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

229

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

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

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

230

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

f230([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

231

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

232

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

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

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

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

233

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

f233([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

234

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

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

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

235

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

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

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

236

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

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

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

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

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

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

238

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

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

f238(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

239

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

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

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

240

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

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

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

241

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

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

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

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

242

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

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

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

243

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

244

def f244(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], item[0]))
    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

f244([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

245

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

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

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

246

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

247

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

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

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

248

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

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

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

249

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

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

f249(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

250

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

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

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

251

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

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

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

252

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

f252([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

253

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

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

f253(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

254

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

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

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

255

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

f255([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

256

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

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

f256(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

257

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

258

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

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

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

259

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

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

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

260

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

261

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

262

def f262(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    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), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in 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

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

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

263

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

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

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

264

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

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

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

265

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

266

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

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

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

267

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

268

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

f268([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

269

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

f269([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

270

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

271

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

f271([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

272

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

273

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

f273([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":2,"groups":{"north":119,"south":65},"top":["CX22","CX92"],"total":184}

274

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

275

def f275(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    items = []
    for key, count in left[: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(items)}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

276

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

f276([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

277

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

278

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

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

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

279

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

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

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

280

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

281

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

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

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

282

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

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

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

283

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

f283([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 9, 45)

{"best":135,"hits":[0,1,2,3,4,5,6],"rises":4,"sums":[100,107,111,126,116,135,128]}

284

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

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

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

285

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

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

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

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

288

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

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

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

289

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

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

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

290

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

291

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

f291([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

292

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

293

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

294

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

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

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

295

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

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

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

296

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

297

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

f297([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

298

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

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

{"bounds":[0,-3,10,8],"end":[10,8],"far":18,"revisits":[[0,-2],[0,-1],[0,0],[2,5],[3,5]],"steps":30}

299

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

300

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

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

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

301

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

302

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

f302([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

303

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

304

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

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

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

305

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

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

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

306

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

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

f306(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

307

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

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

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

308

def f308(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state 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], 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

f308([('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23), ('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":3,"groups":{"edge":36,"south":150},"top":["CX07","BR70","DL85"],"total":186}

309

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

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

f309(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

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 = []
            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

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

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

311

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

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

f311(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Emberx', 'GARNET', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

312

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

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

{"bounds":[0,-3,9,1],"end":[9,1],"far":11,"revisits":[[0,-2],[0,-1],[0,0],[0,-3],[1,-3]],"steps":30}

313

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

f313([4, 16, 8, 15, 4, 18, 18, 4, 13, 11, 20, 23, 5, 23, 11], 7, 45)

{"best":107,"hits":[0,1,2,3,4,5,6,7,8],"rises":5,"sums":[83,83,80,83,88,107,94,99,106]}

314

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

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

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

315

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

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

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

316

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

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

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

317

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

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

f317(['GARNET', 'delta', 'Ember', 'ivory', 'BLUE', 'frost', 'cyan '], ['Ember', 'GARNETx', 'delta', 'ivory', 'frost', 'cyan ', 'cyan '], ['CYAN'])

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

318

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

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

{"count":7,"items":[["DL",85],["FP",70],["CX",67],["GQ",39],["EV",36]],"missing":["BR"],"total":335}

319

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

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

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

320

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

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

{"count":7,"items":[["DL",91],["FP",76],["CX",73],["GQ",45],["EV",42]],"missing":["BR"],"total":377}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
values = list((4, 16, 8, 15, 4, 18, 18, 4) + (13, 11, 20, 23, 5, 23, 11))
width = 9
limit = 45
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}
token = record['bb']
route = token
cases = {
    107: list(('##.##.', '.#..##', '#.#.#.') + ('##.#.#', '..#.#.', '......')),
    135: list(('##.##.', '.#..##', '#.#.#.') + ('##.#..', '..#...', '......')),
}
board = cases[route]
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
memo = record['cc']
nodes = list(('proxy', 'jobs', 'auth') + ('db', 'worker', 'api', 'ui', 'cache'))
edges = list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'), ('db', 'auth')))
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)}
clue = record['aa'][0]
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')))
limit = 3
route = clue
cases = {
    'auth': 'C',
    'cache': 'H',
}
start = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
stamp = record['dd']
rows = list((('DL85', 'south', 'ready', 7), ('CX22', 'north', 'checked', 17), ('CX59', 'edge', 'hold', 12), ('DL96', 'north', 'void', 15), ('CX33', 'core', 'void', 16), ('BR70', 'edge', 'ready', 12), ('CX07', 'south', 'ready', 23)) + (('AN44', 'edge', 'hold', 3), ('DL81', 'core', 'hold', 3), ('AN18', 'edge', 'void', 18), ('DL55', 'edge', 'void', 9), ('CX92', 'south', 'checked', 13), ('DL29', 'north', 'hold', 3), ('CX66', 'south', 'void', 6)))
rates = dict((('north', 7), ('south', 5)) + (('core', 11), ('edge', 3)))
route = stamp
cases = {
    1: ['checked'],
    3: ['ready'],
}
keep = 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}
ticket = record['bb']
left = list((('AN', 3), ('BR', 3), ('CX', 7)) + (('DL', 9), ('EV', 8), ('FP', 11), ('GQ', 7), ('HR', 2)))
right = list((('AN', 8), ('CX', 9)) + (('DL', 9), ('EV', 4), ('FP', 6), ('GQ', 5), ('HR', 3)))
route = (memo, ticket)
cases = {
    (16, 186): 4,
    (16, 184): 4,
    (14, 186): 4,
    (14, 184): 10,
}
fee = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
badge = record['bb']
route = badge
cases = {
    377: list((('S', 2), ('S', 1), ('N', 3), ('N', 3), ('E', 2), ('N', 1), ('N', 1), ('E', 1)) + (('W', 1), ('E', 3), ('E', 3), ('N', 2), ('E', 2), ('S', 2), ('N', 3))),
    335: list((('S', 2), ('S', 1), ('N', 3), ('S', 3), ('E', 2), ('W', 1), ('N', 1), ('E', 1)) + (('W', 1), ('E', 3), ('E', 3), ('N', 2), ('E', 2), ('S', 2), ('N', 3))),
}
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}
permit = record['bb']
left = list(('GARNET', 'delta', 'Ember') + ('ivory', 'BLUE', 'frost', 'cyan '))
blocked = ['CYAN']
route = permit
cases = {
    11: list(('Ember', 'GARNETx', 'delta') + ('ivory', 'frost', 'cyan ', 'cyan ')),
    18: list(('Emberx', 'GARNET', 'delta') + ('ivory', 'frost', 'cyan ', 'cyan ')),
}
right = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
out['ee'] = record['ee']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))