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

### 001

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

```
f1([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 002

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

```
f2([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 003

```python
def f3(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    steps = {start: 0} if any((start in edge for edge in edges)) else {}
    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[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 004

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

```
f4([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 005

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

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

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

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

### 006

```python
def f6(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
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f6(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 007

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

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

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

### 008

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

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

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

### 009

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 010

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

    def canon(value):
        return str(value).strip(' ').upper()
    banned = {str(value).upper() for value in banned}
    a = {canon(value) for value in left} - banned
    b = {canon(value) for value in right} - banned
    both = a & b
    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([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frost', 'deltax', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 011

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

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

### 012

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

```
f12([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 013

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

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

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

### 014

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 015

```python
def f15(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 + 1:
            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
```

```
f15([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 016

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

```
f16(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 017

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

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

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

### 018

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

```
f18([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 019

```python
def f19(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        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
```

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

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 020

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

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

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

### 021

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

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

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

### 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
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, 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 = (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
```

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 023

```python
def f23(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    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'), ('D', 'F')], '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"]}
```

### 024

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 025

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

```
f25([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 026

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

```
f26([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 027

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 028

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 029

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

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

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

### 030

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

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

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 032

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

```
f32([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 033

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

```
f33([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 034

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

```
f34([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 035

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

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

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

### 036

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

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

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

### 037

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

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

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

### 038

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

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

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

### 039

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

```
f39([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 040

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

```
f40([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 041

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

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

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

### 042

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 043

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 044

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

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

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

### 045

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

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

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

```
f46([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 047

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

```
f47([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 048

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

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

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

### 049

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

```
f49([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 050

```python
def f50(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] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(min(100, left - combined[pos - 1][1]))
    returnvalue = {'segments': combined, 'cover': sum((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
```

```
f50([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 051

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

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

### 052

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

```
f52([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 053

```python
def f53(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[: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
```

```
f53(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 054

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

```
f54([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 055

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

```
f55([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 056

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

```
f56([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 057

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

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

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

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

### 058

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

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

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

### 059

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

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

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

### 060

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

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

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 061

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

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

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

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

### 062

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

```
f62([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 063

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

```
f63([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 064

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

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

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

### 065

```python
def f65(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:
        if word in stop:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f65(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 066

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

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

### 067

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

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

```
f67([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 068

```python
def f68(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    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
```

```
f68(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 069

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

```
f69([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 070

```python
def f70(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.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(routes.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 071

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

```
f71(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 072

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

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

### 073

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

```
f73([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 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 * abs(ratemap[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
```

```
f74([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 075

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

```
f75(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 076

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

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

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

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

### 077

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

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

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

### 078

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

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

### 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
    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 += 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
```

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 080

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

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

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

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 082

```python
def f82(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f82(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 083

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

```
f83([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 084

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

```
f84([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 085

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

```
f85([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 086

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

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

```
f86([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 087

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

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

```
f87([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 088

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

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

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

### 089

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 090

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

```
f90([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 091

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

```
f91([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 092

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

```
f92([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 093

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

```
f93(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 094

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

```
f94(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 095

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

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

```
f95([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 096

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

```
f96([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 097

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

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

```
f97([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 098

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

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

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 099

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

```
f99([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 100

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

```
f100(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 101

```python
def f101(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)
    levels = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in levels:
                    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
```

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

### 102

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

```
f102([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 103

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

```
f103([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 104

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 105

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

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

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 106

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 107

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

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

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

### 108

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

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

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 109

```python
def f109(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                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
    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
```

```
f109(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 110

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

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

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

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

### 111

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 112

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

```
f112([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 113

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

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

```
f113([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 114

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

```
f114([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 115

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

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

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

### 116

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

```
f116([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 117

```python
def f117(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:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        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': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f117(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 118

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

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

### 119

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

```
f119([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 120

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

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

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

### 121

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

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

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 122

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

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

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 123

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

```
f123([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 124

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 125

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

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

```
f125([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 126

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

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

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

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

### 127

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

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

### 128

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 129

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

```
f129([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 130

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

```
f130([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 131

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

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

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

### 132

```python
def f132(rows, keep, prices):
    rows = list(rows)
    kept = []
    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:
            cost = value * prices[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': list(dict.fromkeys((code for code, cost in kept)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f132([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 133

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

```
f133([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 134

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

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

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

### 135

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

```
f135(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 136

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

```
f136([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 137

```python
def f137(lines, stop):
    lines = list(lines)
    frequency = {}
    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 or len(word) > 12:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f137(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 138

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

```
f138([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 139

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

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

### 140

```python
def f140(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] + min(gap, 2):
            segments.append([left, right])
        else:
            segments[-1][1] = max(0, segments[-1][1], right)
    breaks = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        breaks.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f140([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 141

```python
def f141(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)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

### 142

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

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

```
f142([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 143

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

```
f143(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 144

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

```
f144([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 145

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

```
f145([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 146

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

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

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

### 147

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 148

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 149

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

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

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

### 150

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

```
f150([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 151

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

```
f151([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 152

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

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

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

### 153

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

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

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

### 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
    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 % 100):
            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
```

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 155

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

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

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 156

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 157

```python
def f157(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    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, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

### 158

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

```
f158([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 159

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

```
f159([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 160

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

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

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

### 161

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

```
f161([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 162

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

```
f162([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 163

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

```
f163([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 164

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

```
f164([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 165

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

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

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 166

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

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

```
f166([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 167

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

```
f167(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 168

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

```
f168([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 169

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

```
f169([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 170

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

```
f170([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 171

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

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

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

### 172

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 173

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

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

### 174

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

```
f174([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 175

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

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

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

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

### 176

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 177

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

```
f177([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 178

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

```
f178([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 179

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

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

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

### 180

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

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

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

### 181

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

```
f181([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 182

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

```
f182([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 183

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

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

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

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

### 184

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

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

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

### 185

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

```
f185([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 186

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

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

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

### 187

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

```
f187([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 188

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

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

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

### 189

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

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

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

### 190

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

```
f190(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 191

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

```
f191([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 192

```python
def f192(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' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) < 2:
            continue
        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
```

```
f192(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 193

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 195

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

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

```
f195([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 196

```python
def f196(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: pair[0]):
        if not combined or left > combined[-1][1] + max(0, 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
```

```
f196([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 197

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

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

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

### 198

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

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

```
f198([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 199

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

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

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

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

### 200

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

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

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

### 201

```python
def f201(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] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, min(50, len(result))):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((min(100, 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
```

```
f201([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 202

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

```
f202([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 203

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

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

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

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

### 204

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

```
f204([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 205

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

```
f205(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 206

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

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

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

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

### 207

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

```
f207([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 208

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

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

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

### 209

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

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

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

### 210

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 211

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

```
f211([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 212

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

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

```
f212([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 213

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 214

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

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

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

### 215

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

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

### 216

```python
def f216(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:
            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] = min(9, tallies.get(word, 0) + 1)
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f216(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 217

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

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

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

### 218

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

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

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

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

### 219

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

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

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

### 220

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

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 222

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

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

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

### 223

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

```
f223(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 224

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

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

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

### 225

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 226

```python
def f226(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) > 12:
            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
```

```
f226(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 227

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

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

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

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

### 228

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

```
f228([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 229

```python
def f229(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = min(9, 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
```

```
f229(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 230

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 231

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

```
f231([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 232

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

```
f232([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 233

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 234

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

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

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 235

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

```
f235([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 236

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

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

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

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

### 237

```python
def f237(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(result[-1][1], right)
    spaces = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        spaces.append(min(100, 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
```

```
f237([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 238

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 239

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 240

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

```
f240([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 241

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

```
f241([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 242

```python
def f242(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[: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
        tallies[word] = 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
```

```
f242(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 243

```python
def f243(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' 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
        frequency[word] = frequency.get(word, 0) + 1
    ranking = 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 ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f243(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 244

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 245

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

```
f245([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 246

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

```
f246(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 247

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

```
f247(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 248

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

```
f248(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 249

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

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 250

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

```
f250([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 251

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

```
f251([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 252

```python
def f252(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                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]))
    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
```

```
f252(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 253

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

```
f253([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 254

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

```
f254([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 255

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

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

### 256

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

```
f256([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 257

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

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

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

### 258

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

```
f258([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 259

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

```
f259([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 260

```python
def f260(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(0, combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f260([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 261

```python
def f261(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap % 5 + 1:
            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
```

```
f261([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 262

```python
def f262(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = 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 ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f262(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 263

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

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

### 264

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

```
f264([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 265

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 266

```python
def f266(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            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
```

```
f266(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 267

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

```
f267(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 268

```python
def f268(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    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
```

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

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

### 269

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

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

```
f269([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 270

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

```
f270([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 271

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 272

```python
def f272(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    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
```

```
f272(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 273

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

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

```
f273([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 274

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

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

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

### 275

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

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

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

### 276

```python
def f276(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    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', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 277

```python
def f277(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        routes.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(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    listing = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': listing, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 278

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

```
f278([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 279

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

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

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

### 280

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

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

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

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

### 281

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

```
f281([' Amber', 'Ember', 'GARNET', 'delta', 'ivory', 'BLUE', 'Ember'], ['frostx', 'delta', 'Ember', 'ivory', 'cyan ', 'GARNET', 'Ember'], ['EMBER'])
```

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

### 282

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

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

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

### 283

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

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

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

### 284

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

```
f284([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 285

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

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

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

### 286

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 287

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

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

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

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

### 288

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

```
f288([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 289

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

```
f289([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 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
    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 = 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
```

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

```
{"bounds":[-6,-3,0,1],"end":[-6,1],"far":7,"revisits":[[-3,-1],[0,-1],[0,0],[0,-2],[-1,-1]],"steps":33}
```

### 291

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

```
f291(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 292

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

```
f292([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 293

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

```
f293([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 294

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

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

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

### 295

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

```
f295([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 296

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

```
f296([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 297

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

```
f297(['Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"vivid":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"v":1},"size":133,"top":["blue","helium","delta","amber","frost"]}
```

### 298

```python
def f298(rows, keep, factors):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            charge = value * factors[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
```

```
f298([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 299

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

```
f299([('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":162,"north":147,"south":50},"top":["CX89","DL15","BR00"],"total":403}
```

### 300

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

```
f300([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 301

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

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

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

### 302

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

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

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

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

### 303

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

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

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

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

### 304

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

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

```
{"bounds":[-4,-5,0,0],"end":[-3,-1],"far":9,"revisits":[[-3,-3],[0,-3],[0,-2],[0,-4],[-1,-3]],"steps":32}
```

### 305

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

```
f305([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 306

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

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

```
{"anchors":[[1,3],[4,4],[0,4],[1,0],[4,1],[0,2]],"count":6,"filled":14,"sizes":[4,3,2,2,2,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 or len(word) > 12:
            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
```

```
f307(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 308

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

```
f308([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 10)], 0)
```

```
{"count":6,"items":[["CX",120],["GQ",100],["AN",96],["EV",72],["BR",48]],"missing":["FP","HR"],"total":484}
```

### 309

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

```
f309([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 310

```python
def f310(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 and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge, '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', 'D')], 'A', 3)
```

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

### 311

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

```
f311([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 312

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

```
f312(['Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue', 'Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta'], ['ember'])
```

```
{"counts":{"amber":3,"blue":9,"delta":4,"frost":3,"garnet":2,"helium":5,"quartz":1},"initials":{"a":3,"b":9,"d":4,"f":3,"g":2,"h":5,"q":1},"size":134,"top":["blue","helium","delta","amber","frost"]}
```

### 313

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

```
f313([('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9), ('FP', 4), ('GQ', 10), ('HR', 5)], [('AN', 9), ('BR', 8), ('CX', 10), ('DL', 8), ('EV', 8), ('GQ', 7)], 0)
```

```
{"count":6,"items":[["CX",120],["AN",108],["EV",72],["GQ",70],["BR",48]],"missing":["FP","HR"],"total":466}
```

### 314

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

```
f314([(2, 5), (5, 9), (14, 23), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":38,"holes":[5,5,3,4,3,5],"longest":9,"segments":[[2,9],[14,23],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### 315

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

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

### 316

```python
def f316(board):
    board = list(board)
    found = set()
    regions = []
    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)
            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
```

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

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

### 317

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

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

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

### 318

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

```
f318([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 319

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

```
f319([('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18), ('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":9,"groups":{"core":44,"edge":168,"north":126,"south":50},"top":["CX89","BR00","DL15"],"total":388}
```

### 320

```python
def f320(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + min(gap, 2):
            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(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((min(100, 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
```

```
f320([(2, 6), (5, 9), (14, 20), (18, 20), (28, 30), (33, 39), (43, 45), (48, 54), (59, 65)], 1)
```

```
{"cover":35,"holes":[5,8,3,4,3,5],"longest":7,"segments":[[2,9],[14,20],[28,30],[33,39],[43,45],[48,54],[59,65]]}
```

### Final Query

Give me the output of the final query without executing it!

```python
import json, re
from collections import deque
out = {}
left = list((('AN', 12), ('BR', 6), ('CX', 12), ('DL', 6), ('EV', 9)) + (('FP', 4), ('GQ', 10), ('HR', 5)))
right = list((('AN', 8), ('BR', 8), ('CX', 10), ('DL', 8)) + (('EV', 8), ('GQ', 10)))
fee = 0
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)}
memo = record['bb']
left = list((' Amber', 'Ember', 'GARNET') + ('delta', 'ivory', 'BLUE', 'Ember'))
blocked = ['EMBER']
route = memo
cases = {
    484: list(('frostx', 'delta', 'Ember') + ('ivory', 'cyan ', 'GARNET', 'Ember')),
    466: list(('frost', 'deltax', 'Ember') + ('ivory', 'cyan ', 'GARNET', 'Ember')),
}
right = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
clue = record['ee']
start = 'A'
limit = 3
route = memo
cases = {
    466: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D'))),
    484: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('D', 'F'))),
}
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)}
stamp = record['bb']['D']
route = (clue, stamp)
cases = {
    (16, 2): list(('..#.##', '#..#..', '#..#.#', '#.##..') + ('.#..#.', '.#..##')),
    (16, 1): list(('..#.##', '#..#..', '#..#..', '..##..') + ('.#..#.', '.#..##')),
    (11, 2): list(('..#.##', '#..#..', '#..#..', '..##..') + ('.#..#.', '.#..##')),
    (11, 1): list(('..#.##', '#..#..', '#..#..', '..##..') + ('.#..#.', '.#..##')),
}
board = cases[route]
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}

def root(cell):
    while parent[cell] != cell:
        parent[cell] = parent[parent[cell]]
        cell = parent[cell]
    return cell

def merge(a, b):
    a = root(a)
    b = root(b)
    if a != b:
        parent[b] = a
for row, col in cells:
    for other in ((row - 1, col), (row, col - 1)):
        if other in parent:
            merge((row, col), other)
groups = {}
for cell in cells:
    groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
ticket = record['cc']
stop = ['ember']
route = ticket
cases = {
    14: list(('Helium, helium. ember delta quartz', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue') + ('Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet', 'Helium, ember. blue delta')),
    16: list(('Helium, helium. ember delta', 'Amber, delta. frost delta amber', 'Blue, blue. blue blue') + ('Ember, helium. blue blue frost', 'Amber, blue. ember helium', 'Frost, blue. garnet ember garnet vivid', 'Helium, ember. blue delta')),
}
lines = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
badge = record['dd']
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
route = badge
cases = {
    133: list((('DL15', 'north', 'ready', 10), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18)) + (('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 7), ('BR96', 'core', 'checked', 4))),
    134: list((('DL15', 'north', 'ready', 7), ('CX52', 'edge', 'checked', 14), ('CX89', 'north', 'ready', 11), ('DL26', 'edge', 'void', 18), ('CX63', 'south', 'void', 18), ('BR00', 'edge', 'checked', 18)) + (('DL37', 'south', 'ready', 4), ('DL74', 'core', 'void', 8), ('CX11', 'edge', 'ready', 15), ('BR48', 'edge', 'hold', 3), ('DL85', 'south', 'checked', 6), ('BR22', 'core', 'hold', 14), ('BR59', 'edge', 'ready', 9), ('BR96', 'core', 'checked', 4))),
}
rows = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
permit = record['bb']
gap = 1
route = permit
cases = {
    388: list(((2, 6), (5, 9), (14, 20), (18, 20), (28, 30)) + ((33, 39), (43, 45), (48, 54), (59, 65))),
    403: list(((2, 5), (5, 9), (14, 23), (18, 20), (28, 30)) + ((33, 39), (43, 45), (48, 54), (59, 65))),
}
spans = cases[route]
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
signal = record['cc']
route = signal
cases = {
    38: list((('W', 3), ('S', 5), ('W', 1), ('N', 2), ('E', 1), ('E', 3), ('S', 1)) + (('N', 3), ('S', 3), ('N', 1), ('W', 3), ('W', 1), ('E', 2), ('N', 2), ('W', 1))),
    35: list((('W', 3), ('S', 3), ('W', 1), ('N', 2), ('E', 1), ('E', 3), ('S', 1)) + (('N', 3), ('S', 3), ('N', 1), ('W', 3), ('W', 1), ('E', 2), ('N', 2), ('W', 4))),
}
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}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
out['ee'] = record['ee']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))
```