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

001

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

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

f1([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

002

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

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

f2([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

003

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

f3([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

004

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

005

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

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

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

006

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

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

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

007

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

008

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

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

f8([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

009

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

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

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

010

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

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

f10([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

011

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

012

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

f12(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

013

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

014

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

f14(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

015

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

016

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

017

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

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

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

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')], 'A', 2)

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

019

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

f19([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

020

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

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

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

021

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

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

f21([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

022

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

f22([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

023

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

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

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

024

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

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

f24([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

025

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

026

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

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

f26([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

027

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

f27([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

028

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

f28([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

029

def f29(board):
    board = list(board)
    known = set()
    pieces = []
    for row in range(min(len(board), 10 + (len(board) - len(board)))):
        for col in range(len(board[row])):
            if col >= 12 or board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            work = [(row, col)]
            known.add((row, col))
            while work:
                cur = work.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        if len(known) >= 100:
                            continue
                        work.append(nxt)
            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":[[3,5],[1,2],[5,2],[1,4],[4,1]],"count":5,"filled":11,"sizes":[4,3,2,1,1]}

030

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

031

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

033

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

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

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

034

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

035

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

f35([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

036

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

f36([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

037

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

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

f37([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

038

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

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

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

039

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

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

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

040

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

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

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

041

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

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

f41([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

042

def f42(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] < 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)
    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')], 'A', 2)

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

043

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

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

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

044

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

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

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

045

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

f45([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

046

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

047

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

048

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

049

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

050

def f50(rows, keep, prices):
    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 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(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f50([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

051

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

f51([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

052

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

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

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

053

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

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

054

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

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

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

055

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

056

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

f56([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

057

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

f57([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

058

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

059

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

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

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

060

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

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

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

061

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

062

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

f62(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

063

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

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

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

064

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

065

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

f65([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

066

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

f66([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

067

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

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

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

068

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

f68([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

069

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

f69([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

070

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

071

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

072

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

073

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

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

f73([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

074

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

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

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

075

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

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

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

076

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

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

f76([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

077

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

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

f77([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

078

def f78(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:
        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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

079

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

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

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

080

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

f80([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

081

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

f81([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

082

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

f82([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

083

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

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

f83([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

084

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

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

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

085

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

086

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

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

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

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

087

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

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

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

088

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

f88([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

089

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

f89([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

090

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

f90(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

091

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

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

f91([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

092

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

093

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

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

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

094

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

095

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

f95([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

096

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

f96([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

097

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

098

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

f98(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

099

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

100

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

101

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

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

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

102

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

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

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

103

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

104

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

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

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

105

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

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

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

106

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

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

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

107

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

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

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

108

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

f108([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

109

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

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

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

110

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

f110(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

111

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

112

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

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

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

113

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

f113([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

114

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

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

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

115

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

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

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

116

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

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

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

117

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

f117(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

118

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

f118(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

119

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

120

def f120(board):
    board = list(board)
    known = 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 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

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

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

121

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

f121([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

122

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

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

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

123

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

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

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

124

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

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

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

125

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

f125([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

126

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

f126([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

127

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

f127([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

128

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

f128([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

129

def f129(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 += dx
            y = max(-64, min(64, y + dy))
            used = min(64, used + 1)
            point = (x, y)
            if point in known and list(point) not in 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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

130

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

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

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

131

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

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

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

132

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

133

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

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

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

134

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

135

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

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

f135([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

136

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

f136([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

137

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

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

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

138

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

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

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

139

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

140

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

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

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

141

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

142

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

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

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

143

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

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

f143([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

144

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

f144([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

145

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

f145([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

146

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

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

f146([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

147

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

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

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

148

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

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

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

149

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

f149(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

150

def f150(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        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 and (not nxt.startswith('Z')):
                    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[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

151

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

f151([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

152

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

f152(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

153

def f153(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 * 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

f153([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

154

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

f154([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

155

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

156

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

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

f156([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

157

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

158

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

159

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

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

f159([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

160

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

161

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

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

f161([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

162

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

163

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

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

f163([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

164

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

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

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

165

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

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

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

166

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

167

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

168

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

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

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

169

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

170

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

f170([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

171

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

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

f171([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

172

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

173

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

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

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

174

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

175

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

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

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

176

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

f176([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

177

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

178

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

f178([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

179

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

f179([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

180

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

f180([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

181

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

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

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

182

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

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

f182([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

183

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

184

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

f184([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

185

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

f185([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

186

def f186(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)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                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

f186(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

187

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

f187(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

188

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

f188([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

189

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

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

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

190

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

f190([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

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

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

193

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

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

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

194

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

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

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

195

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

f195([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

196

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

197

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

f197([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

198

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

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

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

199

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

f199([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

200

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

f200([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

201

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

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

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

202

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

203

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

f203([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

204

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

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

f204([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

205

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

206

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

f206([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

207

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

208

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

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

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

209

def f209(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.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(routes.get(cur, [])):
                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

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

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

210

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

211

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

    def canon(value):
        return str(value).strip(' \n').upper()[:12]
    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((min(len(value), 8) for value in both))}
    output = dict()
    output.update(returnvalue)
    return output

f211([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

212

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

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

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

213

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

f213([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

214

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

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

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

215

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

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

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

216

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

217

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

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

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

218

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

219

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

f219([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

220

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

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

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

221

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

222

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

223

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

f223([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

224

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

225

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

f225([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

226

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

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

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

227

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

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

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

228

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

f228([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

229

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

f229([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

230

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

231

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

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

f231([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

232

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

f232([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

233

def f233(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):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in 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

f233(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

234

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

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

f234([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

235

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

236

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

f236(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

237

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

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

f237([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

238

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

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

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

239

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

f239([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

240

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

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

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

241

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

f241([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

242

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

f242([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

243

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

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

f243([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

244

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

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

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

245

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

246

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

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

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

247

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

f247(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

248

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

249

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

f249([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

250

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

f250([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

251

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

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

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

252

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

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

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

253

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

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

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

254

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

255

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

256

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

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

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

257

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

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

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

258

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

f258([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

259

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

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

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

260

def f260(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in factors 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({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

261

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

f261([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

262

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

f262([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

263

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

264

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

f264(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

265

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

f265([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

266

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

267

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

268

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

269

def f269(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 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
            amount += score
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f269([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

270

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

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

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

271

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

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

f271([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

272

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

273

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

f273([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

274

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

f274([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

275

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

f275([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

276

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

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

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

277

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

f277([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

278

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

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

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

279

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

280

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

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

f281(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

282

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

f282([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

283

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

f283([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

284

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

f284([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

285

def f285(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:
            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

f285([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":460},"top":["AN71","DL45","DL38"],"total":739}

286

def f286(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
    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)
    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

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

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

287

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

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

f287([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

288

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

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

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

289

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

f289([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

290

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

f290(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

291

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

f291([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

292

def f292(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, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    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

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

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

293

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

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

f293([' Amber', 'delta', 'ivoryx', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","IVORYX"],"both":["AMBER","BLUE","CYAN","DELTA"],"left":["FROST","IVORYX"],"right":["GARNET"],"score":18}

294

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

f294([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

295

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

f295(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'), ('auth', '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(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output

f296([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

297

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

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

{"count":5,"items":[["CX",46],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":137}

298

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

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

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

299

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

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

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

300

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

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

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

301

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

f301([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

302

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

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

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

303

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

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

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

304

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

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

f304([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

305

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

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

f305([' Amber', 'deltax', 'ivory', 'cyan ', 'BLUE', 'frost', 'Ember'], ['Ember', ' Amber', 'GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'], ['EMBER'])

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

306

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

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

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

307

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

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

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

308

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

f308([16, 24, 15, 5, 11, 22, 15, 19, 7, 18, 20, 18, 24, 5, 23], 4, 53)

{"best":80,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,67,63,59,64,63,80,67,70]}

309

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

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

{"count":5,"items":[["CX",73],["DL",28],["GQ",28],["FP",22],["AN",13]],"missing":["BR","EV","HR"],"total":164}

310

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

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

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

311

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

f311(['cache', 'api', 'db', 'worker', 'ui', 'auth', 'jobs', 'proxy'], [('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"]}

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

313

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

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

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

314

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

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

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

315

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

f315([('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9), ('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})

{"accepted":7,"groups":{"core":198,"edge":81,"north":322},"top":["DL45","AN71","DL38"],"total":601}

316

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

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

{"bounds":[-12,-4,0,1],"end":[-11,1],"far":14,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":32}

317

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

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

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

318

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

f318([16, 24, 15, 5, 11, 22, 15, 22, 7, 13, 20, 18, 24, 5, 23], 4, 53)

{"best":75,"hits":[0,1,2,3,4,5,6,7,8,9,10,11],"rises":4,"sums":[60,55,53,53,70,66,57,62,58,75,67,70]}

319

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

320

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

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

{"bounds":[-12,-4,0,3],"end":[-12,3],"far":15,"revisits":[[-5,-4],[-4,-4],[-6,-4],[-10,0],[-10,-1]],"steps":33}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
left = list((' Amber', 'deltax') + ('ivory', 'cyan ', 'BLUE', 'frost', 'Ember'))
right = list(('Ember', ' Amber') + ('GARNET', 'cyan ', 'delta', 'BLUE', 'Ember'))
blocked = ['EMBER']
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))}
permit = record['ee']
rows = list((('DL38', 'north', 'checked', 11), ('AN75', 'edge', 'void', 11), ('BR12', 'north', 'checked', 5), ('BR49', 'south', 'void', 16), ('AN86', 'edge', 'checked', 22), ('BR23', 'south', 'void', 10), ('BR60', 'edge', 'ready', 5), ('DL97', 'edge', 'hold', 9)) + (('BR34', 'core', 'void', 24), ('AN71', 'north', 'ready', 22), ('BR08', 'core', 'void', 19), ('DL45', 'core', 'checked', 18), ('DL82', 'north', 'checked', 8), ('AN19', 'core', 'void', 13)))
keep = list(('ready',) + ('checked',))
route = permit
cases = {
    18: dict((('north', 10), ('south', 5), ('core', 11)) + (('edge', 3),)),
    13: dict((('north', 7), ('south', 9), ('core', 11)) + (('edge', 3),)),
}
rates = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
signal = record['bb']
right = list((('AN', 3), ('CX', 9)) + (('DL', 3), ('FP', 7), ('GQ', 9)))
fee = 1
route = permit
cases = {
    13: list((('AN', 4), ('BR', 6), ('CX', 5), ('DL', 9)) + (('EV', 10), ('FP', 3), ('GQ', 3), ('HR', 10))),
    18: list((('AN', 4), ('BR', 6), ('CX', 8), ('DL', 9)) + (('EV', 8), ('FP', 3), ('GQ', 3), ('HR', 10))),
}
left = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
token = record['bb']
route = (signal, token)
cases = {
    (739, 164): list((('S', 3), ('W', 1), ('S', 1), ('W', 2), ('W', 3), ('E', 2), ('W', 3)) + (('N', 1), ('N', 1), ('W', 3), ('N', 1), ('N', 2), ('S', 3), ('W', 2), ('N', 3), ('N', 2))),
    (739, 137): list((('S', 3), ('W', 1), ('S', 1), ('W', 2), ('W', 3), ('E', 2), ('W', 3)) + (('N', 1), ('N', 1), ('W', 3), ('N', 1), ('N', 2), ('S', 3), ('W', 2), ('N', 3), ('N', 2))),
    (601, 164): list((('S', 3), ('W', 1), ('S', 1), ('W', 2), ('W', 3), ('E', 2), ('W', 3)) + (('N', 1), ('N', 1), ('W', 3), ('N', 1), ('N', 2), ('S', 3), ('W', 2), ('N', 3), ('N', 2))),
    (601, 137): list((('S', 3), ('W', 1), ('S', 1), ('W', 2), ('W', 3), ('E', 2), ('W', 3)) + (('N', 1), ('N', 1), ('W', 3), ('N', 1), ('N', 2), ('S', 3), ('W', 2), ('N', 3), ('E', 1))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
memo = record['bb']
nodes = list(('cache', 'api', 'db', 'worker', 'ui') + ('auth', 'jobs', 'proxy'))
route = memo
cases = {
    14: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'), ('auth', 'db'))),
    15: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'), ('db', 'auth'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
clue = record['aa'][0]
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')))
start = 'A'
route = clue
cases = {
    'cache': 0,
    'auth': 2,
}
limit = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
stamp = record['dd']
width = 4
limit = 53
route = stamp
cases = {
    6: list((16, 24, 15, 5, 11, 22) + (15, 19, 7, 18, 20, 18, 24, 5, 23)),
    1: list((16, 24, 15, 5, 11, 22) + (15, 22, 7, 13, 20, 18, 24, 5, 23)),
}
values = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
ticket = record['bb']
route = ticket
cases = {
    75: list(('..#...', '..#.#.', '..#...', '..#..#') + ('.#..##', '#.##.#')),
    80: 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)}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))