### 001

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

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

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

### 002

```python
def f2(lines, stop):
    lines = list(lines)
    wordmap = {}
    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:
        if word in stop or len(word) < 2:
            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
```

```
f2(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 003

```python
def f3(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' 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
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f3(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 004

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 005

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

```
f5([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 006

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

```
f6(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 007

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 008

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 009

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

```
f9([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 010

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

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

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

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

### 011

```python
def f11(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 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
            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
```

```
f11([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 012

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 013

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

```
f13([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 014

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 015

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 016

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

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

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

### 017

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

```
f17(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 018

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 019

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 020

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 021

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

```
f21([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 022

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 023

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 024

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

```
f24([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 025

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

```
f25([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 026

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 027

```python
def f27(lines, stop):
    lines = list(lines)
    wordmap = {}
    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
        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
```

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

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 028

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

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

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

### 029

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

```
f29([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 030

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 031

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 032

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 033

```python
def f33(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] + min(gap, 2):
            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
```

```
f33([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 034

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

```
f34([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 035

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

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

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

### 036

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

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

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

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

### 037

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 038

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

```
f38([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 039

```python
def f39(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) 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:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f39(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 040

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 041

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 042

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

```
f42([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 043

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 044

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 045

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

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

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

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

### 046

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 047

```python
def f47(lines, stop):
    lines = list(lines)
    wordmap = {}
    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
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f47(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 048

```python
def f48(lines, stop):
    lines = list(lines)
    tallies = {}
    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
        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': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

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

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 049

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

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

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

### 050

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 051

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 052

```python
def f52(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + min(gap, 2):
            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
```

```
f52([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 053

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

```
f53([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 054

```python
def f54(lines, stop):
    lines = list(lines)
    wordmap = {}
    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' 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
        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
```

```
f54(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 055

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

```
f55([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 056

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 057

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

```
f57([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 058

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 059

```python
def f59(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': min(100, max((right - left for left, right in segments)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f59([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 060

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

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

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

### 061

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

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

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

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

### 062

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

```
f62([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 063

```python
def f63(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(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 064

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

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

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

### 065

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

```
f65(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 066

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

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

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

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

### 067

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

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

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

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

### 068

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

```
f68(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 069

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 070

```python
def f70(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(0, 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
```

```
f70([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 071

```python
def f71(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[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = 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 ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f71(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 072

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 073

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 074

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

```
f74([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 075

```python
def f75(lines, stop):
    lines = list(lines)
    wordmap = {}
    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[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f75(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 076

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

```
f76([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 077

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 078

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 079

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 080

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

```
f80([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 081

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 082

```python
def f82(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
    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': min(100, max((right - left for left, right in segments)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f82([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 083

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 084

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

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

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

### 085

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

```
f85([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 086

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 087

```python
def f87(lines, stop):
    lines = list(lines)
    tallies = {}
    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[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = 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 sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f87(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 088

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

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

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

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

### 089

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

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

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

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

### 090

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

```
f90([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 091

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 092

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 093

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 094

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

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

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

### 095

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 096

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 097

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 098

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

```
f98([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 099

```python
def f99(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], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f99([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 100

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

```
f100([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 101

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

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

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

### 102

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 103

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

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

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

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

### 104

```python
def f104(lines, stop):
    lines = list(lines)
    wordmap = {}
    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
        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': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f104(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 105

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

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

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

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

### 106

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

```
f106([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 107

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 108

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 109

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 110

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 111

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

```
f111([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 112

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

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

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

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

### 113

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

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

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

### 114

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 115

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

```
f115([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 116

```python
def f116(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            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
```

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 117

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 118

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 119

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

```
f119([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 120

```python
def f120(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:
            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 or len(word) < 2:
            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
```

```
f120(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 121

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

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

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

### 122

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 123

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

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

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

### 124

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

```
f124([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 125

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

```
f125([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 126

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 127

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 128

```python
def f128(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] + max(0, gap):
            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
```

```
f128([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 129

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

```
f129(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 130

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 131

```python
def f131(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:
        if word in stop or len(word) < 2:
            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
```

```
f131(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 132

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

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

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

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

### 133

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

```
f133(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 134

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 135

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 136

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

```
f136([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 137

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

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

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

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

### 138

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 139

```python
def f139(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        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) > 12:
            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': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f139(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 140

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

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

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

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

### 141

```python
def f141(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[: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
```

```
f141(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 142

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

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

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

### 143

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 144

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 145

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 146

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

```
f146([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 147

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 148

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

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

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

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

### 149

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

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

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

### 150

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 151

```python
def f151(rows, keep, factors):
    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:
            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
```

```
f151([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 152

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

```
f152([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 153

```python
def f153(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) 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
        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
```

```
f153(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 154

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 155

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 156

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

```
f156([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 157

```python
def f157(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] + gap % 5:
            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
```

```
f157([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 158

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

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

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

### 159

```python
def f159(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[: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
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f159(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 160

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

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

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

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

### 161

```python
def f161(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] = 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((right - left for left, right in combined)), 'holes': breaks, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f161([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 162

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 163

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

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

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

### 164

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 165

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 166

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 167

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

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

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

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

### 168

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

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

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

### 169

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 170

```python
def f170(lines, stop):
    lines = list(lines)
    tallies = {}
    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 or len(word) < 2:
            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': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f170(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 171

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

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

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

### 172

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

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

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

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

### 173

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

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

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

### 174

```python
def f174(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(0, 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
```

```
f174([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 175

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

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

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

### 176

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

```
f176(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 177

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

```
f177([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 178

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

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

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

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

### 179

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

```
f179([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 180

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 181

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 182

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

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

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

### 183

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 184

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 185

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 186

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 187

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 188

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

```
f188([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 190

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

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

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

### 191

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

```
f191([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 192

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

```
f192([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 193

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 194

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 195

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

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

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

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

### 196

```python
def f196(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[: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
```

```
f196(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 197

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

```
f197([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 198

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

```
f198([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 199

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 200

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 201

```python
def f201(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        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 or len(word) > 12:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    sorteditems = 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 sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f201(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 202

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 203

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

```
f203([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 204

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 205

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 206

```python
def f206(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or 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, 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
```

```
f206([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 207

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

```
f207([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 208

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

```
f208([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 209

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

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

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

### 210

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 211

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 212

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 213

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 214

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 215

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

```
f215(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 216

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

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

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

### 217

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 218

```python
def f218(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:
            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': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f218([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 219

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 220

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 221

```python
def f221(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + max(0, gap):
            result.append([left, right])
        else:
            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
```

```
f221([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 222

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

```
f222([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 223

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

```
f223(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 224

```python
def f224(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        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:
        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
```

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

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 225

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

```
f225([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 226

```python
def f226(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        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((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
```

```
f226([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 227

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

```
f227([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 228

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

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

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

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

### 229

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

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

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

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

### 230

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 231

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

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

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

### 232

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

    def normalize(value):
        return str(value).strip(' ').upper()
    ignored = {str(value).upper() 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
```

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

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

### 233

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

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

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

### 234

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

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

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

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

### 235

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 236

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

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

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

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

### 237

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 238

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

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

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

### 239

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

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

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

### 240

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

```
f240([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 241

```python
def f241(lines, stop):
    lines = list(lines)
    wordmap = {}
    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:
        if word in stop:
            continue
        wordmap[word] = 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
```

```
f241(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 242

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 243

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

```
f243([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 244

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

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

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

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

### 245

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

```
f245(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 246

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 247

```python
def f247(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] = 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((min(100, right - left) for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f247([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 248

```python
def f248(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in ratemap and count > 0:
            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(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 249

```python
def f249(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' or (char == "'" and word):
                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
```

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

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 250

```python
def f250(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[:64]:
            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
    ranking = 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 ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

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

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 251

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

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

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

### 252

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

```
f252([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 253

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 254

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

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

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

### 255

```python
def f255(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            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': list(dict.fromkeys((code for code, score in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f255([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 256

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

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

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

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

### 257

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

```
f257([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 258

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

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

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

### 259

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

```
f259([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 260

```python
def f260(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[:64]:
            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 or len(word) < 2:
            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
```

```
f260(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 261

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

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

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

### 262

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 263

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

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

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

### 264

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

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

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

### 265

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

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

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

### 266

```python
def f266(lines, stop):
    lines = list(lines)
    tallies = {}
    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
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    ordered = 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 ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

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

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 267

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

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

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

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

### 268

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

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

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

### 269

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 270

```python
def f270(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * factors[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': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f270([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 271

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

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

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

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

### 272

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

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

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

### 273

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 274

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

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

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

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

### 275

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 276

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 277

```python
def f277(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(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
```

```
f277([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 278

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 279

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

```
f279([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 280

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 281

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 282

```python
def f282(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:
            combined.append([left, right])
        else:
            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
```

```
f282([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 283

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

```
f283([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":8,"groups":{"core":297,"north":525,"south":85},"top":["BR32","CX80","CX84"],"total":907}
```

### 284

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

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

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

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

### 285

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 286

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 287

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 288

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

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

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

### 289

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

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

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

### 290

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

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

```
{"bounds":[-2,-7,7,2],"end":[6,-7],"far":14,"revisits":[[4,-5],[4,-4]],"steps":27}
```

### 291

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

```
f291([('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11), ('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":3,"groups":{"edge":9,"north":63,"south":110},"top":["AN95","AN69","AN91"],"total":182}
```

### 292

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

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

```
{"count":7,"items":[["CX",82],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":283}
```

### 293

```python
def f293(lines, stop):
    lines = list(lines)
    wordmap = {}
    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:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = min(9, 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
```

```
f293(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 294

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 295

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 296

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

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

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

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

### 297

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

```
f297([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 298

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

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

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

### 299

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

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

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

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

### 300

```python
def f300(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] + min(gap, 2):
            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(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
```

```
f300([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 301

```python
def f301(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) > 12:
            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
```

```
f301(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['helium', 'amber'])
```

```
{"counts":{"blue":3,"cyan":3,"delta":5,"ember":4,"frost":4,"garnet":5},"initials":{"b":3,"c":3,"d":5,"e":4,"f":4,"g":5},"size":119,"top":["delta","garnet","ember","frost","blue"]}
```

### 302

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

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

```
{"count":7,"items":[["CX",118],["DL",61],["AN",51],["EV",41],["BR",29]],"missing":["HR"],"total":319}
```

### 303

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

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

```
{"bounds":[-2,-6,7,2],"end":[7,-6],"far":13,"revisits":[[4,-5],[4,-4],[6,-4]],"steps":27}
```

### 304

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 305

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

```
f305([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 306

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

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

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

### 307

```python
def f307(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[: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
        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
```

```
f307(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 308

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

```
f308([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 40), (44, 51), (49, 55), (60, 62)], 2)
```

```
{"cover":41,"holes":[5,4,4,5],"longest":11,"segments":[[3,10],[15,25],[29,40],[44,55],[60,62]]}
```

### 309

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 310

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 311

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

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

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

### 312

```python
def f312(lines, stop):
    lines = list(lines)
    tallies = {}
    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
        tallies[word] = 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': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f312(['Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember', 'Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'], ['ember', 'frost'])
```

```
{"counts":{"amber":1,"blue":3,"cyan":3,"delta":5,"garnet":5,"helium":6},"initials":{"a":1,"b":3,"c":3,"d":5,"g":5,"h":6},"size":120,"top":["helium","delta","garnet","blue","cyan"]}
```

### 313

```python
def f313(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            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
```

```
f313([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 314

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

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

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

### 315

```python
def f315(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] + gap:
            segments.append([left, right])
        else:
            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
```

```
f315([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 316

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

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

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

### 317

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

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

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":1},"frontier":["G"],"order":["A","B","C","H","D","E","F","G"]}
```

### 318

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

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

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

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

### 319

```python
def f319(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap % 5:
            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
```

```
f319([(3, 7), (6, 10), (15, 21), (19, 25), (29, 36), (34, 37), (44, 51), (49, 57), (60, 62)], 2)
```

```
{"cover":40,"holes":[5,4,7,3],"longest":13,"segments":[[3,10],[15,25],[29,37],[44,57],[60,62]]}
```

### 320

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

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

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

### Final Query

Give me the output of the final query without executing it!

```python
import json, re
from collections import deque
out = {}
left = list(('ivory', ' Amber', 'Ember', 'frost') + ('GARNET', 'helium', 'Ember'))
right = list(('delta', ' Amber', 'ivory', 'cyan ') + ('BLUE', 'helium', 'Ember'))
blocked = ['helium']
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))}
clue = record['ee']
right = list((('AN', 10), ('BR', 7), ('CX', 9)) + (('DL', 10), ('EV', 5), ('FP', 3), ('GQ', 4)))
fee = 1
route = clue
cases = {
    16: list((('AN', 5), ('BR', 4), ('CX', 13), ('DL', 6)) + (('EV', 8), ('FP', 3), ('GQ', 2), ('HR', 12))),
    15: list((('AN', 5), ('BR', 4), ('CX', 9), ('DL', 6)) + (('EV', 8), ('FP', 3), ('GQ', 2), ('HR', 13))),
}
left = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
stamp = record['bb']
board = list(('.##.#.', '#.##.#') + ('#.#.##', '.#.#..', '####.#', '#....#'))
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
ticket = record['cc']
route = ticket
cases = {
    18: list((('N', 1), ('W', 1), ('W', 1), ('N', 1), ('E', 3), ('S', 3), ('E', 3), ('S', 2)) + (('S', 3), ('N', 2), ('E', 2), ('E', 1), ('W', 1), ('S', 2), ('E', 1))),
    20: list((('N', 1), ('W', 1), ('W', 1), ('N', 1), ('E', 3), ('S', 3), ('E', 3), ('S', 2)) + (('S', 3), ('N', 2), ('E', 2), ('E', 1), ('S', 1), ('S', 2), ('W', 1))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
badge = record['bb']
gap = 2
route = badge
cases = {
    14: list(((3, 7), (6, 10), (15, 21), (19, 25)) + ((29, 36), (34, 37), (44, 51), (49, 57), (60, 62))),
    13: list(((3, 7), (6, 10), (15, 21), (19, 25)) + ((29, 36), (34, 40), (44, 51), (49, 55), (60, 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))}
permit = record['cc']
start = 'A'
limit = 3
route = (stamp, permit)
cases = {
    (319, 41): list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'H'))),
    (319, 40): list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'H'))),
    (283, 41): list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'H'))),
    (283, 40): list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('D', 'B'))),
}
edges = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
signal = record['aa'][3]
lines = list(('Garnet, ember. garnet blue', 'Ember, delta. delta cyan blue', 'Frost, helium. frost frost', 'Helium, amber. delta delta ember') + ('Garnet, garnet. helium frost', 'Helium, delta. garnet blue helium', 'Ember, cyan. helium cyan'))
route = signal
cases = {
    'D': list(('ember',) + ('frost',)),
    'H': list(('helium',) + ('amber',)),
}
stop = 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))}
token = record['dd']
rows = list((('CX84', 'north', 'ready', 21), ('CX21', 'core', 'ready', 11), ('CX58', 'north', 'hold', 17), ('AN95', 'south', 'checked', 22), ('BR32', 'north', 'ready', 24), ('AN69', 'north', 'checked', 9), ('CX06', 'north', 'void', 11)) + (('BR43', 'edge', 'void', 16), ('CX80', 'north', 'ready', 24), ('AN17', 'core', 'ready', 13), ('BR54', 'core', 'ready', 3), ('AN91', 'edge', 'checked', 3), ('CX28', 'north', 'ready', 6), ('BR65', 'south', 'ready', 17)))
rates = dict((('north', 7), ('south', 5)) + (('core', 11), ('edge', 3)))
route = token
cases = {
    119: ['checked'],
    120: ['ready'],
}
keep = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))
```