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

### 001

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

```
f1([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 002

```python
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":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 003

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

```
f3([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 004

```python
def f4(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()
    result = []
    rounds = []
    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[:1] if any((str(node).isupper() for node in nodes)) else available
        rounds.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                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
```

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

### 005

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

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

### 006

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 007

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

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

```
f7(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 008

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

```
f8([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 009

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

```
f9([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 010

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

```
f10([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 011

```python
def f11(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        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 rootsource[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

### 012

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

```
f12(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 013

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

```
f13(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 014

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 015

```python
def f15(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f15(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 016

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 017

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 018

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 019

```python
def f19(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f19(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 020

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 021

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

```
f21(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 022

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

```
f22([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 023

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

```
f23([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 024

```python
def f24(left, right, banned):
    left = list(left)

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

```
f24(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 025

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

```
f25([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 026

```python
def f26(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 = []
            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
```

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 027

```python
def f27(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f27(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 028

```python
def f28(board):
    board = list(board)
    found = set()
    pieces = []
    for row in range(len(board)):
        for col in range(len(board[0])):
            if col >= 12 or board[row][col] != '#' or (row, col) in found:
                continue
            cells = []
            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)
            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
```

```
f28(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 029

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

```
f29([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 030

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 031

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

```
f31([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 032

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 033

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

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

### 034

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

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

### 035

```python
def f35(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
```

```
f35(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 036

```python
def f36(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
```

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 037

```python
def f37(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * abs(prices[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': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f37([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 038

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

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

### 039

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 040

```python
def f40(left, right, excluded):
    left = list(left)

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

```
f40(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 041

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 042

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

```
f42([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 043

```python
def f43(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f43(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 044

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

```
f44([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 045

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

```
f45([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 046

```python
def f46(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    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):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            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
```

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

### 047

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

```
f47([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 048

```python
def f48(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f48(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 049

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

```
f49([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 050

```python
def f50(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
```

```
f50(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 051

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

```
f51([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 052

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

```
f52([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 053

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

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

### 054

```python
def f54(left, right, banned):
    left = list(left)

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

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

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 055

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

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

### 056

```python
def f56(left, right, excluded):
    left = list(left)

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

```
f56(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 057

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

```
f57([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 058

```python
def f58(left, right, excluded):
    left = list(left)

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

```
f58(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 059

```python
def f59(left, right, ignored):
    left = list(left)

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

```
f59(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 060

```python
def f60(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f60(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 061

```python
def f61(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]))
    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
```

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 062

```python
def f62(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f62(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 063

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

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

### 064

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

```
f64([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 065

```python
def f65(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, min(65, 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
```

```
f65([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 066

```python
def f66(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f66(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 067

```python
def f67(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f67(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 068

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

```
f68([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 069

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

```
f69([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 070

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

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

### 071

```python
def f71(left, right, excluded):
    left = list(left)

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

```
f71(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 072

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

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

### 073

```python
def f73(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    grand = 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
            grand += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': grand, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f73([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 074

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 075

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

```
f75([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 076

```python
def f76(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f76(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 077

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

```
f77([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 078

```python
def f78(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f78(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 079

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

```
f79([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 080

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

```
f80(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 081

```python
def f81(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    rootsource = dict(needs)
    handled = set()
    sequence = []
    groups = []
    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), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

### 082

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

```
f82([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 083

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

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

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

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 084

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

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

```
f84(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 085

```python
def f85(left, right, ignored):
    left = list(left)

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

```
f85(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 086

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 087

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

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

### 088

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 089

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 090

```python
def f90(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f90(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 091

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

```
f91([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 092

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

```
f92([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 093

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

```
f93([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 094

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

```
f94([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 095

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

```
f95(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 096

```python
def f96(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in tallies.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f96(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 097

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

```
f97([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 098

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

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

### 099

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

```
f99([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 100

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 101

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

```
f101([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 102

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

```
f102([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 103

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

```
f103([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 104

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

```
f104([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 105

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 106

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 107

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

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

```
f107(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 108

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 109

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

```
f109([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 110

```python
def f110(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):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            complete.add(node)
            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
```

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

### 111

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

```
f111(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 112

```python
def f112(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
```

```
f112([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 113

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

```
f113([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 114

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

```
f114([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 115

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

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

### 116

```python
def f116(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f116(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 117

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

```
f117([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 118

```python
def f118(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f118(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 119

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

```
f119([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 120

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

```
f120([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 121

```python
def f121(left, right, excluded):
    left = list(left)

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

```
f121(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 122

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 123

```python
def f123(left, right, ignored):
    left = list(left)

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

```
f123(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 124

```python
def f124(left, right, ignored):
    left = list(left)

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

```
f124(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 125

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

```
f125([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 126

```python
def f126(left, right, ignored):
    left = list(left)

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

```
f126(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 127

```python
def f127(left, right, excluded):
    left = list(left)

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

```
f127(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 128

```python
def f128(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f128(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 129

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 130

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

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

### 131

```python
def f131(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), 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]:
                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
```

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

### 132

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

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

```
f132(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 133

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

```
f133([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 134

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

```
f134([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 135

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 136

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

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

### 137

```python
def f137(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f137(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 138

```python
def f138(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f138(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 139

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

```
f139([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 140

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

```
f140([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 141

```python
def f141(left, right, excluded):
    left = list(left)

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

```
f141(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 142

```python
def f142(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]))
    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
```

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 143

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

```
f143([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 144

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

```
f144([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 145

```python
def f145(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f145(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 146

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

```
f146([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 147

```python
def f147(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
```

```
f147([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 148

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

```
f148([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 149

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

```
f149([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 150

```python
def f150(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f150(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 151

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

```
f151([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 152

```python
def f152(left, right, ignored):
    left = list(left)

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

```
f152(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 153

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

```
f153([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 154

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

```
f154([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 155

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

```
f155([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 156

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 157

```python
def f157(left, right, banned):
    left = list(left)

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

```
f157(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 158

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 159

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

```
f159([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 160

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

```
f160([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 161

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

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

```python
def f162(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
```

```
f162(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 163

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

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

### 164

```python
def f164(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f164(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 165

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

```
f165([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 166

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

```
f166([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 167

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

```
f167([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 168

```python
def f168(left, right, excluded):
    left = list(left)

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

```
f168(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 169

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

```
f169([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 170

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

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

```
f170(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 171

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

```
f171([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 172

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

```
f172([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 173

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

```
f173([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 174

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 175

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 176

```python
def f176(left, right, excluded):
    left = list(left)

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

```
f176(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 177

```python
def f177(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
```

```
f177(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 178

```python
def f178(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f178(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 179

```python
def f179(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f179(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 180

```python
def f180(left, right, excluded):
    left = list(left)

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

```
f180(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 181

```python
def f181(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f181(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 182

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

```
f182(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 183

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

```
f183(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 184

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

```
f184([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 185

```python
def f185(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
```

```
f185(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 186

```python
def f186(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]
    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
```

```
f186([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 187

```python
def f187(left, right, excluded):
    left = list(left)

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

```
f187(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 188

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

```
f188([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 189

```python
def f189(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap and rate0 != 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left[: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
```

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 190

```python
def f190(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f190(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 191

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

```
f191([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 192

```python
def f192(left, right, banned):
    left = list(left)

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

```
f192(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 193

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

```
f193([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 194

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 195

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

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

### 196

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 197

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

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

### 198

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

```
f198([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 199

```python
def f199(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    buckets = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            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([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 200

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

```
f200([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 201

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

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

### 202

```python
def f202(left, right, ignored):
    left = list(left)

    def canon(value):
        return str(value).strip().upper()[:12]
    ignored = {canon(value) for value in ignored}
    a = {canon(value) for value in left} - ignored
    b = {canon(value) for value in right if canon(value) != ''} - ignored
    both = a & b
    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
```

```
f202(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 203

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 204

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

```
f204([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 205

```python
def f205(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum(values[pos:pos + size]))
    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
```

```
f205([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 206

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 207

```python
def f207(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f207(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 208

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

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

### 209

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 210

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 211

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

```
f211(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 212

```python
def f212(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f212(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 213

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

```
f213(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 214

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

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

```
f214(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 215

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

```
f215([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 216

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

```
f216([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 217

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

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

### 218

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 219

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

```
f219(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 220

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

```
f220([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 221

```python
def f221(left, right, excluded):
    left = list(left)

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

```
f221(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 222

```python
def f222(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
```

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 223

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

```
f223([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 224

```python
def f224(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f224(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 225

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 226

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 227

```python
def f227(left, right, banned):
    left = list(left)

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

```
f227(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 228

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

```
f228([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 229

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

```
f229([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 230

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 231

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

```
f231([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 232

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

```
f232(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 233

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

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

### 234

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 235

```python
def f235(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f235(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 236

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

```
f236([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 237

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

```
f237([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 238

```python
def f238(left, right, banned):
    left = list(left)

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

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

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 239

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

```
f239(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 240

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

```
f240([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 241

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

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

```
f241(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 242

```python
def f242(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
    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
```

```
f242(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 243

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

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

### 244

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

```
f244([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 245

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

```
f245([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 246

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

```
f246(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 247

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 248

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

```
f248(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 249

```python
def f249(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f249(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 250

```python
def f250(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f250(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 251

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

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

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 252

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 253

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

```
f253([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 254

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 255

```python
def f255(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        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
```

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 256

```python
def f256(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
    rootsource = dict(indegree)
    complete = set()
    listing = []
    groups = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

### 257

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

```
f257([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 258

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

```
f258([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 259

```python
def f259(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)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[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
```

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

### 260

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 261

```python
def f261(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
```

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 262

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

```
f262(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 263

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

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

### 264

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

```
f264([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 265

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

```
f265([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 266

```python
def f266(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f266(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 267

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 268

```python
def f268(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f268(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 269

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

```
f269([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 270

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

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 271

```python
def f271(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f271(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 272

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

```
f272([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 273

```python
def f273(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]))
    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
```

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 274

```python
def f274(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
```

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 275

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

```
f275([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 276

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

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

### 277

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

```
f277([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 278

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

```
f278([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 279

```python
def f279(left, right, excluded):
    left = list(left)

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

```
f279(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 280

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

```
f280([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 281

```python
def f281(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) > 12:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f281(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 282

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

```
f282([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 283

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

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

### 284

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

```
f284([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 285

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

```
f285([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 286

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

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

### 287

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

```
f287([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 288

```python
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([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 289

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

```
f289(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 290

```python
def f290(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f290(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 291

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

```
f291([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 292

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

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

### 293

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

```
f293([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### 294

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

```
f294([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 295

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 296

```python
def f296(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    result = []
    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)
            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
```

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

### 297

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

```
f297([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 298

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

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

### 299

```python
def f299(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)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        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]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

### 300

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

```
f300([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 12, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":260},"top":["DL21","BR25","BR99"],"total":480}
```

### 301

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

```
f301([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 302

```python
def f302(left, right, excluded):
    left = list(left)

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

```
f302(['ivory', 'cyan ', 'GARNET', 'Amberx', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","AMBERX","BLUE","CYAN","DELTA","FROST","GARNET","IVORY"],"both":["CYAN","DELTA","FROST","GARNET"],"left":["AMBERX","IVORY"],"right":["AMBER","BLUE"],"score":20}
```

### 303

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

```
f303(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 304

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

```
f304(['..#.#.', '......', '..##.#', '##..#.', '....##', '..#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,2],[0,4],[2,5],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 305

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

```
f305([(2, 8), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62)], 1)
```

```
{"cover":34,"holes":[4,3,8,5,6],"longest":11,"segments":[[2,10],[14,25],[28,35],[43,45],[50,53],[59,62]]}
```

### 306

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

```
f306([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 307

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

```
f307([(3, 9), (5, 10), (14, 20), (18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62)], 1)
```

```
{"cover":33,"holes":[4,3,8,3,8],"longest":11,"segments":[[3,10],[14,25],[28,35],[43,45],[48,51],[59,62]]}
```

### 308

```python
def f308(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * abs(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
```

```
f308([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 309

```python
def f309(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f309(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 310

```python
def f310(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f310(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 311

```python
def f311(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f311(['Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"vivid":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"v":1},"size":139,"top":["helium","blue","frost","amber","delta"]}
```

### 312

```python
def f312(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f312(['Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium', 'Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber'], ['garnet'])
```

```
{"counts":{"amber":3,"blue":5,"cyan":2,"delta":3,"ember":3,"frost":5,"helium":6,"quartz":1},"initials":{"a":3,"b":5,"c":2,"d":3,"e":3,"f":5,"h":6,"q":1},"size":140,"top":["helium","blue","frost","amber","delta"]}
```

### 313

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

```
f313([('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3), ('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)], ['ready', 'checked'], {'north': 7, 'south': 9, 'core': 11, 'edge': 3})
```

```
{"accepted":7,"groups":{"edge":150,"north":70,"south":468},"top":["DL21","BR25","BR99"],"total":688}
```

### 314

```python
def f314(left, right, excluded):
    left = list(left)

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

```
f314(['ivory', 'cyan ', 'GARNETx', ' Amber', 'delta', 'frost', 'Ember'], [' Amber', 'BLUE', 'GARNET', 'cyan ', 'frost', 'delta', 'Ember'], ['EMBER'])
```

```
{"all":["AMBER","BLUE","CYAN","DELTA","FROST","GARNET","GARNETX","IVORY"],"both":["AMBER","CYAN","DELTA","FROST"],"left":["GARNETX","IVORY"],"right":["BLUE","GARNET"],"score":19}
```

### 315

```python
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]))
    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
```

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

```
{"count":8,"items":[["CX",114],["BR",103],["HR",84],["DL",44],["FP",40]],"missing":[],"total":462}
```

### 316

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

```
f316([17, 4, 21, 17, 17, 15, 21, 24, 24, 10, 5, 9, 12, 24, 19], 4, 74)
```

```
{"best":84,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,77,84,79,63,48,36,50,64]}
```

### 317

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

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

```
{"count":8,"items":[["BR",103],["FP",100],["CX",94],["HR",84],["DL",44]],"missing":[],"total":502}
```

### 318

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

```
f318(['....#.', '......', '..##.#', '##..#.', '....##', '#.#.#.'])
```

```
{"anchors":[[3,4],[2,2],[3,0],[0,4],[2,5],[5,0],[5,2]],"count":7,"filled":12,"sizes":[4,2,2,1,1,1,1]}
```

### 319

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

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

### 320

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

```
f320([17, 4, 21, 17, 17, 15, 21, 27, 24, 10, 5, 9, 12, 20, 19], 4, 75)
```

```
{"best":87,"hits":[4,5,6],"rises":5,"sums":[59,59,70,70,80,87,82,66,48,36,46,60]}
```

### Final Query

Give me the output of the final query without executing it!

```python
import json, re
from collections import deque
out = {}
nodes = list(('db', 'api', 'proxy') + ('jobs', 'cache', 'auth', 'ui', 'worker'))
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)}
memo = record['aa'][0]
left = list((('AN', 7), ('BR', 11), ('CX', 10), ('DL', 5), ('EV', 7)) + (('FP', 12), ('GQ', 4), ('HR', 8)))
right = list((('AN', 4), ('BR', 9), ('CX', 11), ('DL', 8), ('EV', 3)) + (('FP', 3), ('GQ', 4), ('HR', 10)))
fee = 4
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)}
clue = record['bb']
stop = ['garnet']
route = memo
cases = {
    'auth': list(('Delta, amber. ember frost quartz', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium') + ('Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium', 'Ember, garnet. delta amber')),
    'cache': list(('Delta, amber. ember frost', 'Garnet, frost. cyan blue frost', 'Garnet, frost. blue helium') + ('Helium, helium. helium cyan delta', 'Blue, amber. garnet ember', 'Helium, blue. frost blue helium vivid', 'Ember, garnet. delta amber')),
}
lines = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
stamp = record['dd']
right = list((' Amber', 'BLUE') + ('GARNET', 'cyan ', 'frost', 'delta', 'Ember'))
blocked = ['EMBER']
route = clue
cases = {
    462: list(('ivory', 'cyan ') + ('GARNETx', ' Amber', 'delta', 'frost', 'Ember')),
    502: list(('ivory', 'cyan ') + ('GARNET', 'Amberx', 'delta', 'frost', 'Ember')),
}
left = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
ticket = record['ee']
route = (memo, clue)
cases = {
    ('auth', 502): list(('....#.', '......', '..##.#', '##..#.') + ('....##', '#.#.#.')),
    ('auth', 462): list(('....#.', '......', '..##.#', '##..#.') + ('....##', '#.#.#.')),
    ('cache', 502): list(('....#.', '......', '..##.#', '##..#.') + ('....##', '#.#.#.')),
    ('cache', 462): 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)}
badge = record['bb'][3][1]
width = 4
route = (stamp, badge)
cases = {
    (139, 2): (list((17, 4, 21, 17, 17, 15, 21) + (24, 24, 10, 5, 9, 12, 24, 19)), 74),
    (139, 4): (list((17, 4, 21, 17, 17, 15, 21) + (27, 24, 10, 5, 9, 12, 20, 19)), 75),
    (140, 2): (list((17, 4, 21, 17, 17, 15, 21) + (27, 24, 10, 5, 9, 12, 20, 19)), 75),
    (140, 4): (list((17, 4, 21, 17, 17, 15, 21) + (27, 24, 10, 5, 9, 12, 20, 19)), 75),
}
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}
permit = record['bb']
gap = 1
route = (ticket, permit)
cases = {
    (20, 87): list(((2, 8), (5, 10), (14, 20)) + ((18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62))),
    (20, 84): list(((2, 8), (5, 10), (14, 20)) + ((18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62))),
    (19, 87): list(((2, 8), (5, 10), (14, 20)) + ((18, 25), (28, 35), (33, 35), (43, 45), (50, 53), (59, 62))),
    (19, 84): list(((3, 9), (5, 10), (14, 20)) + ((18, 25), (28, 35), (33, 35), (43, 45), (48, 51), (59, 62))),
}
spans = cases[route]
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
signal = record['cc']
rows = list((('BR77', 'edge', 'void', 11), ('AN14', 'north', 'ready', 10), ('DL51', 'south', 'void', 6), ('BR88', 'edge', 'hold', 14), ('BR25', 'south', 'checked', 15), ('BR62', 'edge', 'ready', 24), ('BR99', 'south', 'ready', 15), ('CX36', 'south', 'void', 3)) + (('DL73', 'edge', 'checked', 20), ('DL10', 'north', 'void', 21), ('AN47', 'core', 'void', 12), ('AN84', 'edge', 'ready', 6), ('DL21', 'south', 'ready', 22), ('BR58', 'north', 'hold', 17)))
keep = list(('ready',) + ('checked',))
route = signal
cases = {
    33: dict((('north', 7), ('south', 5), ('core', 12)) + (('edge', 3),)),
    34: dict((('north', 7), ('south', 9), ('core', 11)) + (('edge', 3),)),
}
rates = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))
```