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

001

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

002

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

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

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

003

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

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

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

004

def f4(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), (1, 1), (-1, -1), (1, -1), (-1, 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

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

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

005

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

f5([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

006

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

007

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

f7([('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"]}

008

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

f8([('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"]}

009

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

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

f9(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

010

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

011

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

f11([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

012

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

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

f12(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

013

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

f13([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

014

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

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

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

015

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

f15([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

016

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

f16([('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"]}

017

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

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

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

018

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

f18([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

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

f19([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

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

f20([('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"]}

021

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

f21([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

022

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

023

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

024

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

f24([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

025

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

026

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

f26([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

027

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

f27([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

028

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

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

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

029

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

f29([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

030

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

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

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

031

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

032

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

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

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

033

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

f33([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')], '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"]}

034

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

035

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

f35([('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"]}

036

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

f36([('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"]}

037

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

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

f37([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

038

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

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

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

039

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

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

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

040

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

f40([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

041

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

f41([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

042

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

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

f42(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

043

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

044

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

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

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

045

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

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

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

046

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

f46([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

047

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

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

f47(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

048

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

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

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

049

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

f49([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

050

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

f50([('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"]}

051

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

f51([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

052

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

f52([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

053

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

054

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

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

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

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

055

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

056

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

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

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

057

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

f57([('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"]}

058

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

f58([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

059

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

f59([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

060

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

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

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

061

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

f61([('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"]}

062

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

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

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

063

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

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

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

064

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

f64([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

065

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

f65([('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"]}

066

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

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

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

067

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

068

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

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

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

069

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

070

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

f70([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

071

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

f71([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

072

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

f72([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

073

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

074

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

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

f74(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

075

def f75(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), (1, 1), (-1, -1), (1, -1), (-1, 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

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

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

076

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

f76([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

077

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

f77([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

079

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

f79([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

080

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

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

f80([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

081

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

082

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

083

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

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

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

084

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

f84([('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"]}

085

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

086

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

087

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

088

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

    def normalize(value):
        return str(value).strip(' \n').upper()[:12]
    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
    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

f88(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

089

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

f89(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

090

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

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

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

091

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

092

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

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

f92([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

093

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

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

f93([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

094

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

f94(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

095

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

f95([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

096

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

097

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

f97([('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"]}

098

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

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

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

099

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

100

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

f100([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

101

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

f101([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

102

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

f102([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

103

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

f103([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

104

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

f104([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

105

def f105(board):
    board = list(board)
    known = set()
    components = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if board[row][col] != '#' or (row, col) in known:
                continue
            cells = []
            queue = [(row, col)]
            known.add((row, col))
            while queue:
                cur = queue.pop()
                cells.append(cur)
                for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    nxt = (cur[0] + dr, cur[1] + dc)
                    if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
                        known.add(nxt)
                        queue.append(nxt)
            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":[[4,1],[0,4],[2,0]],"count":3,"filled":13,"sizes":[8,4,1]}

106

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

f106([('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"]}

107

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

f107([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

108

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

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

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

109

def f109(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)
                        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,4],[2,0]],"count":2,"filled":15,"sizes":[14,1]}

110

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

112

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

f112([('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"]}

113

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

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

f113(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

114

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

f114(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

115

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

f115([('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"]}

116

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

f116([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

117

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

118

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

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

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

119

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

f119([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

120

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

121

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

f121([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

122

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

123

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

f123([('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"]}

124

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

f124(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

125

def f125(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} if any((start in edge for edge in edges)) else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    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

f125([('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"]}

126

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

127

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

f127([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

128

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

129

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

130

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

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

f130([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

131

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

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

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

132

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

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

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

133

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

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

f133([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

134

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

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

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

135

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

f135([('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"]}

136

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

f136([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

137

def f137(rows, keep, ratemap):
    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 * abs(ratemap[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

f137([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

138

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

f138([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

139

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

f139([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

140

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

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

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

141

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

142

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

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

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

143

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

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

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

144

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

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

f144([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

145

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

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

f145([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

146

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

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

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

147

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

f147([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

148

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

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

f148(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

149

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

f149([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

150

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

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

f150(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

151

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

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

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

152

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

f152([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

153

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

154

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

155

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

f155([('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"]}

156

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

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

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

157

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

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

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

158

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

f158([('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"]}

159

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

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

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

160

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

f160([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

161

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

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

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

162

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

f162([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

163

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

164

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

165

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

f165([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

166

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

f166([('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"]}

167

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

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

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

168

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

169

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

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

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

170

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

171

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

172

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

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

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

173

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

f173([('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"]}

174

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

f174([('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"]}

175

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

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

f175([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

176

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

177

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

f177([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

178

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

179

def f179(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 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
            amount += score
    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, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f179([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

180

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

181

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

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

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

182

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

f182([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

183

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

f183([('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"]}

184

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

f184([('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"]}

185

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

f185([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

186

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

f186([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

187

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

f187([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

188

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

f188([('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"]}

189

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

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

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

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

190

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

191

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

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

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

192

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

193

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

194

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

f194([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

195

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

f195([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

196

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

f196([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

197

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

f197([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

198

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

199

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

f199([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

200

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

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

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

201

def f201(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            charge = value * prices[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            sumvalue += charge
    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, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output

f201([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

202

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

203

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

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

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

204

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

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

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

205

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

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

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

206

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

207

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

208

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

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

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

209

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

210

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

f210([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

211

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

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

f211([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

212

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

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

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

213

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

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

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

214

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

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

{"anchors":[[4,1],[0,4],[2,0]],"count":3,"filled":13,"sizes":[8,4,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:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

216

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

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

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

217

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

f217([('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"]}

218

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

f218([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

219

def f219(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        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

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

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

220

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

221

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

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

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

222

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

f222([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

223

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

224

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

225

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

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

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

226

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

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

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

227

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

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

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

228

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

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

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

229

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

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

f229([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

230

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

f230([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

231

def f231(rows, keep, ratemap):
    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}:
            cost = value * ratemap[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(dict.fromkeys(kept)), 'total': amount, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f231([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

232

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

233

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

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

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

234

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

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

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

235

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

f235([('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"]}

236

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

237

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

f237([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

238

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

f238(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

239

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

240

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

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

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

241

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

f241([('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"]}

242

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

243

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

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

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

244

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

245

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

f245([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

246

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

f246([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

247

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

248

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

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

f248(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

249

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

250

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

f250([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

251

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

f251([('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"]}

252

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

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

f252(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

253

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

254

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

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

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

255

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

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

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

256

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

257

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

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

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

258

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

f258([('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"]}

259

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

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

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

260

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

261

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

f261([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

262

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

263

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

f263([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

264

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

f264([('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"]}

265

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

f265([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

266

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

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

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

267

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

268

def f268(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), (1, 1), (-1, -1), (1, -1), (-1, 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

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

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

269

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

270

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

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

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

271

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

f271([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

272

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

273

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

f273([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

274

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

f274([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

275

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

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

f275(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

276

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

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

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

277

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

278

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

279

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

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

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

280

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

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

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

281

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

282

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

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

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

283

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

f283([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

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

f284([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

285

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

286

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

287

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

f287([('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"]}

288

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

f288([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

289

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

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

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

290

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

291

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

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

f291(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

292

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

f292(['Amberx', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyan '], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

293

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

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

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

294

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

f294([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

295

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

296

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

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

f296([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

297

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

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

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

298

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

f298([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

299

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

300

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

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

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

301

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

f301([('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"]}

302

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

f302([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":5,"groups":{"core":506,"edge":51,"north":160,"south":95},"top":["CX30","CX93","AN19"],"total":812}

303

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

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

{"bounds":[-1,-4,9,0],"end":[5,-4],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":29}

304

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

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

f304([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

305

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

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

{"count":6,"items":[["DL",71],["FP",55],["BR",41],["CX",33],["EV",21]],"missing":["AN","HR"],"total":228}

306

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

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

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

307

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

f307([('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"]}

308

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

f308([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 12, 39)

{"best":172,"hits":[0,1,2,3],"rises":1,"sums":[172,162,144,146]}

309

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

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

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

310

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

f310([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

311

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

312

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

f312([' Amber', 'Ember', 'helium', 'BLUE', 'ivory', 'frost', 'cyanx'], ['ivory', 'Ember', 'delta', 'GARNET', 'BLUE', ' Amber', 'cyan '], ['CYAN'])

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

313

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

f313([15, 23, 10, 6, 23, 11, 9, 7, 23, 22, 13, 10, 5, 5, 12], 10, 39)

{"best":149,"hits":[0,1,2,3,4,5],"rises":0,"sums":[149,147,134,129,128,117]}

314

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

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

{"bounds":[-1,-4,9,0],"end":[7,-3],"far":13,"revisits":[[0,-3],[1,-3],[8,-4],[7,-4],[9,-4]],"steps":30}

315

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

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

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

316

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

f316([('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"]}

317

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

f317([('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3), ('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})

{"accepted":5,"groups":{"core":506,"edge":85,"north":112,"south":95},"top":["CX30","CX93","AN19"],"total":798}

318

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

f318([('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"]}

319

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

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

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

320

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

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

{"count":6,"items":[["DL",61],["FP",55],["BR",41],["EV",41],["CX",33]],"missing":["AN","HR"],"total":238}

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
board = list(('....#.', '....#.') + ('#...##', '....#.', '.#####', '.####.'))
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)}
signal = record['cc']
left = list((('AN', 8), ('BR', 8), ('CX', 8), ('DL', 10), ('EV', 5)) + (('FP', 9), ('GQ', 2), ('HR', 5)))
fee = 1
route = signal
cases = {
    15: list((('BR', 5), ('CX', 4), ('DL', 7), ('EV', 4)) + (('FP', 6), ('GQ', 3))),
    13: list((('BR', 5), ('CX', 4), ('DL', 6), ('EV', 8)) + (('FP', 6), ('GQ', 3))),
}
right = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
token = record['bb']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A')))
start = 'A'
limit = 2
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)}
memo = record['dd']
route = memo
cases = {
    6: list((('E', 2), ('S', 3), ('W', 3), ('E', 1), ('E', 1), ('S', 1), ('E', 3)) + (('E', 2), ('E', 1), ('E', 2), ('W', 2), ('E', 2), ('W', 2), ('W', 2), ('N', 1), ('S', 1))),
    1: list((('E', 2), ('S', 3), ('W', 3), ('E', 1), ('E', 1), ('S', 1), ('E', 3)) + (('E', 2), ('E', 1), ('E', 2), ('W', 2), ('E', 2), ('W', 2), ('W', 2), ('N', 1), ('E', 2))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
clue = record['ee']
values = list((15, 23, 10, 6, 23, 11, 9, 7) + (23, 22, 13, 10, 5, 5, 12))
limit = 39
route = clue
cases = {
    30: 10,
    29: 12,
}
width = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
stamp = record['bb']
nodes = list(('api', 'worker', 'proxy', 'jobs') + ('ui', 'cache', 'auth', 'db'))
route = (token, stamp)
cases = {
    (228, 172): list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'))),
    (228, 149): list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
    (238, 172): list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
    (238, 149): list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
}
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)}
ticket = record['aa'][3]
right = list(('ivory', 'Ember') + ('delta', 'GARNET', 'BLUE', ' Amber', 'cyan '))
blocked = ['CYAN']
route = ticket
cases = {
    'api': list(('Amberx', 'Ember') + ('helium', 'BLUE', 'ivory', 'frost', 'cyan ')),
    'jobs': list((' Amber', 'Ember') + ('helium', 'BLUE', 'ivory', 'frost', 'cyanx')),
}
left = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
badge = record['ee']
rows = list((('AN19', 'north', 'ready', 16), ('BR56', 'south', 'ready', 19), ('CX93', 'core', 'checked', 23), ('CX30', 'core', 'ready', 23), ('BR67', 'edge', 'hold', 23), ('BR04', 'south', 'void', 16), ('BR41', 'north', 'void', 6), ('DL78', 'south', 'hold', 3)) + (('CX15', 'south', 'hold', 8), ('BR52', 'edge', 'hold', 5), ('DL89', 'edge', 'ready', 17), ('DL26', 'core', 'void', 6), ('DL63', 'south', 'hold', 4), ('BR00', 'core', 'hold', 24)))
keep = list(('ready',) + ('checked',))
route = badge
cases = {
    19: dict((('north', 10), ('south', 5), ('core', 11)) + (('edge', 3),)),
    14: dict((('north', 7), ('south', 5), ('core', 11)) + (('edge', 5),)),
}
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}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))