### 001 ```python def f1(rows, keep, prices): rows = list(rows) selected = [] buckets = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * prices[group] selected.append((code, score)) buckets[group] = buckets.get(group, 0) + score amount += score selected.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f1([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 002 ```python def f2(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right: if name0 not in ratemap: ratemap[name0] = rate0 matched = [] for key, count in left[:20]: if key in ratemap: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in ratemap}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})} output = dict() output.update(returnvalue) return output ``` ``` f2([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 003 ```python def f3(values, width, limit): values = list(values) size = width windows = [] for pos in range(min(64, len(values) - size + 1)): windows.append(sum(values[pos:pos + size])) indexes = [pos for pos, value in enumerate(windows[:64]) if value >= limit and (limit >= 0 or pos > 0)] ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f3([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 004 ```python def f4(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 ``` ``` f4([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 005 ```python def f5(nodes, edges): nodes = list(nodes) indegree = {node: 0 for node in nodes} nextmap = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) nextmap[a].append(b) indegree[b] += 1 rootsource = dict(indegree) complete = set() sequence = [] groups = [] while len(complete) < len(nodes) and len(complete) < 20: nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete)) if not nextbatch: break current = nextbatch groups.append(current) for node in current: complete.add(node) sequence.append(node) for node in current: for nxt in nextmap[node]: indegree[nxt] -= 1 returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f5(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 006 ```python def f6(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if len(edge[0]) < 2): nextmap.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < min(limit, 3): for nxt in sorted(nextmap.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) sequence = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f6([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 007 ```python def f7(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum(values[pos:pos + size])) indexes = [pos for pos, value in enumerate(windows[:64]) if value > limit] 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 ``` ``` f7([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 008 ```python def f8(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in returns: returns.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f8([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 009 ```python def f9(edges, start, limit): edges = list(edges) routes = {} for a, b in edges: routes.setdefault(a, []).append(b) distance = {start: 0} if any((start in edge for edge in edges)) else {} pending = [start] while pending: cur = pending.pop(0) if distance[cur] < min(limit, 3): for nxt in sorted(routes.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 pending.append(nxt) sequence = list(distance) lastlevel = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f9([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 010 ```python def f10(left, right, fee): left = list(left) prices = {} for name0, rate0 in right[:20]: if name0 not in prices and rate0 != 0: prices[name0] = rate0 matched = [] for key, count in left: if key in prices: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f10([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 011 ```python def f11(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors: factors[name0] = rate0 combined = [] for key, count in left: if key in factors: combined.append((key, count * factors[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in factors}) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})} output = dict() output.update(returnvalue) return output ``` ``` f11([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 012 ```python def f12(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count % 100): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in returns: returns.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (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 ``` ``` f12([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 013 ```python def f13(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 startdegree = dict(incoming) handled = set() sequence = [] layers = [] while len(handled) < len(nodes) and len(handled) < 20: nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled)) if not nextbatch: break current = nextbatch layers.append(current) for node in current: handled.add(node) 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 ``` ``` f13(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 014 ```python def f14(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 startdegree = dict(incoming) finished = set() result = [] rounds = [] while len(finished) < len(nodes) and len(finished) < 20: available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20) if not available: break current = available rounds.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in nextmap[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f14(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 015 ```python def f15(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])): if not combined or left > combined[-1][1] + gap: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, len(combined)): left = combined[pos][0] gaps.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))} output = dict() output.update(returnvalue) return output ``` ``` f15([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 016 ```python def f16(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap: ratemap[name0] = rate0 matched = [] for key, count in left[:20]: if key in ratemap and count > 0: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f16([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 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(count): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = min(64, max(far, abs(x) + abs(y))) lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x))) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f17([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 018 ```python def f18(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right: if name0 not in ratemap or rate0 <= rate0 + 0: ratemap[name0] = rate0 matched = [] for key, count in left: if key in ratemap: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})} output = dict() output.update(returnvalue) return output ``` ``` f18([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 019 ```python def f19(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + max(0, gap): combined.append([left, right]) else: combined[-1][1] = right 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 ``` ``` f19([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 020 ```python def f20(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices or rate0 <= rate0 + 0: prices[name0] = rate0 matched = [] for key, count in left[:20]: if key in prices: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f20([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 021 ```python def f21(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) incoming[b] += 1 initial = dict(incoming) finished = set() 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), 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) 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 ``` ``` f21(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 022 ```python def f22(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] growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f22([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 023 ```python def f23(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices: prices[name0] = rate0 items = [] for key, count in left: if key in prices: items.append((key, count * prices[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)} output = dict() output.update(returnvalue) return output ``` ``` f23([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 024 ```python def f24(edges, start, limit): edges = list(edges) routes = {} for a, b in edges: routes.setdefault(a, []).append(b) steps = {start: 0} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < min(limit, 3): for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1): if nxt not in steps and (not nxt.startswith('Z')): steps[nxt] = steps[cur] + 1 queue.append(nxt) 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 ``` ``` f24([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 025 ```python def f25(rows, keep, prices): rows = list(rows) kept = [] buckets = {} amount = 0 for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))): if state in keep and value != 0: cost = value * prices[group] kept.append((code, cost)) buckets[group] = buckets.get(group, 0) + cost amount += cost kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, cost in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f25([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 026 ```python def f26(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) incoming[b] += 1 rootsource = dict(incoming) finished = set() result = [] rounds = [] while len(finished) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20) if not available: break current = available rounds.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f26(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 027 ```python def f27(spans, gap): spans = list(spans) result = [] for left, right in sorted(set(spans)): if not result or left > result[-1][1] + max(0, gap): result.append([left, right]) else: result[-1][1] = right 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 ``` ``` f27([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 028 ```python def f28(rows, keep, prices): rows = list(rows) matches = [] groupmap = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * prices[group] matches.append((code, score)) groupmap[group] = groupmap.get(group, 0) + score amount += score matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(matches), 'total': amount, 'groups': groupmap, 'top': [code for code, score in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f28([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 029 ```python def f29(lines, stop): lines = list(lines) frequency = {} stop = {str(word) for word in stop} tokens = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens[:64]: if word in stop 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 ``` ``` f29(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 030 ```python def f30(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] needs = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) needs[b] += 1 initial = dict(needs) handled = set() result = [] rounds = [] while len(handled) < len(nodes): nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled)) if not nextbatch: break current = nextbatch rounds.append(current) for node in current: handled.add(node) result.append(node) for node in current: for nxt in children[node]: needs[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f30(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 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] + 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 ``` ``` f31([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 032 ```python def f32(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): children.setdefault(a, []).append(b) distance = {start: 0} work = [start] while work: cur = work.pop(0) if distance[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 work.append(nxt) sequence = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f32([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 033 ```python def f33(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors: factors[name0] = rate0 matched = [] for key, count in left: if key in factors: matched.append((key, count * factors[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in factors)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f33([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 034 ```python def f34(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[: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 ``` ``` f34(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 035 ```python def f35(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + gap: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, len(combined)): left = combined[pos][0] gaps.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f35([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 036 ```python def f36(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} items = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop or len(word) > 12: 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': min(256, sum((len(word) * count for word, count in frequency.items())))} output = dict() output.update(returnvalue) return output ``` ``` f36(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 037 ```python def f37(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 known = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(min(count, 64)): x += dx y += dy used += 1 point = (x, y) if point in known and list(point) not in returns: returns.append(list(point)) known.add(point) far = 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 ``` ``` f37([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 038 ```python def f38(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 = (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 ``` ``` f38([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 039 ```python def f39(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} work = [start] while work: cur = work.pop(0) if distance[cur] < limit: for nxt in sorted(nextmap.get(cur, []))[:20]: if nxt not in distance: distance[nxt] = distance[cur] + 1 work.append(nxt) result = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f39([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 040 ```python def f40(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): nextmap.setdefault(a, []).append(b) steps = {start: 0} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < min(limit, 3): for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1): 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 ``` ``` f40([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 041 ```python def f41(lines, stop): lines = list(lines) wordmap = {} stop = {word.lower() for word in stop} tokens = [] for line in lines[:20]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop: continue wordmap[word] = wordmap.get(word, 0) + 1 sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in wordmap.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f41(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 042 ```python def f42(edges, start, limit): edges = list(edges) routes = {} for a, b in (edge for edge in edges if len(edge[1]) < 2): routes.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < min(limit, 3): for nxt in sorted(routes.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) 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 ``` ``` f42([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 043 ```python def f43(rows, keep, prices): rows = list(rows) matches = [] buckets = {} sumvalue = 0 for code, group, state, value in rows: if state in keep: score = value * abs(prices[group]) matches.append((code, score)) buckets[group] = buckets.get(group, 0) + score sumvalue += score matches.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': sumvalue, 'groups': buckets, 'top': [code for code, score in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f43([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 044 ```python def f44(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count): x = max(-64, min(64, x + dx)) y += dy used = min(64, used + 1) point = (x, y) if point in visited and list(point) not in returns: returns.append(list(point)) visited.add(point) far = max(far, 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 ``` ``` f44([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 045 ```python def f45(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 = 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 ``` ``` f45([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 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(values[pos:pos + size])) indexes = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)] increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f46([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 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 visited = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count % 100): x += dx y = 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 = 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 ``` ``` f47([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 048 ```python def f48(rows, keep, ratemap): rows = list(rows) selected = [] totals = {} grand = 0 for code, group, state, value in rows: if state in keep: cost = value * ratemap[group] selected.append((code, cost)) totals[group] = totals.get(group, 0) + cost grand += cost selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': totals, 'top': [code for code, cost in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f48([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 049 ```python def f49(values, width, limit): values = list(values) size = width windows = [] for pos in range(min(64, len(values) - size + 1)): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f49([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 050 ```python def f50(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices: prices[name0] = rate0 matched = [] for key, count in left[:20]: if key in prices: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})} output = dict() output.update(returnvalue) return output ``` ``` f50([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 051 ```python def f51(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, min(65, len(windows))) if windows[pos] >= windows[pos - 1])) returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f51([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 052 ```python def f52(values, width, limit): values = list(values) size = width windows = [] for pos in range(min(64, len(values) - size + 1)): windows.append(sum(values[pos:pos + size])) positions = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)] ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f52([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 053 ```python def f53(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices: prices[name0] = rate0 items = [] for key, count in left: if key in prices: items.append((key, count * prices[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len({key for key, value in items})} output = dict() output.update(returnvalue) return output ``` ``` f53([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 054 ```python def f54(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] indegree = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) indegree[b] += 1 startdegree = dict(indegree) finished = set() sequence = [] groups = [] while len(finished) < len(nodes): nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished)) 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 startdegree[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f54(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 055 ```python def f55(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans, key=lambda pair: pair[0]): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, min(50, len(combined))): left = combined[pos][0] gaps.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f55([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 056 ```python def f56(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f56([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 057 ```python def f57(edges, start, limit): edges = list(edges) children = {} for a, b in edges[:16]: children.setdefault(a, []).append(b) steps = {start: 0} pending = [start] while pending: cur = pending.pop(0) if steps[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in steps: steps[nxt] = steps[cur] + 1 pending.append(nxt) result = list(steps) lastlevel = sorted((node for node in steps if steps[node] == max(steps.values()))) returnvalue = {'order': result, 'depth': steps, 'frontier': lastlevel[:3], 'count': len(steps)} output = dict() output.update(returnvalue) return output ``` ``` f57([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 058 ```python def f58(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[:64]: if word in stop: continue frequency[word] = frequency.get(word, 0) + 1 ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) starts = {} for word, count in frequency.items(): starts[word[0]] = starts.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f58(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 059 ```python def f59(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) incoming[b] += 1 initial = dict(incoming) finished = set() result = [] rounds = [] while len(finished) < len(nodes) and len(finished) < 20: available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished)) if not available: break current = available rounds.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f59(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 060 ```python def f60(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[:64]: if word in stop: continue frequency[word] = frequency.get(word, 0) + 1 ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) heads = {} for word, count in frequency.items(): heads[word[0]] = heads.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f60(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 061 ```python def f61(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 = [] layers = [] while len(handled) < len(nodes) and len(handled) < 20: available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes))) 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 initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f61(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 062 ```python def f62(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices and rate0 != 0: prices[name0] = rate0 items = [] for key, count in left[:20]: if key in prices: items.append((key, count * prices[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})} output = dict() output.update(returnvalue) return output ``` ``` f62([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 063 ```python def f63(lines, stop): lines = list(lines) wordmap = {} stop = {str(word) for word in stop} items = [] for line in lines: text = line.lower() word = '' for char in text[: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 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 ``` ``` f63(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 064 ```python def f64(lines, stop): lines = list(lines) tallies = {} stop = {str(word) for word in stop} items = [] for line in lines[:20]: text = line.lower() word = '' for char in text[:64]: if 'a' <= char <= 'z': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop: continue tallies[word] = tallies.get(word, 0) + 1 ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in tallies.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))} output = dict() output.update(returnvalue) return output ``` ``` f64(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 065 ```python def f65(values, width, limit): values = list(values) size = width windows = [] for pos in range(min(64, len(values) - size + 1)): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f65([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 066 ```python def f66(left, right, fee): left = list(left) factors = {} for name0, rate0 in right[:20]: if name0 not in factors: factors[name0] = rate0 matched = [] for key, count in left: if key in factors: matched.append((key, count * factors[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in factors)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f66([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 067 ```python def f67(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) finished = set() result = [] rounds = [] while len(finished) < len(nodes): available = sorted((node for node in nodes if needs[node] == 0 and node not in finished)) if not available: break current = available rounds.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in nextmap[node]: needs[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f67(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 068 ```python def f68(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': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop: continue tallies[word] = tallies.get(word, 0) + 1 sorteditems = 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 sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))} output = dict() output.update(returnvalue) return output ``` ``` f68(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 069 ```python def f69(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} nextmap = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) nextmap[a].append(b) incoming[b] += 1 rootsource = dict(incoming) handled = set() result = [] layers = [] while len(handled) < len(nodes) and len(handled) < 20: available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled)) if not available: break current = available[:1] if any((str(node).isupper() for node in nodes)) else available layers.append(current) for node in current: handled.add(node) result.append(node) for node in current: for nxt in nextmap[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 ``` ``` f69(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 070 ```python def f70(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans): if not result or left > result[-1][1] + gap: result.append([left, right]) else: result[-1][1] = right gaps = [] for pos in range(1, min(50, len(result))): left = result[pos][0] gaps.append(left - result[pos - 1][1]) returnvalue = {'segments': result, 'cover': sum((min(100, right - left) for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))} output = dict() output.update(returnvalue) return output ``` ``` f70([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 071 ```python def f71(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 and (limit >= 0 or pos > 0)] increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f71([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 072 ```python def f72(nodes, edges): nodes = list(nodes) indegree = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) indegree[b] += 1 startdegree = dict(indegree) handled = set() sequence = [] rounds = [] while len(handled) < len(nodes): available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=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 children[node]: indegree[nxt] -= 1 returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f72(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 073 ```python def f73(rows, keep, ratemap): rows = list(rows) selected = [] groupmap = {} amount = 0 for code, group, state, value in rows: if state in keep and value >= 0: cost = value * ratemap[group] selected.append((code, cost)) groupmap[group] = groupmap.get(group, 0) + cost amount += cost selected.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f73([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 074 ```python def f74(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap: ratemap[name0] = rate0 combined = [] for key, count in left: if key in ratemap and count > 0: combined.append((key, count * ratemap[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len({key for key, value in combined})} output = dict() output.update(returnvalue) return output ``` ``` f74([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 075 ```python def f75(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors: factors[name0] = rate0 matched = [] for key, count in left: if key in factors: matched.append((key, count * factors[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted({key for key, count in left if key not in factors}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f75([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 076 ```python def f76(lines, stop): lines = list(lines) tallies = {} stop = {str(word) for word in stop} tokens = [] for line in lines[:20]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens[:64]: if word in stop: continue tallies[word] = tallies.get(word, 0) + 1 ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0])) 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 ``` ``` f76(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 077 ```python def f77(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} tokens = [] for line in lines[:20]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop or len(word) > 12: 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 ``` ``` f77(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 078 ```python def f78(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 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 = 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 ``` ``` f78([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 079 ```python def f79(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} nextmap = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) nextmap[a].append(b) incoming[b] += 1 rootsource = dict(incoming) handled = set() listing = [] layers = [] while len(handled) < len(nodes): nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20) if not nextbatch: break current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch layers.append(current) for node in current: handled.add(node) listing.append(node) for node in current: for nxt in nextmap[node]: incoming[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f79(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 080 ```python def f80(spans, gap): spans = list(spans) result = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not result or left > result[-1][1] + gap: 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 ``` ``` f80([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 081 ```python def f81(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) incoming[b] += 1 rootsource = dict(incoming) complete = set() sequence = [] rounds = [] while len(complete) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete)) if not available: break current = available rounds.append(current) for node in current: complete.add(node) sequence.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f81(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 082 ```python def f82(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) levels = {start: 0} queue = [start] while queue: cur = queue.pop(0) if levels[cur] < limit: for nxt in sorted(nextmap.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 ``` ``` f82([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 083 ```python def f83(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans): if not result or left > result[-1][1] + gap % 5 + 1: result.append([left, right]) else: result[-1][1] = max(result[-1][1], right) spaces = [] for pos in range(1, len(result)): left = result[pos][0] spaces.append(left - result[pos - 1][1]) returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))} output = dict() output.update(returnvalue) return output ``` ``` f83([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 084 ```python def f84(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices: prices[name0] = rate0 combined = [] for key, count in left[:20]: if key in prices: combined.append((key, count * prices[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)} output = dict() output.update(returnvalue) return output ``` ``` f84([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 085 ```python def f85(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): nextmap.setdefault(a, []).append(b) levels = {start: 0} queue = [start] while queue: cur = queue.pop(0) if levels[cur] < min(limit, 3): for nxt in sorted(nextmap.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 queue.append(nxt) result = list(levels) furthest = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f85([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 086 ```python def f86(rows, keep, factors): rows = list(rows) kept = [] totals = {} amount = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: score = value * abs(factors[group]) kept.append((code, score)) totals[group] = totals.get(group, 0) + score amount += score kept.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, score in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f86([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 087 ```python def f87(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) spaces = [] for pos in range(1, len(combined)): left = combined[pos][0] spaces.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((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 ``` ``` f87([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 088 ```python def f88(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] needs = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) needs[b] += 1 startdegree = dict(needs) finished = set() listing = [] layers = [] while len(finished) < len(nodes) and len(finished) < 20: nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished)) if not nextbatch: break current = nextbatch layers.append(current) for node in current: finished.add(node) listing.append(node) for node in current: for nxt in children[node]: needs[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f88(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 089 ```python def f89(lines, stop): lines = list(lines) frequency = {} stop = {str(word) for word in stop} terms = [] for line in lines[:32]: text = line.lower() word = '' for char in text[: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 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 ``` ``` f89(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 090 ```python def f90(nodes, edges): nodes = list(nodes) needs = {node: 0 for node in nodes} routes = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) routes[a].append(b) needs[b] += 1 initial = dict(needs) finished = set() sequence = [] rounds = [] while len(finished) < len(nodes) and len(finished) < 20: available = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20) if not available: break current = available rounds.append(current) for node in current: finished.add(node) sequence.append(node) for node in current: for nxt in routes[node]: needs[nxt] -= 1 returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f90(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 091 ```python def f91(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if len(edge[1]) < 2): children.setdefault(a, []).append(b) distance = {start: 0} if any((start in edge for edge in edges)) else {} pending = [start] while pending: cur = pending.pop(0) if distance[cur] < limit: for nxt in sorted(children.get(cur, []))[:20]: if nxt not in distance: distance[nxt] = distance[cur] + 1 pending.append(nxt) sequence = list(distance) 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 ``` ``` f91([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 092 ```python def f92(values, width, limit): values = list(values) size = width totals = [] for pos in range(min(64, len(values) - size + 1)): totals.append(sum((max(item, 0) for item in values[pos:pos + size]))) positions = [pos for pos, value in enumerate(totals) if value >= limit] increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1])) returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': positions, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f92([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 093 ```python def f93(edges, start, limit): edges = list(edges) children = {} for a, b in edges: children.setdefault(a, []).append(b) steps = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {} work = [start] while work: cur = work.pop(0) if steps[cur] < limit: for nxt in sorted(children.get(cur, []))[:20]: 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 ``` ``` f93([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 094 ```python def f94(rows, keep, ratemap): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if state in keep and value != 0: cost = value * ratemap[group] selected.append((code, cost)) totals[group] = totals.get(group, 0) + cost amount += cost selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f94([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 095 ```python def f95(edges, start, limit): edges = list(edges) routes = {} for a, b in edges: routes.setdefault(a, []).append(b) steps = {start: 0} pending = [start] while pending: cur = pending.pop(0) if steps[cur] < limit: for nxt in sorted(routes.get(cur, [])): if nxt not in steps: steps[nxt] = steps[cur] + 1 pending.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 ``` ``` f95([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 096 ```python def f96(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])) indexes = [pos for pos, value in enumerate(series) if value >= limit] ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f96([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 097 ```python def f97(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 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 ``` ``` f97([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 098 ```python def f98(rows, keep, factors): rows = list(rows) matches = [] groupmap = {} grand = 0 for code, group, state, value in rows: if state in keep and value >= 0: cost = value * factors[group] matches.append((code, cost)) groupmap[group] = groupmap.get(group, 0) + cost grand += cost matches.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(matches), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f98([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 099 ```python def f99(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f99([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 100 ```python def f100(rows, keep, ratemap): rows = list(rows) kept = [] buckets = {} amount = 0 for code, group, state, value in rows: if state in keep: cost = value * abs(ratemap[group]) kept.append((code, cost)) buckets[group] = buckets.get(group, 0) + cost amount += cost kept.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, cost in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f100([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 101 ```python def f101(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + gap + 1: combined.append([left, right]) else: combined[-1][1] = right 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 ``` ``` f101([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 102 ```python def f102(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 ``` ``` f102(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 103 ```python def f103(rows, keep, ratemap): rows = list(rows) kept = [] groupmap = {} amount = 0 for code, group, state, value in rows: if state in keep and value >= 0: charge = value * ratemap[group] kept.append((code, charge)) groupmap[group] = groupmap.get(group, 0) + charge amount += charge kept.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(kept), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f103([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 104 ```python def f104(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): nextmap.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < limit: for nxt in sorted(nextmap.get(cur, []))[:20]: if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) result = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': result, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f104([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 105 ```python def f105(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not combined or left > combined[-1][1] + gap: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, len(combined)): left = combined[pos][0] gaps.append(min(100, left - combined[pos - 1][1])) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))} output = dict() output.update(returnvalue) return output ``` ``` f105([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 106 ```python def f106(rows, keep, ratemap): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * ratemap[group] selected.append((code, score)) totals[group] = totals.get(group, 0) + score amount += score selected.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f106([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 107 ```python def f107(spans, gap): spans = list(spans) segments = [] for left, right in sorted(spans): if not segments or left > segments[-1][1] + min(gap, 2): segments.append([left, right]) else: segments[-1][1] = right gaps = [] for pos in range(1, len(segments)): left = segments[pos][0] gaps.append(left - segments[pos - 1][1]) returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in segments)))} output = dict() output.update(returnvalue) return output ``` ``` f107([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 108 ```python def f108(left, right, fee): left = list(left) prices = {} for name0, rate0 in right[:20]: if name0 not in prices: prices[name0] = rate0 combined = [] for key, count in left[:20]: if key in prices: combined.append((key, count * prices[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)} output = dict() output.update(returnvalue) return output ``` ``` f108([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 109 ```python def f109(rows, keep, prices): rows = list(rows) matches = [] groupmap = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * abs(prices[group]) matches.append((code, score)) groupmap[group] = groupmap.get(group, 0) + score amount += score matches.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': groupmap, 'top': [code for code, score in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f109([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 110 ```python def f110(rows, keep, prices): rows = list(rows) kept = [] totals = {} amount = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep} and value >= 0: score = value * prices[group] kept.append((code, score)) totals[group] = totals.get(group, 0) + score amount += score kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, score in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f110([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 111 ```python def f111(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right: if name0 not in ratemap: ratemap[name0] = rate0 matched = [] for key, count in left: if key in ratemap and count > 0: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f111([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 112 ```python def f112(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: if before == after: continue a, b = (before, after) routes[a].append(b) incoming[b] += 1 initial = dict(incoming) complete = set() listing = [] layers = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes))) if not nextbatch: break current = nextbatch layers.append(current) for node in current: complete.add(node) listing.append(node) for node in current: for nxt in routes[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 ``` ``` f112(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 113 ```python def f113(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 known = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(min(count, 64)): x = max(-64, min(64, x + dx)) y += dy used += 1 point = (x, y) if point in known and list(point) not in returns: returns.append(list(point)) known.add(point) far = max(far, min(20, abs(x) + abs(y))) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f113([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 114 ```python def f114(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors: factors[name0] = rate0 combined = [] for key, count in left[:20]: if key in factors and count > 0: combined.append((key, count * factors[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in factors)) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len({key for key, value in combined})} output = dict() output.update(returnvalue) return output ``` ``` f114([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 115 ```python def f115(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 = 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 ``` ``` f115([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 116 ```python def f116(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 rootsource = dict(indegree) handled = set() sequence = [] layers = [] 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 layers.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': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f116(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 117 ```python def f117(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 found = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(min(count, 64)): x += dx y += dy used += 1 point = (x, y) if point in found and list(point) not in returns: returns.append(list(point)) found.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f117([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 118 ```python def f118(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] needs = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) needs[b] += 1 rootsource = dict(needs) finished = set() sequence = [] layers = [] while len(finished) < len(nodes): nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=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 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(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 119 ```python def f119(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) incoming[b] += 1 initial = dict(incoming) handled = set() result = [] layers = [] while len(handled) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20) if not available: break current = available layers.append(current) for node in current: handled.add(node) 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 ``` ``` f119(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 120 ```python def f120(left, right, fee): left = list(left) prices = {} for name0, rate0 in right[:20]: if name0 not in prices: prices[name0] = rate0 matched = [] for key, count in left: if key in prices: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})} output = dict() output.update(returnvalue) return output ``` ``` f120([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 121 ```python def f121(values, width, limit): values = list(values) size = width series = [] for pos in range(min(64, len(values) - size + 1)): series.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(series) if value >= limit] increases = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': max([0] + series), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f121([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 122 ```python def f122(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) steps = {start: 0} work = [start] while work: cur = work.pop(0) if steps[cur] < limit: for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1): if nxt not in steps: steps[nxt] = steps[cur] + 1 work.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 ``` ``` f122([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 123 ```python def f123(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) levels = {start: 0} if any((start in edge for edge in edges)) else {} pending = [start] while pending: cur = pending.pop(0) if levels[cur] < limit: for nxt in sorted(nextmap.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 pending.append(nxt) result = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': result, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f123([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 124 ```python def f124(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} 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, []))[: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, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f124([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 125 ```python def f125(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) 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 ``` ``` f125([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 126 ```python def f126(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] growth = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f126([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 127 ```python def f127(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) finished = set() sequence = [] groups = [] while len(finished) < len(nodes) and len(finished) < 20: available = sorted((node for node in nodes if needs[node] == 0 and node not in finished)) if not available: break current = available groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f127(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 128 ```python def f128(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) incoming[b] += 1 rootsource = dict(incoming) complete = set() listing = [] layers = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20) if not nextbatch: break current = nextbatch layers.append(current) for node in current: complete.add(node) listing.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f128(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 129 ```python def f129(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + max(0, gap): combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) spaces = [] for pos in range(1, min(50, len(combined))): left = combined[pos][0] spaces.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f129([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 130 ```python def f130(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 = max(-64, min(64, x + dx)) y += dy used += 1 point = (x, y) if point in known and list(point) not in crossings: crossings.append(list(point)) known.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f130([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 131 ```python def f131(rows, keep, ratemap): rows = list(rows) matches = [] groupmap = {} grand = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: score = value * ratemap[group] matches.append((code, score)) groupmap[group] = groupmap.get(group, 0) + score grand += score matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(matches), 'total': grand, 'groups': groupmap, 'top': [code for code, score in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f131([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 132 ```python def f132(rows, keep, prices): rows = list(rows) matches = [] totals = {} amount = 0 for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))): if state in keep and value >= 0: charge = value * abs(prices[group]) matches.append((code, charge)) totals[group] = totals.get(group, 0) + charge amount += charge matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, charge in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f132([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 133 ```python def f133(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) incoming[b] += 1 rootsource = dict(incoming) finished = set() sequence = [] groups = [] while len(finished) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished)) if not available: break current = available[:1] if any((str(node).isupper() for node in nodes)) else available groups.append(current) for node in current: finished.add(node) sequence.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f133(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 134 ```python def f134(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} 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, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f134([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 135 ```python def f135(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap: ratemap[name0] = rate0 items = [] for key, count in left[:20]: if key in ratemap: items.append((key, count * ratemap[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len({key for key, value in items})} output = dict() output.update(returnvalue) return output ``` ``` f135([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 136 ```python def f136(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans): if not result or left > result[-1][1] + max(0, gap) + 1: result.append([left, right]) else: result[-1][1] = max(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 ``` ``` f136([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 137 ```python def f137(lines, stop): lines = list(lines) wordmap = {} stop = {word.lower() for word in stop} items = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop: continue wordmap[word] = wordmap.get(word, 0) + 1 ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in wordmap.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f137(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 138 ```python def f138(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans): if not result or left > result[-1][1] + gap + 1: result.append([left, right]) else: result[-1][1] = max(0, result[-1][1], right) 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 ``` ``` f138([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 139 ```python def f139(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[:64]: 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': min(256, sum((len(word) * count for word, count in tallies.items())))} output = dict() output.update(returnvalue) return output ``` ``` f139(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 140 ```python def f140(lines, stop): lines = list(lines) wordmap = {} stop = {word.lower() for word in stop} items = [] for line in lines[:32]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items[:64]: if word in stop or len(word) > 12: continue wordmap[word] = wordmap.get(word, 0) + 1 ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in wordmap.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f140(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 141 ```python def f141(left, right, fee): left = list(left) factors = {} for name0, rate0 in right[:20]: if name0 not in factors: factors[name0] = rate0 matched = [] for key, count in left[:20]: if key in factors: matched.append((key, count * factors[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in factors}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f141([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 142 ```python def f142(values, width, limit): values = list(values) size = width series = [] for pos in range(min(64, len(values) - size + 1)): series.append(sum((max(item, 0) for item in values[pos:pos + size]))) matches = [pos for pos, value in enumerate(series) if value >= limit] increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f142([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 143 ```python def f143(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] indegree = {node: 0 for node in nodes} nextmap = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) nextmap[a].append(b) indegree[b] += 1 startdegree = dict(indegree) finished = set() listing = [] layers = [] while len(finished) < len(nodes) and len(finished) < 20: available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished)) if not available: break current = available layers.append(current) for node in current: finished.add(node) listing.append(node) for node in current: for nxt in nextmap[node]: indegree[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f143(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 144 ```python def f144(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 ``` ``` f144([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 145 ```python def f145(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, 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 ``` ``` f145([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 146 ```python def f146(spans, gap): spans = list(spans) segments = [] for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)): if not segments or left > segments[-1][1] + max(0, gap): segments.append([left, right]) else: segments[-1][1] = 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 ``` ``` f146([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 147 ```python def f147(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] incoming = {node: 0 for node in nodes} nextmap = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) nextmap[a].append(b) incoming[b] += 1 initial = dict(incoming) handled = set() sequence = [] layers = [] while len(handled) < len(nodes) and len(handled) < 20: nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled)) if not nextbatch: break current = nextbatch layers.append(current) for node in current: handled.add(node) 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 ``` ``` f147(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 148 ```python def f148(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = min(64, max(far, abs(x) + abs(y))) lowx, highx = (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 ``` ``` f148([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 149 ```python def f149(left, right, fee): left = list(left) prices = {} for name0, rate0 in right[:20]: if name0 not in prices and rate0 != 0: prices[name0] = rate0 matched = [] for key, count in left: if key in prices and count > 0: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f149([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 150 ```python def f150(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] growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f150([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 151 ```python def f151(spans, gap): spans = list(spans) result = [] for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)): if not result or left > result[-1][1] + gap % 5: result.append([left, right]) else: result[-1][1] = max(result[-1][1], right) 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 ``` ``` f151([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 152 ```python def f152(lines, stop): lines = list(lines) frequency = {} stop = {str(word) for word in stop} tokens = [] for line in lines[:32]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop: continue frequency[word] = frequency.get(word, 0) + 1 sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in frequency.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f152(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 153 ```python def f153(edges, start, limit): edges = list(edges) children = {} for a, b in edges: children.setdefault(a, []).append(b) distance = {start: 0} pending = [start] while pending: cur = pending.pop(0) if distance[cur] < limit: for nxt in sorted(children.get(cur, []))[:20]: if nxt not in distance: distance[nxt] = distance[cur] + 1 pending.append(nxt) sequence = list(distance) lastlevel = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f153([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 154 ```python def f154(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] growth = 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': growth} output = dict() output.update(returnvalue) return output ``` ``` f154([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 155 ```python def f155(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if len(edge[0]) < 2): nextmap.setdefault(a, []).append(b) steps = {start: 0} if any((start in edge for edge in edges)) else {} work = [start] while work: cur = work.pop(0) if steps[cur] < limit: for nxt in sorted(nextmap.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 ``` ``` f155([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 156 ```python def f156(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)] increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f156([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 157 ```python def f157(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} pending = [start] while pending: cur = pending.pop(0) if distance[cur] < min(limit, 3): for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1): if nxt not in distance: distance[nxt] = distance[cur] + 1 pending.append(nxt) result = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f157([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 158 ```python def f158(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) 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 ``` ``` f158([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 159 ```python def f159(rows, keep, prices): rows = list(rows) selected = [] buckets = {} amount = 0 for code, group, state, value in rows: if state in keep and value >= 0: charge = value * abs(prices[group]) selected.append((code, charge)) buckets[group] = buckets.get(group, 0) + charge amount += charge selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': buckets, 'top': [code for code, charge in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f159([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 160 ```python def f160(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] growth = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f160([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 161 ```python def f161(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, 64)): x += dx y += dy used += 1 point = (x, y) if point in found and list(point) not in returns: returns.append(list(point)) found.add(point) far = max(far, min(20, abs(x) + abs(y))) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f161([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 162 ```python def f162(rows, keep, factors): rows = list(rows) matches = [] groupmap = {} sumvalue = 0 for code, group, state, value in rows: if state in keep: cost = value * abs(factors[group]) matches.append((code, cost)) groupmap[group] = groupmap.get(group, 0) + cost sumvalue += cost matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f162([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 163 ```python def f163(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 known = {(0, 0)} repeats = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count % 100): x += dx y = max(-64, min(64, y + dy)) used += 1 point = (x, y) if point in known and list(point) not in repeats: repeats.append(list(point)) known.add(point) far = max(far, min(20, abs(x) + abs(y))) lowx, highx = (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 ``` ``` f163([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 164 ```python def f164(rows, keep, ratemap): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: cost = value * ratemap[group] selected.append((code, cost)) totals[group] = totals.get(group, 0) + cost amount += cost selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f164([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 165 ```python def f165(left, right, fee): left = list(left) factors = {} for name0, rate0 in right[:20]: if name0 not in factors: factors[name0] = rate0 items = [] for key, count in left: if key in factors and count > 0: items.append((key, count * factors[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in factors)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)} output = dict() output.update(returnvalue) return output ``` ``` f165([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 166 ```python def f166(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 += 1 point = (x, y) if point in known and list(point) not in crossings: crossings.append(list(point)) known.add(point) far = min(64, max(far, abs(x) + abs(y))) lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x))) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f166([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 167 ```python def f167(rows, keep, prices): rows = list(rows) kept = [] buckets = {} sumvalue = 0 for code, group, state, value in rows: if state in keep and value != 0: score = value * prices[group] kept.append((code, score)) buckets[group] = buckets.get(group, 0) + score sumvalue += score kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': buckets, 'top': [code for code, score in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f167([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 168 ```python def f168(values, width, limit): values = list(values) size = width windows = [] for pos in range(min(64, len(values) - size + 1)): windows.append(sum((max(item, 0) for item in values[pos:pos + size]))) positions = [pos for pos, value in enumerate(windows) if value >= limit] 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 ``` ``` f168([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 169 ```python def f169(lines, stop): lines = list(lines) tallies = {} 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 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 ``` ``` f169(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 170 ```python def f170(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} repeats = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(min(count, 64)): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in repeats: repeats.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f170([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 171 ```python def f171(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])) 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 ``` ``` f171(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 172 ```python def f172(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])): if not combined or left > combined[-1][1] + gap: combined.append([left, right]) else: combined[-1][1] = max(0, combined[-1][1], right) breaks = [] for pos in range(1, min(50, 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 ``` ``` f172([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 173 ```python def f173(rows, keep, prices): rows = list(rows) kept = [] groupmap = {} grand = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: cost = value * prices[group] kept.append((code, cost)) groupmap[group] = groupmap.get(group, 0) + cost grand += cost kept.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f173([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 174 ```python def f174(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 found = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count): x += dx y += dy used += 1 point = (x, y) if point in found and list(point) not in returns: returns.append(list(point)) found.add(point) far = max(far, min(20, abs(x) + abs(y))) lowx, highx = (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 ``` ``` f174([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 175 ```python def f175(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 ``` ``` f175([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 176 ```python def f176(spans, gap): spans = list(spans) combined = [] for left, right in sorted(set(spans)): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) breaks = [] for pos in range(1, len(combined)): left = combined[pos][0] breaks.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f176([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 177 ```python def f177(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])): if not result or left > result[-1][1] + min(gap, 2): result.append([left, right]) else: result[-1][1] = max(0, result[-1][1], right) 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 ``` ``` f177([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 178 ```python def f178(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 startdegree = dict(incoming) handled = set() sequence = [] groups = [] while len(handled) < len(nodes): nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20) if not nextbatch: break current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch groups.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': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f178(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 179 ```python def f179(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right: if name0 not in ratemap or rate0 <= rate0 + 0: ratemap[name0] = rate0 items = [] for key, count in left: if key in ratemap and count > 0: items.append((key, count * ratemap[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})} output = dict() output.update(returnvalue) return output ``` ``` f179([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 180 ```python def f180(spans, gap): spans = list(spans) result = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not result or left > result[-1][1] + gap % 5: result.append([left, right]) else: result[-1][1] = max(result[-1][1], right) gaps = [] for pos in range(1, len(result)): left = result[pos][0] gaps.append(min(100, 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 ``` ``` f180([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 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 startdegree = dict(incoming) finished = set() listing = [] layers = [] while len(finished) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes))) if not available: break current = available layers.append(current) for node in current: finished.add(node) listing.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f181(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 182 ```python def f182(rows, keep, prices): rows = list(rows) selected = [] groupmap = {} amount = 0 for code, group, state, value in rows: if state in keep: cost = value * prices[group] selected.append((code, cost)) groupmap[group] = groupmap.get(group, 0) + cost amount += cost selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f182([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 183 ```python def f183(lines, stop): lines = list(lines) wordmap = {} stop = {word.lower() for word in stop} tokens = [] for line in lines[:32]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens[:64]: if word in stop: continue wordmap[word] = wordmap.get(word, 0) + 1 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 ``` ``` f183(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 184 ```python def f184(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not combined or left > combined[-1][1] + gap: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, len(combined)): left = combined[pos][0] gaps.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))} output = dict() output.update(returnvalue) return output ``` ``` f184([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 185 ```python def f185(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices and rate0 != 0: prices[name0] = rate0 matched = [] for key, count in left: if key in prices: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f185([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 186 ```python def f186(lines, stop): lines = list(lines) frequency = {} stop = {str(word) for word in stop} tokens = [] for line in lines: text = line.lower() word = '' for char in text[:64]: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop: continue frequency[word] = frequency.get(word, 0) + 1 ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) heads = {} for word, count in frequency.items(): heads[word[0]] = heads.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f186(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 187 ```python def f187(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[:64]: if word in stop: continue wordmap[word] = wordmap.get(word, 0) + 1 ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in wordmap.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f187(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 188 ```python def f188(spans, gap): spans = list(spans) segments = [] for left, right in sorted(spans, key=lambda pair: pair[0]): if not segments or left > segments[-1][1] + gap: segments.append([left, right]) else: segments[-1][1] = 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 ``` ``` f188([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 189 ```python def f189(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if len(edge[1]) < 2): children.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < limit: for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1): if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) sequence = list(distance) lastlevel = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f189([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 190 ```python def f190(rows, keep, factors): rows = list(rows) kept = [] buckets = {} grand = 0 for code, group, state, value in rows: if state in keep: score = value * abs(factors[group]) kept.append((code, score)) buckets[group] = buckets.get(group, 0) + score grand += score kept.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(kept), 'total': grand, 'groups': buckets, 'top': [code for code, score in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f190([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 191 ```python def f191(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum((max(item, 0) for item in values[pos:pos + size]))) positions = [pos for pos, value in enumerate(windows) if value >= limit 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 ``` ``` f191([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 192 ```python def f192(lines, stop): lines = list(lines) wordmap = {} stop = {word.lower() for word in stop} tokens = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z' or (char == "'" and word): word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens[:64]: if word in stop: continue wordmap[word] = wordmap.get(word, 0) + 1 ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) heads = {} for word, count in wordmap.items(): heads[word[0]] = heads.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f192(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 193 ```python def f193(rows, keep, factors): rows = list(rows) selected = [] groupmap = {} amount = 0 for code, group, state, value in rows: if state in keep and value >= 0: cost = value * factors[group] selected.append((code, cost)) groupmap[group] = groupmap.get(group, 0) + cost amount += cost selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f193([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 194 ```python def f194(rows, keep, factors): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * factors[group] selected.append((code, score)) totals[group] = totals.get(group, 0) + score amount += score selected.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f194([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 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 visited = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f195([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 196 ```python def f196(rows, keep, prices): rows = list(rows) matches = [] totals = {} grand = 0 for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))): if state in keep and value >= 0: cost = value * prices[group] matches.append((code, cost)) totals[group] = totals.get(group, 0) + cost grand += cost matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(matches), 'total': grand, 'groups': totals, 'top': [code for code, cost in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f196([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 197 ```python def f197(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices: prices[name0] = rate0 matched = [] for key, count in left[:20]: if key in prices: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f197([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 198 ```python def f198(lines, stop): lines = list(lines) frequency = {} stop = {str(word) for word in stop} tokens = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop: continue frequency[word] = min(9, 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': min(256, sum((len(word) * count for word, count in frequency.items())))} output = dict() output.update(returnvalue) return output ``` ``` f198(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 199 ```python def f199(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count % 100): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f199([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 200 ```python def f200(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 = min(64, used + 1) point = (x, y) if point in known and list(point) not in repeats: repeats.append(list(point)) known.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x))) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f200([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 201 ```python def f201(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap or rate0 <= rate0 + 0: ratemap[name0] = rate0 matched = [] for key, count in left: if key in ratemap: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f201([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 202 ```python def f202(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not combined or left > combined[-1][1] + 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': min(100, max((right - left for left, right in combined)))} output = dict() output.update(returnvalue) return output ``` ``` f202([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 203 ```python def f203(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 ``` ``` f203([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 204 ```python def f204(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 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 ``` ``` f204([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 205 ```python def f205(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap: ratemap[name0] = rate0 matched = [] for key, count in left[:20]: if key in ratemap and count > 0: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f205([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 206 ```python def f206(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1])) returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f206([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 207 ```python def f207(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': max([0] + windows), 'hits': indexes, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f207([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 208 ```python def f208(spans, gap): spans = list(spans) segments = [] for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)): if not segments or left > segments[-1][1] + gap % 5 + 1: segments.append([left, right]) else: segments[-1][1] = max(segments[-1][1], right) gaps = [] for pos in range(1, len(segments)): left = segments[pos][0] gaps.append(left - segments[pos - 1][1]) returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))} output = dict() output.update(returnvalue) return output ``` ``` f208([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 209 ```python def f209(rows, keep, ratemap): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * ratemap[group] selected.append((code, score)) totals[group] = totals.get(group, 0) + score amount += score selected.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f209([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 210 ```python def f210(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = right gaps = [] for pos in range(1, 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 ``` ``` f210([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 211 ```python def f211(rows, keep, ratemap): rows = list(rows) kept = [] buckets = {} grand = 0 for code, group, state, value in rows: if state in keep: charge = value * abs(ratemap[group]) kept.append((code, charge)) buckets[group] = buckets.get(group, 0) + charge grand += charge kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': grand, 'groups': buckets, 'top': [code for code, charge in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f211([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 212 ```python def f212(edges, start, limit): edges = list(edges) routes = {} for a, b in (edge for edge in edges if len(edge[1]) < 2): routes.setdefault(a, []).append(b) distance = {start: 0} work = [start] while work: cur = work.pop(0) if distance[cur] < min(limit, 3): for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1): if nxt not in distance: distance[nxt] = distance[cur] + 1 work.append(nxt) sequence = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f212([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 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)} 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, 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 ``` ``` f213([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 214 ```python def f214(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() sequence = [] layers = [] while len(handled) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20) if not available: break current = available layers.append(current) for node in current: handled.add(node) sequence.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f214(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 215 ```python def f215(rows, keep, factors): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if state in keep: charge = value * factors[group] selected.append((code, charge)) totals[group] = totals.get(group, 0) + charge amount += charge selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, charge in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f215([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 216 ```python def f216(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] = 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 ``` ``` f216([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 217 ```python def f217(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap or rate0 <= rate0 + 0: ratemap[name0] = rate0 matched = [] for key, count in left[:20]: if key in ratemap: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f217([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 218 ```python def f218(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] increases = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1])) returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f218([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 219 ```python def f219(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 = [] groups = [] 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 groups.append(current) for node in current: handled.add(node) result.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f219(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 220 ```python def f220(left, right, fee): left = list(left) prices = {} for name0, rate0 in right[:20]: if name0 not in prices: prices[name0] = rate0 items = [] for key, count in left: if key in prices: items.append((key, count * prices[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len({key for key, value in items})} output = dict() output.update(returnvalue) return output ``` ``` f220([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 221 ```python def f221(rows, keep, ratemap): rows = list(rows) matches = [] buckets = {} grand = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: cost = value * ratemap[group] matches.append((code, cost)) buckets[group] = buckets.get(group, 0) + cost grand += cost matches.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(matches), 'total': grand, 'groups': buckets, 'top': [code for code, cost in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f221([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 222 ```python def f222(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if len(edge[0]) < 2): nextmap.setdefault(a, []).append(b) steps = {start: 0} work = [start] while work: cur = work.pop(0) if steps[cur] < limit: for nxt in sorted(nextmap.get(cur, []))[:20]: if nxt not in steps: steps[nxt] = steps[cur] + 1 work.append(nxt) sequence = list(steps) furthest = sorted((node for node in steps if steps[node] == max(steps.values()))) returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)} output = dict() output.update(returnvalue) return output ``` ``` f222([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 223 ```python def f223(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 sorted(routes.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 work.append(nxt) sequence = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f223([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 224 ```python def f224(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): nextmap.setdefault(a, []).append(b) levels = {start: 0} queue = [start] while queue: cur = queue.pop(0) if levels[cur] < limit: for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1): if nxt not in levels: levels[nxt] = levels[cur] + 1 queue.append(nxt) result = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': result, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f224([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 225 ```python def f225(values, width, limit): values = list(values) size = width totals = [] for pos in range(len(values) - size + 1): totals.append(sum((max(item, 0) for item in values[pos:pos + size]))) matches = [pos for pos, value in enumerate(totals) if value >= limit] growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1])) returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f225([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 226 ```python def f226(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): children.setdefault(a, []).append(b) steps = {start: 0} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < min(limit, 3): for nxt in sorted(children.get(cur, [])): if nxt not in steps: steps[nxt] = steps[cur] + 1 queue.append(nxt) sequence = list(steps) 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 ``` ``` f226([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 227 ```python def f227(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[:64]: if word in stop or len(word) < 2: continue frequency[word] = frequency.get(word, 0) + 1 ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) heads = {} for word, count in frequency.items(): heads[word[0]] = heads.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f227(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 228 ```python def f228(rows, keep, factors): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if state in keep: score = value * factors[group] selected.append((code, score)) totals[group] = totals.get(group, 0) + score amount += score selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f228([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 229 ```python def f229(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right: if name0 not in ratemap: ratemap[name0] = rate0 items = [] for key, count in left[:20]: if key in ratemap: items.append((key, count * ratemap[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)} output = dict() output.update(returnvalue) return output ``` ``` f229([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 230 ```python def f230(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 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 = max(-64, min(64, x + dx)) y += dy used += 1 point = (x, y) if point in known and list(point) not in crossings: crossings.append(list(point)) known.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f230([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 231 ```python def f231(values, width, limit): values = list(values) size = width windows = [] for pos in range(min(64, len(values) - size + 1)): windows.append(sum(values[pos:pos + size])) indexes = [pos for pos, value in enumerate(windows) if value >= limit] 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 ``` ``` f231([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 232 ```python def f232(values, width, limit): values = list(values) size = width windows = [] for pos in range(len(values) - size + 1): windows.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(windows) if value >= limit] increases = sum((1 for pos in range(1, 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 ``` ``` f232([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 233 ```python def f233(left, right, fee): left = list(left) prices = {} for name0, rate0 in right[:20]: if name0 not in prices: prices[name0] = rate0 items = [] for key, count in left: if key in prices: items.append((key, count * prices[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})} output = dict() output.update(returnvalue) return output ``` ``` f233([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 234 ```python def f234(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if len(edge[1]) < 2): children.setdefault(a, []).append(b) distance = {start: 0} if limit > 0 or limit < 0 else {} work = [start] while work: cur = work.pop(0) if distance[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in distance and (not nxt.startswith('Z')): distance[nxt] = distance[cur] + 1 work.append(nxt) sequence = list(distance) lastlevel = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f234([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 235 ```python def f235(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 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 = max(far, min(20, abs(x) + abs(y))) lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x))) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f235([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 236 ```python def f236(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < min(limit, 3): for nxt in sorted(nextmap.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) sequence = list(distance) lastlevel = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f236([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 237 ```python def f237(rows, keep, ratemap): rows = list(rows) kept = [] totals = {} grand = 0 for code, group, state, value in rows: if state in keep: cost = value * abs(ratemap[group]) kept.append((code, cost)) totals[group] = totals.get(group, 0) + cost grand += cost kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(kept), 'total': grand, 'groups': totals, 'top': [code for code, cost in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f237([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 238 ```python def f238(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count): x += dx y = max(-64, min(64, y + dy)) used += 1 point = (x, y) if point in visited and list(point) not in returns: returns.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f238([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 239 ```python def f239(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} work = [start] while work: cur = work.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 work.append(nxt) result = list(levels) furthest = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f239([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 240 ```python def f240(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 found = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count): x = max(-64, min(64, x + dx)) y += 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 ``` ``` f240([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 241 ```python def f241(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} tokens = [] for line in lines[:20]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens[:64]: if word in stop or len(word) < 2: continue frequency[word] = frequency.get(word, 0) + 1 ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) starts = {} for word, count in frequency.items(): starts[word[0]] = starts.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f241(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 242 ```python def f242(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 ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) starts = {} for word, count in frequency.items(): starts[word[0]] = starts.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f242(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 243 ```python def f243(values, width, limit): values = list(values) size = width series = [] for pos in range(min(64, len(values) - size + 1)): series.append(sum((max(item, 0) for item in values[pos:pos + size]))) matches = [pos for pos, value in enumerate(series) if value >= limit] ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f243([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 244 ```python def f244(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices and rate0 != 0: prices[name0] = rate0 matched = [] for key, count in left: if key in prices and count > 0: matched.append((key, count * prices[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) leftover = sorted((key for key, count in left if key not in prices)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f244([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 245 ```python def f245(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 or len(word) > 12: continue wordmap[word] = wordmap.get(word, 0) + 1 ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in wordmap.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))} output = dict() output.update(returnvalue) return output ``` ``` f245(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 246 ```python def f246(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 ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) starts = {} for word, count in frequency.items(): starts[word[0]] = starts.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f246(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 247 ```python def f247(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] 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 ``` ``` f247([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 248 ```python def f248(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} items = [] for line in lines[:20]: text = line.lower() word = '' for char in text[:64]: if 'a' <= char <= 'z': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop: 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 ``` ``` f248(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 249 ```python def f249(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if len(edge[0]) < 2): children.setdefault(a, []).append(b) distance = {start: 0} work = [start] while work: cur = work.pop(0) if distance[cur] < limit: for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1): if nxt not in distance and (not nxt.startswith('Z')): distance[nxt] = distance[cur] + 1 work.append(nxt) sequence = list(distance) furthest = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f249([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 250 ```python def f250(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) complete = set() sequence = [] rounds = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20) if not nextbatch: break current = nextbatch rounds.append(current) for node in current: complete.add(node) sequence.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f250(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 251 ```python def f251(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right: if name0 not in ratemap: ratemap[name0] = rate0 combined = [] for key, count in left[:20]: if key in ratemap: combined.append((key, count * ratemap[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})} output = dict() output.update(returnvalue) return output ``` ``` f251([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 252 ```python def f252(values, width, limit): values = list(values) size = width totals = [] for pos in range(len(values) - size + 1): totals.append(sum(values[pos:pos + size])) indexes = [pos for pos, value in enumerate(totals) if value >= limit] 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 ``` ``` f252([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 253 ```python def f253(rows, keep, factors): rows = list(rows) kept = [] totals = {} grand = 0 for code, group, state, value in rows: if state in keep: charge = value * factors[group] kept.append((code, charge)) totals[group] = totals.get(group, 0) + charge grand += charge kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in kept)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f253([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 254 ```python def f254(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 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 ``` ``` f254([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 255 ```python def f255(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors: factors[name0] = rate0 items = [] for key, count in left[:20]: if key in factors and count > 0: items.append((key, count * factors[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in factors)) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)} output = dict() output.update(returnvalue) return output ``` ``` f255([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 256 ```python def f256(nodes, edges): nodes = list(nodes) incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) incoming[b] += 1 startdegree = dict(incoming) finished = set() sequence = [] 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), 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]: incoming[nxt] -= 1 returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f256(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 257 ```python def f257(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} if any((start in edge for edge in edges)) else {} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in steps: steps[nxt] = steps[cur] + 1 queue.append(nxt) sequence = list(steps) furthest = sorted((node for node in steps if steps[node] == max(steps.values()))) returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)} output = dict() output.update(returnvalue) return output ``` ``` f257([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 258 ```python def f258(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] needs = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) needs[b] += 1 startdegree = dict(needs) complete = set() sequence = [] layers = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes))) if not nextbatch: break current = nextbatch layers.append(current) for node in current: complete.add(node) sequence.append(node) for node in current: for nxt in children[node]: needs[nxt] -= 1 returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f258(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 259 ```python def f259(lines, stop): lines = list(lines) tallies = {} stop = {word.lower() for word in stop} tokens = [] for line in lines[:32]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop: continue tallies[word] = min(9, 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 ``` ``` f259(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 260 ```python def f260(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = right gaps = [] for pos in range(1, len(combined)): left = combined[pos][0] gaps.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f260([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 261 ```python def f261(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() listing = [] 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) listing.append(node) for node in current: for nxt in routes[node]: indegree[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f261(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 262 ```python def f262(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} tokens = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens[:64]: if word in stop: continue frequency[word] = frequency.get(word, 0) + 1 ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in frequency.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f262(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 263 ```python def f263(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) complete = set() listing = [] layers = [] while len(complete) < len(nodes): available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20) if not available: break current = available layers.append(current) for node in current: complete.add(node) listing.append(node) for node in current: for nxt in nextmap[node]: incoming[nxt] -= 1 returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f263(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 264 ```python def f264(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] incoming = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: a, b = (before, after) children[a].append(b) incoming[b] += 1 startdegree = dict(incoming) complete = set() sequence = [] layers = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete)) if not nextbatch: break current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch layers.append(current) for node in current: complete.add(node) 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 ``` ``` f264(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 265 ```python def f265(rows, keep, ratemap): rows = list(rows) matches = [] totals = {} sumvalue = 0 for code, group, state, value in rows: if state in keep and value != 0: score = value * ratemap[group] matches.append((code, score)) totals[group] = totals.get(group, 0) + score sumvalue += score matches.sort(key=lambda item: (-item[1], str(item[0]).casefold())) returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': totals, 'top': [code for code, score in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f265([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 266 ```python def f266(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < min(limit, 3): for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1): if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) sequence = list(distance) edge = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f266([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 267 ```python def f267(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} items = [] for line in lines[:32]: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z' or (char == "'" and word): word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop: 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 ``` ``` f267(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 268 ```python def f268(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 known = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(min(count, 64)): x = max(-64, min(64, x + dx)) y += dy used += 1 point = (x, y) if point in known and list(point) not in crossings: crossings.append(list(point)) known.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f268([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 269 ```python def f269(rows, keep, prices): rows = list(rows) kept = [] buckets = {} sumvalue = 0 for code, group, state, value in rows: if state in keep and value >= 0: cost = value * prices[group] kept.append((code, cost)) buckets[group] = buckets.get(group, 0) + cost sumvalue += cost kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in kept[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f269([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 270 ```python def f270(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap: ratemap[name0] = rate0 items = [] for key, count in left: if key in ratemap: items.append((key, count * ratemap[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted({key for key, count in left if key not in ratemap}) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)} output = dict() output.update(returnvalue) return output ``` ``` f270([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 271 ```python def f271(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[:64]: if 'a' <= char <= 'z': word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items: if word in stop or len(word) > 12: continue wordmap[word] = wordmap.get(word, 0) + 1 sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in wordmap.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f271(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 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 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, 64)): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in returns: returns.append(list(point)) visited.add(point) far = min(64, max(far, abs(x) + abs(y))) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f272([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 273 ```python def f273(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 known = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count): x += dx y = max(-64, min(64, y + dy)) used += 1 point = (x, y) if point in known and list(point) not in crossings: crossings.append(list(point)) known.add(point) far = max(far, min(20, abs(x) + abs(y))) lowx, highx = (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 ``` ``` f273([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 274 ```python def f274(lines, stop): lines = list(lines) wordmap = {} stop = {word.lower() for word in stop} tokens = [] for line in lines: text = line.lower() word = '' for char in text[:64]: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: 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 ``` ``` f274(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 275 ```python def f275(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors or rate0 <= rate0 + 0: factors[name0] = rate0 matched = [] for key, count in left: if key in factors and count > 0: matched.append((key, count * factors[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) absent = sorted((key for key, count in left if key not in factors)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)} output = dict() output.update(returnvalue) return output ``` ``` f275([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 276 ```python def f276(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[:20]: dx, dy = step[direction] for turn in range(count): x += dx y = max(-64, min(64, y + dy)) used += 1 point = (x, y) if point in found and list(point) not in crossings: crossings.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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f276([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 277 ```python def f277(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count % 100): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = min(64, max(far, abs(x) + abs(y))) lowx, highx = (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 ``` ``` f277([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 278 ```python def f278(values, width, limit): values = list(values) size = width series = [] for pos in range(len(values) - size + 1): series.append(sum((max(item, 0) for item in values[pos:pos + size]))) indexes = [pos for pos, value in enumerate(series) if value >= limit] 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': indexes, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f278([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 279 ```python def f279(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 found = {(0, 0)} repeats = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count): x += dx y += 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 ``` ``` f279([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 280 ```python def f280(rows, keep, ratemap): rows = list(rows) matches = [] totals = {} amount = 0 for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))): if state in keep: cost = value * ratemap[group] matches.append((code, cost)) totals[group] = totals.get(group, 0) + cost amount += cost matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f280([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 281 ```python def f281(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 found = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count % 100): x = max(-64, min(64, x + dx)) y += dy used += 1 point = (x, y) if point in found and list(point) not in crossings: crossings.append(list(point)) found.add(point) far = max(far, 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([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2)]) ``` ``` {"bounds":[-11,0,0,7],"end":[-11,0],"far":11,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":35} ``` ### 282 ```python def f282(nodes, edges): nodes = list(nodes) nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))] indegree = {node: 0 for node in nodes} routes = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) routes[a].append(b) indegree[b] += 1 initial = dict(indegree) handled = set() result = [] 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) 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 initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f282(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 283 ```python def f283(spans, gap): spans = list(spans) result = [] for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)): if not result or left > result[-1][1] + max(0, gap): result.append([left, right]) else: result[-1][1] = max(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 ``` ``` f283([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 284 ```python def f284(values, width, limit): values = list(values) size = width totals = [] for pos in range(len(values) - size + 1): totals.append(sum((max(item, 0) for item in values[pos:pos + size]))) matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)] increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1])) returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f284([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 285 ```python def f285(edges, start, limit): edges = list(edges) children = {} for a, b in edges: children.setdefault(a, []).append(b) steps = {start: 0} if limit > 0 or limit < 0 else {} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in steps and (not nxt.startswith('Z')): steps[nxt] = steps[cur] + 1 queue.append(nxt) sequence = list(steps) edge = sorted((node for node in steps if steps[node] == max(steps.values()))) returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge, 'count': len(steps)} output = dict() output.update(returnvalue) return output ``` ``` f285([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 286 ```python def f286(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) handled = set() listing = [] rounds = [] while len(handled) < len(nodes): nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes))) 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]: needs[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 ``` ``` f286(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 287 ```python def f287(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: continue frequency[word] = min(9, frequency.get(word, 0) + 1) ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in frequency.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f287(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 288 ```python def f288(left, right, fee): left = list(left) factors = {} for name0, rate0 in right: if name0 not in factors or rate0 <= rate0 + 0: factors[name0] = rate0 combined = [] for key, count in left: if key in factors and count > 0: combined.append((key, count * factors[key] + fee)) combined.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in factors}) returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)} output = dict() output.update(returnvalue) return output ``` ``` f288([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 289 ```python def f289(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] < min(limit, 3): for nxt in sorted(nextmap.get(cur, []))[:20]: if nxt not in distance: distance[nxt] = distance[cur] + 1 queue.append(nxt) listing = list(distance) edge = sorted((node for node in distance if distance[node] == max(distance.values()))) returnvalue = {'order': listing, 'depth': distance, 'frontier': edge, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f289([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 290 ```python def f290(edges, start, limit): edges = list(edges) nextmap = {} for a, b in (edge for edge in edges if edge[0] <= edge[1]): nextmap.setdefault(a, []).append(b) distance = {start: 0} work = [start] while work: cur = work.pop(0) if distance[cur] < min(limit, 3): for nxt in sorted(nextmap.get(cur, [])): if nxt not in distance: distance[nxt] = distance[cur] + 1 work.append(nxt) sequence = list(distance) 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 ``` ``` f290([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 291 ```python def f291(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count % 100): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = max(far, abs(x) + abs(y)) lowx, highx = (min(lowx, x), max(highx, x)) lowy, highy = (min(lowy, y), max(highy, y)) returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f291([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 292 ```python def f292(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 ``` ``` f292(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 293 ```python def f293(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} returns = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves: dx, dy = step[direction] for turn in range(count): x += dx y += dy used += 1 point = (x, y) if point in visited and list(point) not in returns: returns.append(list(point)) visited.add(point) far = max(far, 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 ``` ``` f293([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 294 ```python def f294(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, [])): if nxt not in levels and (not nxt.startswith('Z')): levels[nxt] = levels[cur] + 1 queue.append(nxt) sequence = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': sequence, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f294([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 295 ```python def f295(edges, start, limit): edges = list(edges) children = {} for a, b in (edge for edge in edges if len(edge[1]) < 2): children.setdefault(a, []).append(b) levels = {start: 0} work = [start] while work: cur = work.pop(0) if levels[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 work.append(nxt) listing = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': listing, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f295([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]} ``` ### 296 ```python def f296(moves): moves = list(moves) step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} x = 0 y = 0 visited = {(0, 0)} crossings = [] far = 0 lowx = highx = lowy = highy = 0 used = 0 for direction, count in moves[:20]: dx, dy = step[direction] for turn in range(count): x = max(-64, min(64, x + dx)) y = max(-64, min(64, y + dy)) used += 1 point = (x, y) if point in visited and list(point) not in crossings: crossings.append(list(point)) visited.add(point) far = 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 ``` ``` f296([('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3), ('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2)]) ``` ``` {"bounds":[-10,0,0,7],"end":[-10,0],"far":10,"revisits":[[-3,6],[-3,5],[0,3],[0,2],[-4,2]],"steps":34} ``` ### 297 ```python def f297(values, width, limit): values = list(values) size = width series = [] for pos in range(len(values) - size + 1): series.append(sum((max(item, 0) for item in values[pos:pos + size]))) matches = [pos for pos, value in enumerate(series[:64]) if value >= limit] ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': matches, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f297([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 298 ```python def f298(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: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop: continue tallies[word] = tallies.get(word, 0) + 1 ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0])) letters = {} for word, count in tallies.items(): letters[word[0]] = letters.get(word[0], 0) + count returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))} output = dict() output.update(returnvalue) return output ``` ``` f298(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"vivid":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"v":1},"size":143,"top":["blue","frost","garnet","ember","amber"]} ``` ### 299 ```python def f299(rows, keep, prices): rows = list(rows) matches = [] totals = {} amount = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep} and value >= 0: charge = value * prices[group] matches.append((code, charge)) totals[group] = totals.get(group, 0) + charge amount += charge matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': [code for code, charge in matches[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f299([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 300 ```python def f300(rows, keep, ratemap): rows = list(rows) kept = [] buckets = {} sumvalue = 0 for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))): if state in keep: score = value * ratemap[group] kept.append((code, score)) buckets[group] = buckets.get(group, 0) + score sumvalue += score kept.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in kept)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f300([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 301 ```python def f301(left, right, fee): left = list(left) prices = {} for name0, rate0 in right: if name0 not in prices: prices[name0] = rate0 items = [] for key, count in left[:20]: if key in prices and count > 0: items.append((key, count * prices[key] + fee)) items.sort(key=lambda item: (-item[1], item[0])) absent = sorted({key for key, count in left if key not in prices}) returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)} output = dict() output.update(returnvalue) return output ``` ``` f301([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 5) ``` ``` {"count":8,"items":[["AN",95],["CX",85],["GQ",50],["BR",41],["FP",37]],"missing":[],"total":391} ``` ### 302 ```python def f302(rows, keep, prices): rows = list(rows) matches = [] buckets = {} sumvalue = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: cost = value * prices[group] matches.append((code, cost)) buckets[group] = buckets.get(group, 0) + cost sumvalue += cost matches.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]} output = dict() output.update(returnvalue) return output ``` ``` f302([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":3,"groups":{"edge":66,"south":110},"top":["BR54","DL39","CX35"],"total":176} ``` ### 303 ```python def f303(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: if 'a' <= char <= 'z': word += char elif word: tokens.append(word) word = '' if word: tokens.append(word) for word in tokens: if word in stop or len(word) > 12: continue tallies[word] = min(9, tallies.get(word, 0) + 1) 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 ``` ``` f303(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 304 ```python def f304(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[:64]: if 'a' <= char <= 'z' or (char == "'" and word): word += char elif word: terms.append(word) word = '' if word: terms.append(word) for word in terms: if word in stop or len(word) < 2: continue 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 ``` ``` f304(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 305 ```python def f305(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < limit: for nxt in sorted(nextmap.get(cur, []))[: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, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f305([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 306 ```python def f306(left, right, fee): left = list(left) ratemap = {} for name0, rate0 in right[:20]: if name0 not in ratemap: ratemap[name0] = rate0 matched = [] for key, count in left: if key in ratemap: matched.append((key, count * ratemap[key] + fee)) matched.sort(key=lambda item: (-item[1], item[0])) unmatched = sorted((key for key, count in left if key not in ratemap)) returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len({key for key, value in matched})} output = dict() output.update(returnvalue) return output ``` ``` f306([('AN', 10), ('BR', 12), ('CX', 8), ('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5)], [('AN', 9), ('BR', 3), ('CX', 10), ('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4)], 4) ``` ``` {"count":8,"items":[["AN",94],["CX",84],["GQ",49],["BR",40],["FP",36]],"missing":[],"total":383} ``` ### 307 ```python def f307(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not combined or left > combined[-1][1] + min(gap, 2): combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, len(combined)): left = combined[pos][0] gaps.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f307([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 308 ```python def f308(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 ``` ``` f308([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 1, 62) ``` ``` {"best":24,"hits":[],"rises":6,"sums":[16,5,21,5,24,12,23,22,12,4,8,21,10,8,14]} ``` ### 309 ```python def f309(lines, stop): lines = list(lines) tallies = {} stop = {word.lower() for word in stop} items = [] for line in lines: text = line.lower() word = '' for char in text: if 'a' <= char <= 'z' or (char == "'" and word): word += char elif word: items.append(word) word = '' if word: items.append(word) for word in items[:64]: if word in stop: continue tallies[word] = min(9, tallies.get(word, 0) + 1) ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0])) 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 ``` ``` f309(['Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta', 'Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost'], ['delta']) ``` ``` {"counts":{"amber":1,"blue":8,"cyan":1,"ember":3,"frost":8,"garnet":6,"helium":1,"quartz":1},"initials":{"a":1,"b":8,"c":1,"e":3,"f":8,"g":6,"h":1,"q":1},"size":144,"top":["blue","frost","garnet","ember","amber"]} ``` ### 310 ```python def f310(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 initial = dict(needs) complete = set() listing = [] groups = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes))) if not nextbatch: break current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch groups.append(current) for node in current: complete.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 initial[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f310(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 311 ```python def f311(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])): if not combined or left > combined[-1][1] + gap: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) gaps = [] for pos in range(1, min(50, 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': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f311([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 312 ```python def f312(values, width, limit): values = list(values) size = width series = [] for pos in range(len(values) - size + 1): series.append(sum((max(item, 0) for item in values[pos:pos + size]))) indexes = [pos for pos, value in enumerate(series[:64]) 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 ``` ``` f312([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 313 ```python def f313(nodes, edges): nodes = list(nodes) indegree = {node: 0 for node in nodes} children = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) children[a].append(b) indegree[b] += 1 initial = dict(indegree) finished = set() listing = [] layers = [] while len(finished) < len(nodes) and len(finished) < 20: available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes))) if not available: break current = available layers.append(current) for node in current: finished.add(node) listing.append(node) for node in current: for nxt in children[node]: 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 ``` ``` f313(['db', 'proxy', 'jobs', 'auth', 'cache', 'ui', 'worker', 'api'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')]) ``` ``` {"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]} ``` ### 314 ```python def f314(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[:64]) 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': positions, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f314([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 315 ```python def f315(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': max([0] + series), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f315([16, 5, 21, 5, 24, 12, 23, 22, 12, 4, 8, 21, 10, 8, 14], 3, 62) ``` ``` {"best":59,"hits":[],"rises":4,"sums":[42,31,50,41,59,57,57,38,24,33,39,39,32]} ``` ### 316 ```python def f316(spans, gap): spans = list(spans) combined = [] for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])): if not combined or left > combined[-1][1] + gap % 5: combined.append([left, right]) else: combined[-1][1] = max(combined[-1][1], right) spaces = [] for pos in range(1, min(50, len(combined))): left = combined[pos][0] spaces.append(left - combined[pos - 1][1]) returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))} output = dict() output.update(returnvalue) return output ``` ``` f316([(2, 5), (5, 8), (14, 19), (18, 22), (28, 32), (33, 38), (43, 47), (48, 57), (59, 61)], 1) ``` ``` {"cover":40,"holes":[6,6,5,2],"longest":14,"segments":[[2,8],[14,22],[28,38],[43,57],[59,61]]} ``` ### 317 ```python def f317(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 ``` ``` f317([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### 318 ```python def f318(edges, start, limit): edges = list(edges) routes = {} for a, b in edges: routes.setdefault(a, []).append(b) distance = {start: 0} if limit > 0 or limit < 0 else {} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < limit: for nxt in (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) 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 ``` ``` f318([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G')], 'A', 3) ``` ``` {"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]} ``` ### 319 ```python def f319(rows, keep, prices): rows = list(rows) selected = [] totals = {} amount = 0 for code, group, state, value in rows: if str(state).lower() in {str(item).lower() for item in keep}: cost = value * abs(prices[group]) selected.append((code, cost)) totals[group] = totals.get(group, 0) + cost amount += cost selected.sort(key=lambda item: (-item[1], item[0])) returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]} output = dict() output.update(returnvalue) return output ``` ``` f319([('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17), ('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5)], ['ready'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3}) ``` ``` {"accepted":5,"groups":{"core":539,"north":63,"south":110},"top":["AN13","BR91","BR50"],"total":712} ``` ### 320 ```python def f320(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 ``` ``` f320([(2, 5), (5, 8), (14, 22), (18, 22), (28, 32), (33, 38), (43, 47), (48, 55), (59, 61)], 1) ``` ``` {"cover":38,"holes":[6,6,5,4],"longest":12,"segments":[[2,8],[14,22],[28,38],[43,55],[59,61]]} ``` ### Final Query Give me the output of the final query without executing it! ```python import json, re from collections import deque out = {} spans = list(((2, 5), (5, 8), (14, 22), (18, 22), (28, 32)) + ((33, 38), (43, 47), (48, 55), (59, 61))) gap = 1 spans.sort(key=lambda pair: (pair[0], pair[1])) parts = [] pos = 0 while pos < len(spans): left, right = spans[pos] pos += 1 while pos < len(spans) and spans[pos][0] <= right + gap: right = max(right, spans[pos][1]) pos += 1 parts.append([left, right]) holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))] record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))} signal = record['cc'] route = signal cases = { 38: list((('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3)) + (('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 1), ('E', 1), ('W', 4), ('W', 2))), 40: list((('N', 3), ('W', 3), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('S', 3)) + (('W', 3), ('W', 1), ('N', 1), ('S', 3), ('W', 4), ('E', 1), ('W', 2), ('W', 2))), } moves = cases[route] delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)} points = [[0, 0]] for direction, count in moves: dx, dy = delta[direction] for turn in range(count): points.append([points[-1][0] + dx, points[-1][1] + dy]) seen = set() revisits = [] for point in points: key = tuple(point) if key in seen and point not in revisits: revisits.append(point) seen.add(key) record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1} token = record['bb'] start = 'A' limit = 3 route = signal cases = { 40: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'G'))), 38: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('B', 'D'))), } edges = cases[route] links = {} for edge in edges: links.setdefault(edge[0], []).append(edge[1]) distance = {start: 0} queue = deque([start]) while queue: node = queue.popleft() if distance[node] == limit: continue for child in sorted(links.get(node, [])): if child in distance: continue distance[child] = distance[node] + 1 queue.append(child) furthest = max(distance.values()) record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)} memo = record['aa'][3] values = list((16, 5, 21, 5, 24, 12, 23, 22) + (12, 4, 8, 21, 10, 8, 14)) limit = 62 options = { 38: ('near', token), 40: ('far', memo), } route = options[signal] cases = { ('near', 10): 3, ('near', 11): 1, ('far', 'D'): 1, ('far', 'G'): 1, } 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} clue = record['bb'] rows = list((('BR54', 'south', 'checked', 22), ('BR91', 'core', 'ready', 13), ('AN28', 'north', 'ready', 9), ('CX65', 'south', 'ready', 22), ('CX02', 'core', 'void', 20), ('DL39', 'edge', 'checked', 17), ('CX76', 'edge', 'void', 17)) + (('AN13', 'core', 'ready', 24), ('BR50', 'core', 'ready', 12), ('BR87', 'edge', 'hold', 13), ('DL24', 'core', 'void', 6), ('AN61', 'south', 'hold', 18), ('CX98', 'core', 'hold', 23), ('CX35', 'edge', 'checked', 5))) rates = dict((('north', 7), ('south', 5)) + (('core', 11), ('edge', 3))) route = memo cases = { 'G': ['checked'], 'D': ['ready'], } keep = cases[route] chosen = [(code, group, value) for code, group, state, value in rows if state in keep] priced = [(code, group, value * rates[group]) for code, group, value in chosen] groups = {} for code, group, price in priced: groups[group] = groups.get(group, 0) + price ranked = sorted(priced, key=lambda row: (-row[2], row[0])) record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups} stamp = record['bb'] left = list((('AN', 10), ('BR', 12), ('CX', 8)) + (('DL', 3), ('EV', 7), ('FP', 4), ('GQ', 9), ('HR', 5))) right = list((('AN', 9), ('BR', 3), ('CX', 10)) + (('DL', 9), ('EV', 3), ('FP', 8), ('GQ', 5), ('HR', 4))) route = (clue, stamp) cases = { (59, 712): 4, (59, 176): 5, (24, 712): 5, (24, 176): 5, } fee = cases[route] joined = [] for key, count in left: matches = [rate for name, rate in right if name == key] if matches: joined.append([key, count * matches[0] + fee]) joined.sort(key=lambda item: (-item[1], item[0])) rightkeys = {key for key, rate in right} record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)} ticket = record['bb'] nodes = list(('db', 'proxy', 'jobs', 'auth', 'cache') + ('ui', 'worker', 'api')) route = ticket cases = { 391: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth'))), 383: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache'))), } 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)} badge = record['aa'][0] stop = ['delta'] route = badge cases = { 'auth': list(('Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta vivid') + ('Blue, blue. garnet frost garnet', 'Frost, ember. ember delta', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost')), 'cache': list(('Blue, amber. garnet blue', 'Ember, frost. frost helium delta', 'Blue, blue. garnet delta') + ('Blue, blue. garnet frost garnet', 'Frost, ember. ember delta quartz', 'Garnet, frost. frost frost blue', 'Garnet, blue. cyan frost')), } lines = cases[route] normalized = set() for item in stop: normalized.add(item.lower()) stop = normalized words = [] for line in lines: words.extend(re.findall('[a-z]+', line.lower())) words = [word for word in words if word not in stop] counts = {} initials = {} for word in words: counts[word] = counts.get(word, 0) + 1 initials[word[0]] = initials.get(word[0], 0) + 1 top = sorted(counts, key=lambda word: (-counts[word], word))[:5] record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))} out['aa'] = record['aa'] out['bb'] = record['bb'] out['cc'] = record['cc'] out['dd'] = record['dd'] print(json.dumps(out, separators=(",", ":"), sort_keys=True)) ```