### 001

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

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

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

### 002

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

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

```
f2(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 003

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

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

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

### 004

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

```
f4([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 005

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

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

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

### 006

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

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

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

### 007

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

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

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

### 008

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

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

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

### 009

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

```
f9(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 010

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

```
f10(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 011

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

```
f11(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 012

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

```
f12([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 013

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

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

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

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

### 014

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

```
f14([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 015

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

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

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

### 016

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

```
f16(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 017

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

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

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

### 018

```python
def f18(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[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        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
```

```
f18(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 019

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

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

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

### 020

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

```
f20([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 021

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

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

```
f21(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 022

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

```
f22([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 023

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

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

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

### 024

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

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

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

### 025

```python
def f25(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            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
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f25(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 026

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

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

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

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

### 027

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

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

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

### 028

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

```
f28(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 029

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

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

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

### 030

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

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

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

### 031

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

```
f31([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 032

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

```
f32([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 033

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

```
f33([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 034

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

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

```
f34(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 035

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

```
f35([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 036

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

```
f36(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 037

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

```
f37([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 038

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

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

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

### 039

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

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

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

### 040

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

```
f40([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 041

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

```
f41([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 042

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

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

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

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

### 043

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

```
f43([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 044

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

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

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

### 045

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

```
f45([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 046

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

```
f46([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 047

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

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

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

### 048

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

```
f48([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 049

```python
def f49(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if levels[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    work.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
```

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

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

### 050

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

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

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

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

### 051

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

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

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

### 052

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

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

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

### 053

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

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

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

### 054

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

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

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

### 055

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

```
f55([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 056

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

```
f56([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 057

```python
def f57(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 = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in 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
```

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

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

### 058

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

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

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

### 059

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

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

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

### 060

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

```
f60([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 061

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

```
f61(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 062

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

```
f62([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 063

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

```
f63([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 064

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 065

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

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

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

### 066

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 067

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

```
f67([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 068

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

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

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

### 069

```python
def f69(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 and (not nxt.startswith('Z')):
                    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
```

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

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

### 070

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

```
f70(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 071

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

```
f71([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 072

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

```
f72([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 073

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

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

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

### 074

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

```
f74(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 075

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

```
f75(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 076

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

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

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 077

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

```
f77([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 078

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

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

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

### 079

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

```
f79([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 080

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

```
f80([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 081

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

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

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

### 082

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

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

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

### 083

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

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

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

### 084

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

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

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

### 085

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

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

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

### 086

```python
def f86(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - 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, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 087

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

```
f87([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 088

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

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

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

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

### 089

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

```
f89(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 090

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

```
f90([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 091

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

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

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

### 092

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

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

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

### 093

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

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

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

### 094

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

```
f94([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 095

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

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

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

### 096

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

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

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

### 097

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

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

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

### 098

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

```
f98(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 099

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

```
f99([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 100

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

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

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

### 101

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

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

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

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

### 102

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

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

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

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

### 103

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

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

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

### 104

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

```
f104(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 105

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

```
f105(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 106

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

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

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

### 107

```python
def f107(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[: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': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f107(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 108

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

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

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

### 109

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

```
f109([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 110

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

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

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

### 111

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

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

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

### 112

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

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

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

### 113

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

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

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

### 114

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

```
f114(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 115

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

```
f115([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 116

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 117

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

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

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

### 118

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

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

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

### 119

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

```
f119(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 120

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

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

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

### 121

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

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

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

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

### 122

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

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

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

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

### 123

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

```
f123(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 124

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

```
f124(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 125

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

```
f125([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 126

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

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

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

### 127

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

```
f127([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 129

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

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

```
f129(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 130

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

```
f130([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

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

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

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

### 132

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

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

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

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

### 133

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

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

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

### 134

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

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

```
f134(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 135

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

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

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

### 136

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

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

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

### 137

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

```
f137([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 138

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

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

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

### 139

```python
def f139(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 {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    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
```

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

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

### 140

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

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

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

### 141

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

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

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

### 142

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

```
f142(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 143

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

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

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

### 144

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

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

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

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

### 145

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

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

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 146

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

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

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

### 147

```python
def f147(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(0, segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((min(100, 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
```

```
f147([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 148

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

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

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

### 149

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

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

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

### 150

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 151

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

```
f151(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 152

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

```
f152([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 153

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

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

```
f153(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 154

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

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

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

### 155

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 156

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

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

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

### 157

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

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

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

### 158

```python
def f158(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    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
```

```
f158(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 159

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

```
f159(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 160

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

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

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

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

### 161

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

```
f161([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 162

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

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

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

### 163

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

```
f163(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 164

```python
def f164(board):
    board = list(board)
    known = set()
    regions = []
    for row in range(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
```

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

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

### 165

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

```
f165([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 166

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

```
f166([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 167

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

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

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

### 168

```python
def f168(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 (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    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
```

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

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

### 169

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

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

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

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

### 170

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

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

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

### 171

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

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

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

### 172

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

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

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

### 173

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

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

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

### 174

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

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

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

### 175

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 176

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

```
f176(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 177

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

```
f177(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 178

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 179

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

```
f179([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 180

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

```
f180([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 181

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

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

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

### 182

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

```
f182([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 183

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

```
f183([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 184

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

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

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

### 185

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

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

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

### 186

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

```
f186(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 187

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

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

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

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

### 188

```python
def f188(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < 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)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': lastlevel[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 189

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

```
f189(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 190

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

```
f190([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 191

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

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

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

### 192

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

```
f192([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 193

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

```
f193([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 194

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

```
f194([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 195

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 196

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 197

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

```
f197([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 198

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

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

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

### 199

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

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

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

### 200

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

```
f200(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 201

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 202

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

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

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

### 203

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

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

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

### 204

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

```
f204([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 205

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

```
f205([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 206

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

```
f206([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 207

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

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

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

### 208

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

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

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

### 209

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

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

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

### 210

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

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

```
f210(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 211

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

```
f211([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 212

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

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

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 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
    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 = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in known and list(point) not in crossings:
                crossings.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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 214

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

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

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

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

### 215

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

```
f215([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 216

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 217

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

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

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

### 218

```python
def f218(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        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
```

```
f218(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 219

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

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

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

### 220

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

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

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

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 222

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

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

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

### 223

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

```
f223([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 224

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

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

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

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

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

### 226

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

```
f226(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 227

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

```
f227([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 228

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

```
f228([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 229

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

```
f229([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 230

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

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

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

### 231

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

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

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

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

### 232

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

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

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

### 233

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

```
f233([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 234

```python
def f234(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.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(children.get(cur, [])) if len(str(node)) == 1):
                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[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

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

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

### 235

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

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

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

### 236

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 237

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

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

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

### 238

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

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

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

### 239

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

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

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

### 240

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

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

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

### 241

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

```
f241([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 242

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

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

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

### 243

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

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

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

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

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

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

### 245

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

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

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

### 246

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

```
f246(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 247

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

```
f247(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 248

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

```
f248(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 249

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

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

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

### 250

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

```
f250([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 251

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

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

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

### 252

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

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

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

### 253

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

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

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

### 254

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

```
f254([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 255

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

```
f255([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 256

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

```
f256(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 257

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

```
f257([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 258

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

```
f258([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 259

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

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

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

### 260

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

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

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

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

### 261

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

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

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

### 262

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

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

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

### 263

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

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

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

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

### 264

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

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

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

### 265

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

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

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

### 266

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

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

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

### 267

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 268

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

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

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

### 269

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

```
f269([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 270

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

```
f270([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 271

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

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

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

### 272

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 273

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

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

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

### 274

```python
def f274(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.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(children.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
```

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

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

### 275

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

```
f275([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 276

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

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

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

### 277

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

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

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

### 278

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

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

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

### 279

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

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

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

### 280

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

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

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

### 281

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 282

```python
def f282(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)}
    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'), ('C', 'E'), ('H', 'B')], 'C', 3)
```

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

### 283

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

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

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

### 284

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

```
f284([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 285

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

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

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

### 286

```python
def f286(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 (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    work.append(nxt)
    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
```

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

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

### 287

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

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

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

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

### 288

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

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

```
f288(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 289

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

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

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

### 290

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

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

```
f290(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 291

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

```
f291(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['amber', 'blue'])
```

```
{"counts":{"cyan":3,"delta":6,"ember":6,"frost":4,"garnet":2,"helium":3},"initials":{"c":3,"d":6,"e":6,"f":4,"g":2,"h":3},"size":122,"top":["delta","ember","frost","cyan","helium"]}
```

### 292

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

```
f292([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 293

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 294

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

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

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

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

### 295

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

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

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

### 296

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

```
f296([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 297

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 298

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

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

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

### 299

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

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

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

### 300

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

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

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

### 301

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

```
f301([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 302

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

```
f302(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 303

```python
def f303(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} 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(nextmap.get(cur, [])):
                if nxt not in steps and (not nxt.startswith('Z')):
                    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
```

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

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

### 304

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

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

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

### 305

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

```
f305([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 306

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

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

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

### 307

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

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

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

### 308

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

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

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

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

### 309

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

```
f309([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 310

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

```
f310([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 0)
```

```
{"cover":38,"holes":[1,4,4,1,7,3,4],"longest":10,"segments":[[3,5],[6,11],[15,25],[29,33],[34,37],[44,46],[49,56],[60,65]]}
```

### 311

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

```
f311(['frost', 'Ember', 'BLUE', 'delta', 'heliumx', 'GARNET', 'cyan '], [' Amber', 'delta', 'GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '], ['CYAN'])
```

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

### 312

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

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

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

### 313

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

```
f313([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 15, 62)
```

```
{"best":242,"hits":[0],"rises":0,"sums":[242]}
```

### 314

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

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

```
{"bounds":[-2,-9,3,0],"end":[2,-6],"far":10,"revisits":[[1,-8],[1,-7],[1,-6],[1,-5],[1,-4]],"steps":28}
```

### 315

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

```
f315(['Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember', 'Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'], ['frost', 'garnet'])
```

```
{"counts":{"amber":4,"blue":3,"cyan":3,"delta":6,"ember":6,"helium":3},"initials":{"a":4,"b":3,"c":3,"d":6,"e":6,"h":3},"size":122,"top":["delta","ember","amber","blue","cyan"]}
```

### 316

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

```
f316([24, 16, 14, 23, 20, 5, 12, 13, 20, 18, 7, 12, 20, 17, 21], 13, 62)
```

```
{"best":204,"hits":[0,1,2],"rises":1,"sums":[204,197,202]}
```

### 317

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

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

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

### 318

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

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

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

### 319

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

```
f319([(3, 5), (6, 11), (15, 20), (19, 25), (29, 33), (34, 37), (44, 46), (49, 56), (60, 65)], 2)
```

```
{"cover":40,"holes":[4,4,7,3,4],"longest":10,"segments":[[3,11],[15,25],[29,37],[44,46],[49,56],[60,65]]}
```

### 320

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

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

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

### Final Query

Give me the output of the final query without executing it!

```python
import json, re
from collections import deque
out = {}
moves = list((('E', 1), ('S', 2), ('S', 2), ('S', 3), ('S', 2), ('N', 3), ('N', 1)) + (('N', 1), ('E', 2), ('W', 1), ('W', 1), ('S', 2), ('W', 3), ('E', 2), ('E', 1), ('E', 1)))
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}
memo = record['ee']
edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G')) + (('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')))
limit = 3
route = memo
cases = {
    28: 'C',
    29: 'F',
}
start = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
clue = record['dd']
nodes = list(('ui', 'proxy', 'api', 'db') + ('cache', 'auth', 'jobs', 'worker'))
route = clue
cases = {
    5: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
    7: list((('auth', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
stamp = record['aa'][3]
route = stamp
cases = {
    'api': list(('.#....', '##..#.') + ('#.##.#', '..###.', '..##..', '#..#..')),
    'ui': 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['bb'][2][0]
lines = list(('Ember, frost. delta ember', 'Cyan, cyan. amber frost delta', 'Delta, delta. cyan ember', 'Amber, delta. delta blue ember') + ('Amber, frost. ember helium', 'Blue, ember. garnet amber blue', 'Garnet, frost. helium helium'))
route = clue
cases = {
    5: list(('amber',) + ('blue',)),
    7: list(('frost',) + ('garnet',)),
}
stop = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
badge = record['aa'][2]
spans = list(((3, 5), (6, 11), (15, 20), (19, 25)) + ((29, 33), (34, 37), (44, 46), (49, 56), (60, 65)))
route = (ticket, badge)
cases = {
    (1, 'amber'): 2,
    (1, 'frost'): 0,
    (0, 'amber'): 0,
    (0, 'frost'): 0,
}
gap = cases[route]
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
permit = record['cc']
right = list((' Amber', 'delta') + ('GARNET', 'cyan ', 'Ember', 'ivory', 'cyan '))
blocked = ['CYAN']
route = permit
cases = {
    38: list(('frost', 'Ember') + ('BLUE', 'delta', 'heliumx', 'GARNET', 'cyan ')),
    40: list(('frost', 'Ember') + ('BLUE', 'deltax', 'helium', 'GARNET', 'cyan ')),
}
left = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
    ban.add(value.strip().upper())
for value in left:
    value = value.strip().upper()
    if value not in ban:
        a.add(value)
for value in right:
    value = value.strip().upper()
    if value not in ban:
        b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
signal = record['ee']
values = list((24, 16, 14, 23, 20, 5, 12, 13) + (20, 18, 7, 12, 20, 17, 21))
limit = 62
route = signal
cases = {
    11: 15,
    16: 13,
}
width = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))
```