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

001

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

002

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

003

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

004

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

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

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

005

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

f5([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

006

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

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

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

007

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

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

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

008

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

009

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

010

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

f10([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

011

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

f11([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

012

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

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

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

013

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

f13([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

014

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

f14([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

015

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

016

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

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

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

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

017

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

f17([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

018

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

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

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

019

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

f19([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

020

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

021

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

f21([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

022

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

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

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

023

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

024

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

025

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

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

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

026

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

f26([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

027

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

028

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

029

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

030

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

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

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

031

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

f31([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

032

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

f32([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

033

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

034

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

035

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

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

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

036

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

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

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

037

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

f37([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

038

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

039

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

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

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

040

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

f40([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

041

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

f41([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

042

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

043

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

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

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

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

044

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

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

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

045

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

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

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

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

046

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

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

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

047

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

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

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

048

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

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

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

049

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

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

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

050

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

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

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

051

def f51(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)
    steps = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    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

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

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

052

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

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

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

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

053

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

054

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

055

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

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

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

056

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

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

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

057

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

f57([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

058

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

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

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

059

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

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

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

060

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

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

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

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

061

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

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

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

062

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

063

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

064

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

f64([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

065

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

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

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

066

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

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

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

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

067

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

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

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

068

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

069

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

070

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

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

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

071

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

f71([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

072

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

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

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

073

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

074

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

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

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

075

def f75(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    listing = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = 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 nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[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

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

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

076

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

077

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

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

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

078

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

f78([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

079

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

080

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

081

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

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

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

082

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

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

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

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

083

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

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

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

084

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

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

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

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

085

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

f85([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

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

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

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

087

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

088

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

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

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

089

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

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

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

090

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

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

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

091

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

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

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

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

092

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

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

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

093

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

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

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

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(['Ember', 'GARNET', 'ivory', 'BLUE', 'delta', ' Amber', 'cyan '], ['GARNET', 'BLUE', 'frost', 'Ember', 'helium', 'ivory', 'cyan '], ['BLUE'])

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

095

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

096

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

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

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

097

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

f97([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

098

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

099

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

f99([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

100

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

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

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

101

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

102

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

f102([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

103

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

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

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

104

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

105

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

106

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

107

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

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

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

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

108

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

109

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

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

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

110

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

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

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

111

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

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

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

112

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

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

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

113

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

f113([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

114

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

f114([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

115

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

f115([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

116

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

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

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

117

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

118

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

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

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

119

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

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

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

120

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

121

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

122

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

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

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

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

123

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

f123([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

124

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

125

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

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

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

126

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

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

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

127

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

128

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

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

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

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

129

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

f129([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

130

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

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

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

131

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

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

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

132

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

133

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

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

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

134

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

135

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

f135([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

136

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

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

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

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

137

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

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

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

138

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

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

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

139

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

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

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

140

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

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

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

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

141

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

f141([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

142

def f142(rows, keep, prices):
    rows = list(rows)
    matches = []
    buckets = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            cost = value * prices[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

f142([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

143

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

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

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

144

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

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

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

145

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

f145([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

146

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

147

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

f147([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

148

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

f148([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

149

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

f149([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

150

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

f150([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

151

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

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

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

152

def f152(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 = []
    groups = []
    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))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[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

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

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

153

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

f153([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

154

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

155

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

156

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

f156([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

157

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

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

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

158

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

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

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

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

159

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

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

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

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

160

def f160(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[:64]) 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': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output

f160([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

161

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

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

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

162

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

163

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

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

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

164

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

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

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

165

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

f165([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

166

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

f166([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

167

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

f167([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

168

def f168(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]
    ups = 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': ups}
    output = dict()
    output.update(returnvalue)
    return output

f168([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

169

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

170

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

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

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

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

171

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

f171([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

172

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

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

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

173

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

f173([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

174

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

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

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

175

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

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

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

176

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

177

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

178

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

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

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

179

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

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

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

180

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

f180([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

181

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

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

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

182

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

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

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

183

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

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

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

184

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

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

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

185

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

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

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

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

186

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

f186([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

187

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

f187([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

188

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

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

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

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

189

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

190

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

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

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

191

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

f191([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

192

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

193

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

f193([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

194

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

195

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

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

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

196

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

f196([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

197

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

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

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

198

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

f198([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

199

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

f199([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

200

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

f200([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

201

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

202

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

203

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

204

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

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

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

205

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

f205([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

206

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

207

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

f207([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

208

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

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

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

209

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

210

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

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

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

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

211

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

f211([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

212

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

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

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

213

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

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

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

214

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

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

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

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

215

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

216

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

217

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

218

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

f218([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

219

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

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

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

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

220

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

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

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

221

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

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

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

222

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

223

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

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

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

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

224

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

225

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

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

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

226

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

f226([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

227

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

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

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

228

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

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

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

229

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

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

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

230

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

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

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

231

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

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

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

232

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

f232([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

233

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

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

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

234

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

235

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

f235([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

236

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

237

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

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

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

238

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

f238([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

239

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

240

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

f240([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

241

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

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

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

242

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

243

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

f243([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

244

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

f244([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

245

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

f245([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

246

def f246(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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()
    result = []
    groups = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

247

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

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

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

248

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

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

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

249

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

250

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

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

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

251

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

f251([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

252

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

f252([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

253

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

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

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

254

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

f254([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

255

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

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

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

256

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

257

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

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

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

258

def f258(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] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    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[:3], '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'), ('C', 'E'), ('H', 'B')], 'H', 3)

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

259

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

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

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

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

260

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

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

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

261

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

f261([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

262

def f262(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    handled = set()
    listing = []
    rounds = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=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:
            handled.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

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

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

263

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

264

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

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

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

265

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

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

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

266

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

267

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

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

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

268

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

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

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

269

def f269(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.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[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output

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

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

270

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

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

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

271

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

f271([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

272

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

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

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

273

def f273(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 {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            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

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

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

274

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

f274([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

275

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

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

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

276

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

f276([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":462,"edge":42,"north":350},"top":["AN37","BR96","AN44"],"total":854}

277

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

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

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

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

279

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

f279([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

280

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

f280([14, 23, 10, 18, 12, 10, 21, 23, 5, 7, 9, 9, 14, 22, 5], 3, 44)

{"best":54,"hits":[0,1,5,6,11],"rises":6,"sums":[47,51,40,40,43,54,49,35,21,25,32,45,41]}

281

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

282

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

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

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

283

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

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

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

284

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

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

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

285

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

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

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

286

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

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

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

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

287

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

f287([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

288

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

f288([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

289

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

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

{"count":8,"items":[["CX",86],["EV",83],["BR",74],["HR",74],["AN",57]],"missing":[],"total":467}

290

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

291

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

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

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

292

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

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

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

293

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

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

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

294

def f294(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    finished = set()
    listing = []
    groups = []
    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))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[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

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

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

295

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

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

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

296

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

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

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

297

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

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

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

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

298

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

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

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

299

def f299(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], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output

f299([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

300

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

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

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

301

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

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

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

302

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

f302([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

303

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

304

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

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

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

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

305

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

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

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

306

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

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

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

307

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

f307([14, 26, 10, 18, 12, 10, 21, 23, 5, 7, 7, 9, 14, 22, 5], 3, 43)

{"best":54,"hits":[0,1,4,5,6,11],"rises":6,"sums":[50,54,40,40,43,54,49,35,19,23,30,45,41]}

308

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

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

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

309

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

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

{"anchors":[[3,3],[3,0],[0,1],[1,4]],"count":4,"filled":17,"sizes":[7,6,3,1]}

310

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

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

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

311

def f311(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            score = value * prices[group]
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            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

f311([('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15), ('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})

{"accepted":6,"groups":{"core":484,"edge":42,"north":343},"top":["AN37","BR96","AN44"],"total":869}

312

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

313

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

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

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

314

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

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

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

315

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

316

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

317

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

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

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

318

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

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

{"count":8,"items":[["CX",92],["EV",89],["BR",80],["HR",80],["AN",63]],"missing":[],"total":515}

319

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

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

{"anchors":[[0,1],[3,3],[1,4]],"count":3,"filled":17,"sizes":[9,7,1]}

320

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

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

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

Final Query

Give me the output of the final query without executing it!

import json, re
from collections import deque
out = {}
nodes = list(('worker', 'proxy', 'db') + ('auth', 'api', 'cache', 'jobs', 'ui'))
edges = list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')))
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
stamp = record['aa'][0]
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G')) + (('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
limit = 3
route = stamp
cases = {
    'cache': 'E',
    'auth': 'H',
}
start = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
ticket = record['aa'][0]
width = 3
route = stamp
cases = {
    'auth': (list((14, 23, 10, 18, 12, 10, 21) + (23, 5, 7, 9, 9, 14, 22, 5)), 44),
    'cache': (list((14, 26, 10, 18, 12, 10, 21) + (23, 5, 7, 7, 9, 14, 22, 5)), 43),
}
values, limit = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
badge = record['aa'][2]
left = list((('AN', 11), ('BR', 12), ('CX', 12)) + (('DL', 5), ('EV', 9), ('FP', 3), ('GQ', 10), ('HR', 9)))
right = list((('AN', 5), ('BR', 6), ('CX', 7)) + (('DL', 9), ('EV', 9), ('FP', 4), ('GQ', 3), ('HR', 8)))
options = {
    'cache': ('near', ticket),
    'auth': ('far', badge),
}
route = options[stamp]
cases = {
    ('near', 'E'): 8,
    ('near', 'H'): 2,
    ('far', 4): 2,
    ('far', 5): 2,
}
fee = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
permit = record['bb']
left = list(('Ember', 'GARNET', 'ivory', 'BLUE') + ('delta', ' Amber', 'cyan '))
right = list(('GARNET', 'BLUE', 'frost', 'Ember') + ('helium', 'ivory', 'cyan '))
route = badge
cases = {
    5: ['delta'],
    4: ['BLUE'],
}
blocked = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
signal = record['ee']
route = (permit, signal)
cases = {
    (515, 20): list((('N', 3), ('E', 5), ('W', 3), ('N', 1), ('S', 3), ('N', 3), ('W', 1)) + (('W', 2), ('S', 2), ('E', 1), ('N', 1), ('N', 3), ('E', 3), ('E', 1), ('S', 3))),
    (515, 24): list((('N', 3), ('E', 3), ('W', 3), ('N', 1), ('S', 3), ('N', 3), ('W', 1)) + (('W', 2), ('S', 2), ('E', 1), ('N', 1), ('N', 3), ('E', 3), ('E', 1), ('S', 6))),
    (467, 20): list((('N', 3), ('E', 3), ('W', 3), ('N', 1), ('S', 3), ('N', 3), ('W', 1)) + (('W', 2), ('S', 2), ('E', 1), ('N', 1), ('N', 3), ('E', 3), ('E', 1), ('S', 6))),
    (467, 24): list((('N', 3), ('E', 3), ('W', 3), ('N', 1), ('S', 3), ('N', 3), ('W', 1)) + (('W', 2), ('S', 2), ('E', 1), ('N', 1), ('N', 3), ('E', 3), ('E', 1), ('S', 6))),
}
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}
token = record['bb']
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
route = token
cases = {
    8: list((('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15)) + (('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 20), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 8), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8))),
    10: list((('DL00', 'south', 'hold', 5), ('AN37', 'core', 'ready', 22), ('DL74', 'north', 'void', 8), ('DL11', 'south', 'void', 21), ('CX48', 'north', 'ready', 19), ('DL85', 'edge', 'void', 15)) + (('DL22', 'edge', 'checked', 14), ('AN59', 'south', 'hold', 21), ('BR96', 'core', 'ready', 22), ('AN33', 'south', 'hold', 3), ('CX70', 'north', 'ready', 7), ('DL07', 'south', 'hold', 6), ('AN44', 'north', 'checked', 23), ('CX81', 'north', 'void', 8))),
}
rows = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
memo = record['bb']
route = memo
cases = {
    869: list(('.#....', '##..#.', '#.....', '#..###') + ('###..#', '#..###')),
    854: list(('.#....', '##..#.', '......', '##.###') + ('###..#', '#..###')),
}
board = cases[route]
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))