001
def f1(board):
board = list(board)
known = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in known:
continue
cells = []
queue = [(row, col)]
known.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
if len(known) >= 100:
continue
queue.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f1(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
002
def f2(board):
board = list(board)
found = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in found:
continue
cells = []
work = [(row, col)]
found.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
if len(found) >= 100:
continue
work.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f2(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
003
def f3(board):
board = list(board)
found = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in found:
continue
cells = []
queue = [(row, col)]
found.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f3(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
004
def f4(board):
board = list(board)
visited = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
work = [(row, col)]
visited.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
work.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f4(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
005
def f5(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
initial = dict(incoming)
finished = set()
listing = []
layers = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f5(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
006
def f6(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]
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': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f6([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
007
def f7(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]
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
f7([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
008
def f8(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
indegree[b] += 1
initial = dict(indegree)
handled = set()
sequence = []
rounds = []
while len(handled) < len(nodes):
available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=len(nodes) > 20)
if not available:
break
current = available
rounds.append(current)
for node in current:
handled.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f8(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
009
def f9(rows, keep, factors):
rows = list(rows)
kept = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
charge = value * abs(factors[group])
kept.append((code, charge))
buckets[group] = buckets.get(group, 0) + charge
amount += charge
kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': amount, 'groups': buckets, 'top': [code for code, charge in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f9([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
010
def f10(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
combined = []
for key, count in left:
if key in prices:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
output = dict()
output.update(returnvalue)
return output
f10([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
011
def f11(board):
board = list(board)
known = set()
regions = []
for row in range(len(board)):
for col in range(len(board[0])):
if col >= 12 or board[row][col] != '#' or (row, col) in known:
continue
cells = []
work = [(row, col)]
known.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
if len(known) >= 100:
continue
work.append(nxt)
regions.append((len(cells), min(cells)))
regions.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
output = dict()
output.update(returnvalue)
return output
f11(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
012
def f12(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 and count > 0:
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
f12([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
013
def f13(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
combined = []
for key, count in left:
if key in ratemap:
combined.append((key, count * ratemap[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
output = dict()
output.update(returnvalue)
return output
f13([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
014
def f14(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:
items.append((key, count * factors[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted({key for key, count in left if key not in factors})
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len({key for key, value in items})}
output = dict()
output.update(returnvalue)
return output
f14([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
015
def f15(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not segments or left > segments[-1][1] + gap:
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((min(100, right - left) for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f15([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
016
def f16(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 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', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
017
def f17(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f17(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
018
def f18(rows, keep, prices):
rows = list(rows)
kept = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * prices[group]
kept.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
output = dict()
output.update(returnvalue)
return output
f18([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
019
def f19(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + gap + 1:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
spaces = []
for pos in range(1, min(50, len(segments))):
left = segments[pos][0]
spaces.append(min(100, left - segments[pos - 1][1]))
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f19([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
020
def f20(rows, keep, prices):
rows = list(rows)
matches = []
groupmap = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep:
charge = value * abs(prices[group])
matches.append((code, charge))
groupmap[group] = groupmap.get(group, 0) + charge
amount += charge
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f20([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
021
def f21(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(items)}
output = dict()
output.update(returnvalue)
return output
f21([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
022
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[: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
f22([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
023
def f23(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':
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
f23(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
024
def f24(rows, keep, ratemap):
rows = list(rows)
selected = []
groupmap = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * ratemap[group]
selected.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
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
f24([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
025
def f25(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = max(0, combined[-1][1], right)
spaces = []
for pos in range(1, len(combined)):
left = combined[pos][0]
spaces.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f25([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
026
def f26(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
items = []
for key, count in left[:20]:
if key in prices:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
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
f26([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
027
def f27(rows, keep, prices):
rows = list(rows)
selected = []
buckets = {}
sumvalue = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * prices[group]
selected.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
sumvalue += cost
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f27([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
028
def f28(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop or len(word) > 12:
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': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f28(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
029
def f29(left, right, banned):
left = list(left)
def normalize(value):
return str(value).strip(' \r').upper()[:12]
banned = {normalize(value) for value in banned}
a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - banned
b = {normalize(value) for value in right} - banned
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f29(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
030
def f30(left, right, banned):
left = list(left)
def canon(value):
return ' '.join(str(value).split()).upper()[:12]
banned = {canon(value) for value in banned}
a = {canon(value) for value in left} - banned
b = {canon(value) for value in right if canon(value) != ''} - banned
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f30(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
031
def f31(rows, keep, factors):
rows = list(rows)
kept = []
totals = {}
sumvalue = 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
sumvalue += charge
kept.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in kept)))[:3]}
output = dict()
output.update(returnvalue)
return output
f31([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
032
def f32(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f32(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
033
def f33(lines, stop):
lines = list(lines)
wordmap = {}
stop = {str(word) for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
starts = {}
for word, count in wordmap.items():
starts[word[0]] = starts.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f33(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
034
def f34(board):
board = list(board)
visited = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
pending.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f34(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
035
def f35(left, right, ignored):
left = list(left)
def normalize(value):
return ' '.join(str(value).split()).upper()
ignored = {str(value).upper() for value in ignored}
a = {normalize(value) for value in left} - ignored
b = {normalize(value) for value in right} - ignored
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f35(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
036
def f36(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
combined = []
for key, count in left:
if key in ratemap:
combined.append((key, count * ratemap[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f36([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
037
def f37(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
matches = [pos for pos, value in enumerate(windows) if value >= limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f37([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
038
def f38(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]))
positions = [pos for pos, value in enumerate(series[:64]) if value >= limit]
increases = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f38([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
039
def f39(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors:
factors[name0] = rate0
items = []
for key, count in left:
if key in factors:
items.append((key, count * factors[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
output = dict()
output.update(returnvalue)
return output
f39([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
040
def f40(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
f40([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
041
def f41(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
startdegree = dict(incoming)
complete = set()
sequence = []
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)
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
f41(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
042
def f42(rows, keep, prices):
rows = list(rows)
matches = []
buckets = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep and value != 0:
cost = value * prices[group]
matches.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
sumvalue += cost
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f42([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
043
def f43(board):
board = list(board)
known = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[0])):
if col >= 12 or board[row][col] != '#' or (row, col) in known:
continue
cells = []
queue = [(row, col)]
known.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f43(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
044
def f44(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)
finished = set()
sequence = []
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=any((str(node).isupper() for node in nodes)))
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 nextmap[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f44(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
045
def f45(rows, keep, prices):
rows = list(rows)
selected = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * prices[group]
selected.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], 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
f45([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
046
def f46(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
indexes = [pos for pos, value in enumerate(windows) if value >= limit]
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
f46([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
047
def f47(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
indegree[b] += 1
startdegree = dict(indegree)
handled = set()
sequence = []
rounds = []
while len(handled) < len(nodes):
nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
if not nextbatch:
break
current = nextbatch
rounds.append(current)
for node in current:
handled.add(node)
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
f47(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
048
def f48(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[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f48(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
049
def f49(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
needs[b] += 1
initial = dict(needs)
handled = set()
listing = []
rounds = []
while len(handled) < len(nodes) and len(handled) < 20:
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
rounds.append(current)
for node in current:
handled.add(node)
listing.append(node)
for node in current:
for nxt in routes[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
f49(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
050
def f50(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(set(spans)):
if not result or left > result[-1][1] + gap % 5:
result.append([left, right])
else:
result[-1][1] = max(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
f50([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
051
def f51(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
items = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f51(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
052
def f52(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]))
positions = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f52([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
053
def f53(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(series) if value >= limit]
increases = sum((1 for pos in range(1, min(65, 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
f53([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
054
def f54(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]
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
f54([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
055
def f55(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
combined = []
for key, count in left[:20]:
if key in prices:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f55([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
056
def f56(board):
board = list(board)
found = set()
regions = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in found:
continue
cells = []
work = [(row, col)]
found.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
work.append(nxt)
regions.append((len(cells), min(cells)))
regions.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
output = dict()
output.update(returnvalue)
return output
f56(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
057
def f57(board):
board = list(board)
visited = set()
pieces = []
for row in range(len(board)):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
pending.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f57(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
058
def f58(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
indegree = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
routes[a].append(b)
indegree[b] += 1
rootsource = dict(indegree)
finished = set()
result = []
layers = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in routes[node]:
indegree[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f58(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
059
def f59(left, right, banned):
left = list(left)
def canon(value):
return str(value).strip(' ').upper()
banned = {str(value).strip() for value in banned}
a = {canon(value) for value in left} - banned
b = {canon(value) for value in right} - banned
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f59(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
060
def f60(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
needs = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
routes[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), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available[:1] if any((str(node).isupper() for node in nodes)) else available
rounds.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in routes[node]:
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
f60(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
061
def f61(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
rootsource = dict(indegree)
finished = set()
sequence = []
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)
sequence.append(node)
for node in current:
for nxt in nextmap[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f61(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
062
def f62(lines, stop):
lines = list(lines)
tallies = {}
stop = {str(word) for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
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': min(256, sum((len(word) * count for word, count in tallies.items())))}
output = dict()
output.update(returnvalue)
return output
f62(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
063
def f63(board):
board = list(board)
found = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in found:
continue
cells = []
queue = [(row, col)]
found.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
if len(found) >= 100:
continue
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f63(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
064
def f64(board):
board = list(board)
found = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in found:
continue
cells = []
work = [(row, col)]
found.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
if len(found) >= 100:
continue
work.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f64(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
065
def f65(rows, keep, prices):
rows = list(rows)
kept = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
score = value * prices[group]
kept.append((code, score))
totals[group] = totals.get(group, 0) + score
amount += score
kept.sort(key=lambda item: (-item[1], 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
f65([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
066
def f66(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
f66([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
067
def f67(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + gap + 1:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
spaces = []
for pos in range(1, len(segments)):
left = segments[pos][0]
spaces.append(min(100, left - segments[pos - 1][1]))
returnvalue = {'segments': segments, 'cover': sum((min(100, right - left) for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f67([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
068
def f68(left, right, excluded):
left = list(left)
def normalize(value):
return ' '.join(str(value).split()).upper()
excluded = {normalize(value) for value in excluded}
a = {normalize(value) for value in left} - excluded
b = {normalize(value) for value in right} - excluded
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f68(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
069
def f69(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors:
factors[name0] = rate0
combined = []
for key, count in left:
if key in factors 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({key for key, value in combined})}
output = dict()
output.update(returnvalue)
return output
f69([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
070
def f70(rows, keep, prices):
rows = list(rows)
matches = []
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:
cost = value * prices[group]
matches.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
sumvalue += cost
matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f70([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
071
def f71(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop or len(word) < 2:
continue
tallies[word] = tallies.get(word, 0) + 1
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f71(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
072
def f72(values, width, limit):
values = list(values)
size = width if width > 1 or width < 1 else 2
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max([0] + series), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f72([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
073
def f73(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not result or left > result[-1][1] + max(0, gap):
result.append([left, right])
else:
result[-1][1] = max(0, result[-1][1], right)
gaps = []
for pos in range(1, len(result)):
left = result[pos][0]
gaps.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f73([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
074
def f74(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
incoming[b] += 1
startdegree = dict(incoming)
handled = set()
listing = []
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)
listing.append(node)
for node in current:
for nxt in routes[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f74(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
075
def f75(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
rootsource = dict(needs)
handled = set()
sequence = []
layers = []
while len(handled) < len(nodes):
available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
if not available:
break
current = available
layers.append(current)
for node in current:
handled.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
f75(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
076
def f76(board):
board = list(board)
visited = set()
pieces = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
queue.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f76(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
077
def f77(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(series[:64]) if value >= limit]
increases = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f77([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
078
def f78(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] + max(0, gap):
combined.append([left, right])
else:
combined[-1][1] = right
breaks = []
for pos in range(1, len(combined)):
left = combined[pos][0]
breaks.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f78([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
079
def f79(left, right, ignored):
left = list(left)
def normalize(value):
return str(value).strip(' \n').upper()
ignored = {str(value).upper() for value in ignored}
a = {normalize(value) for value in left} - ignored
b = {normalize(value) for value in right} - ignored
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f79(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
080
def f80(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap % 5:
combined.append([left, right])
else:
combined[-1][1] = max(0, combined[-1][1], right)
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
f80([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
081
def f81(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
output = dict()
output.update(returnvalue)
return output
f81(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
082
def f82(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
f82([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
083
def f83(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)
finished = set()
result = []
layers = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f83(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
084
def f84(rows, keep, prices):
rows = list(rows)
kept = []
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:
cost = value * prices[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(dict.fromkeys(kept)), 'total': grand, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f84([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
085
def f85(left, right, excluded):
left = list(left)
def tidy(value):
return str(value).strip(' \r').upper()[:12]
excluded = {tidy(value) for value in excluded}
a = {tidy(value) for value in left} - excluded
b = {tidy(value) for value in right if tidy(value) != ''} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f85(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
086
def f86(board):
board = list(board)
visited = set()
pieces = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
pending.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f86(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
087
def f87(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices or rate0 <= rate0 + 0:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices:
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
f87([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
088
def f88(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[:20]:
if key in factors and count > 0:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f88([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
089
def f89(left, right, excluded):
left = list(left)
def normalize(value):
return ' '.join(str(value).split()).upper()[:12]
excluded = {str(value).strip() for value in excluded}
a = {normalize(value) for value in left} - excluded
b = {normalize(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f89(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
090
def f90(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
indegree[b] += 1
initial = dict(indegree)
finished = set()
listing = []
layers = []
while len(finished) < len(nodes):
available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available
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 initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f90(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
091
def f91(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
items = []
for key, count in left[:20]:
if key in prices:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f91([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
092
def f92(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
combined = []
for key, count in left:
if key in prices and count > 0:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
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
f92([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
093
def f93(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' or (char == "'" and word):
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop or len(word) > 12:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
output = dict()
output.update(returnvalue)
return output
f93(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
094
def f94(rows, keep, ratemap):
rows = list(rows)
selected = []
totals = {}
amount = 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
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
f94([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
095
def f95(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()
result = []
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), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available[:1] if any((str(node).isupper() for node in nodes)) else available
groups.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in routes[node]:
needs[nxt] -= 1
returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f95(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
096
def f96(rows, keep, prices):
rows = list(rows)
kept = []
totals = {}
grand = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
charge = value * prices[group]
kept.append((code, charge))
totals[group] = totals.get(group, 0) + charge
grand += charge
kept.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(kept), 'total': grand, 'groups': totals, 'top': [code for code, charge in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f96([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
097
def f97(rows, keep, factors):
rows = list(rows)
matches = []
totals = {}
grand = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * abs(factors[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
f97([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
098
def f98(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + gap % 5:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
breaks = []
for pos in range(1, len(segments)):
left = segments[pos][0]
breaks.append(min(100, left - segments[pos - 1][1]))
returnvalue = {'segments': segments, 'cover': sum((min(100, right - left) for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f98([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
099
def f99(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(series) if value >= limit]
growth = sum((1 for pos in range(1, 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
f99([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
100
def f100(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop or len(word) < 2:
continue
tallies[word] = tallies.get(word, 0) + 1
sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f100(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
101
def f101(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
initial = dict(incoming)
finished = set()
sequence = []
layers = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
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
f101(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
102
def f102(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in frequency.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f102(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
103
def f103(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f103(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
104
def f104(left, right, ignored):
left = list(left)
def tidy(value):
return str(value).strip().upper()
ignored = {str(value).strip() for value in ignored}
a = {tidy(value) for value in left} - ignored
b = {tidy(value) for value in right} - ignored
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f104(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
105
def f105(rows, keep, prices):
rows = list(rows)
selected = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
score = value * prices[group]
selected.append((code, score))
buckets[group] = buckets.get(group, 0) + score
amount += score
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f105([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
106
def f106(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)
breaks = []
for pos in range(1, len(combined)):
left = combined[pos][0]
breaks.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': min(100, max((right - left for left, right in combined)))}
output = dict()
output.update(returnvalue)
return output
f106([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
107
def f107(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
nextmap[a].append(b)
incoming[b] += 1
initial = dict(incoming)
finished = set()
sequence = []
groups = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in nextmap[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f107(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
108
def f108(left, right, banned):
left = list(left)
def normalize(value):
return str(value).strip().upper()
banned = {normalize(value) for value in banned}
a = {normalize(value) for value in left} - banned
b = {normalize(value) for value in right} - banned
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f108(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
109
def f109(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap % 5:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f109([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
110
def f110(rows, keep, prices):
rows = list(rows)
kept = []
buckets = {}
grand = 0
for code, group, state, value in rows:
if state in keep:
score = value * prices[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(dict.fromkeys(kept)), 'total': grand, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in kept)))[:3]}
output = dict()
output.update(returnvalue)
return output
f110([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
111
def f111(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
rootsource = dict(incoming)
finished = set()
listing = []
groups = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in nextmap[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f111(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
112
def f112(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap and rate0 != 0:
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]))
unmatched = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f112([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
113
def f113(left, right, banned):
left = list(left)
def tidy(value):
return ' '.join(str(value).split()).upper()
banned = {tidy(value) for value in banned}
a = {tidy(value) for value in left} - banned
b = {tidy(value) for value in right if tidy(value) != ''} - banned
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f113(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
114
def f114(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(set(spans)):
if not result or left > result[-1][1] + gap:
result.append([left, right])
else:
result[-1][1] = 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
f114([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
115
def f115(board):
board = list(board)
visited = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(min(len(board[row]), 10)):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
pending.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f115(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
116
def f116(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 = []
groups = []
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
groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f116(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
117
def f117(left, right, excluded):
left = list(left)
def canon(value):
return str(value).strip(' \r').upper()
excluded = {str(value).strip() for value in excluded}
a = {canon(value) for value in left} - excluded
b = {canon(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f117(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
118
def f118(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
f118([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
119
def f119(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(set(spans)):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
gaps = []
for pos in range(1, 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': min(100, max((right - left for left, right in combined)))}
output = dict()
output.update(returnvalue)
return output
f119([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
120
def f120(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + gap % 5:
result.append([left, right])
else:
result[-1][1] = max(0, result[-1][1], right)
breaks = []
for pos in range(1, len(result)):
left = result[pos][0]
breaks.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f120([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
121
def f121(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
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
f121([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
122
def f122(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])))
positions = [pos for pos, value in enumerate(series) if value >= limit]
increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max([0] + series), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f122([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
123
def f123(rows, keep, prices):
rows = list(rows)
selected = []
totals = {}
grand = 0
for code, group, state, value in rows:
if state in keep and value != 0:
score = value * prices[group]
selected.append((code, score))
totals[group] = totals.get(group, 0) + score
grand += score
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': totals, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f123([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
124
def f124(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(min(64, len(values) - size + 1)):
totals.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f124([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
125
def f125(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]
ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': positions, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f125([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
126
def f126(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]))
unmatched = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
output = dict()
output.update(returnvalue)
return output
f126([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
127
def f127(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
f127([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
128
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))]
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)
finished = set()
listing = []
layers = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
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 initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f128(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
129
def f129(left, right, ignored):
left = list(left)
def canon(value):
return str(value).strip().upper()
ignored = {str(value).upper() for value in ignored}
a = {canon(value) for value in left} - ignored
b = {canon(value) for value in right} - ignored
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f129(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
130
def f130(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]))
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
f130([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
131
def f131(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:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in tallies.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f131(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
132
def f132(lines, stop):
lines = list(lines)
wordmap = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f132(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
133
def f133(board):
board = list(board)
found = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in found:
continue
cells = []
queue = [(row, col)]
found.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
queue.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f133(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
134
def f134(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' or (char == "'" and word):
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop or len(word) < 2:
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
f134(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
135
def f135(board):
board = list(board)
visited = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
pending.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f135(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
136
def f136(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
initial = dict(incoming)
finished = set()
listing = []
groups = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f136(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
137
def f137(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
starts = {}
for word, count in frequency.items():
starts[word[0]] = starts.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f137(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
138
def f138(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
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
f138([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
139
def f139(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 and count > 0:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f139([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
140
def f140(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices or rate0 <= rate0 + 0:
prices[name0] = rate0
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
f140([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
141
def f141(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(items)}
output = dict()
output.update(returnvalue)
return output
f141([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
142
def f142(board):
board = list(board)
visited = set()
pieces = []
for row in range(len(board)):
for col in range(len(board[0])):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
queue.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f142(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
143
def f143(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f143(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
144
def f144(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
nextmap[a].append(b)
incoming[b] += 1
initial = dict(incoming)
handled = set()
listing = []
rounds = []
while len(handled) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
if not nextbatch:
break
current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
rounds.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': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f144(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
145
def f145(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
matches = [pos for pos, value in enumerate(windows) if value >= limit]
ups = sum((1 for pos in range(1, min(65, 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
f145([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
146
def f146(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], 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
f146([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
147
def f147(rows, keep, prices):
rows = list(rows)
selected = []
buckets = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep:
score = value * abs(prices[group])
selected.append((code, score))
buckets[group] = buckets.get(group, 0) + score
sumvalue += score
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f147([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
148
def f148(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] = 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
f148([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
149
def f149(lines, stop):
lines = list(lines)
wordmap = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
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
f149(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
150
def f150(left, right, excluded):
left = list(left)
def tidy(value):
return str(value).strip(' \n').upper()
excluded = {tidy(value) for value in excluded}
a = {tidy(value) for value in left} - excluded
b = {tidy(value) for value in right} - excluded
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f150(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
151
def f151(left, right, banned):
left = list(left)
def canon(value):
return str(value).strip(' ').upper()
banned = {str(value).strip() for value in banned}
a = {canon(value) for value in left} - banned
b = {canon(value) for value in right} - banned
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f151(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
152
def f152(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 = []
layers = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in routes[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f152(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
153
def f153(left, right, ignored):
left = list(left)
def tidy(value):
return str(value).strip().upper()
ignored = {tidy(value) for value in ignored}
a = {tidy(value) for value in left} - ignored
b = {tidy(value) for value in right} - ignored
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f153(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
154
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]))
matches = [pos for pos, value in enumerate(totals) if value >= limit]
ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f154([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
155
def f155(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(set(spans)):
if not result or left > result[-1][1] + gap % 5:
result.append([left, right])
else:
result[-1][1] = max(0, result[-1][1], right)
gaps = []
for pos in range(1, len(result)):
left = result[pos][0]
gaps.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f155([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
156
def f156(left, right, excluded):
left = list(left)
def canon(value):
return ' '.join(str(value).split()).upper()
excluded = {str(value).strip() for value in excluded}
a = {canon(value) for value in left} - excluded
b = {canon(value) for value in right} - excluded
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f156(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
157
def f157(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f157(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
158
def f158(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)
spaces = []
for pos in range(1, min(50, len(combined))):
left = combined[pos][0]
spaces.append(min(100, left - combined[pos - 1][1]))
returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f158([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
159
def f159(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
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
f159(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
160
def f160(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + gap:
result.append([left, right])
else:
result[-1][1] = max(0, 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((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
f160([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
161
def f161(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors or rate0 <= rate0 + 0:
factors[name0] = rate0
matched = []
for key, count in left:
if key in factors:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f161([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
162
def f162(left, right, ignored):
left = list(left)
def tidy(value):
return str(value).strip(' \n').upper()
ignored = {str(value).strip() for value in ignored}
a = {tidy(value) for value in left if tidy(value) != tidy(value) or tidy(value) != ''} - ignored
b = {tidy(value) for value in right} - ignored
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f162(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
163
def f163(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
pending.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f163(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
164
def f164(values, width, limit):
values = list(values)
size = width if width > 1 or width < 1 else 2
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([0] + windows), 'hits': matches, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f164([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
165
def f165(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)
complete = set()
sequence = []
layers = []
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[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
layers.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f165(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
166
def f166(values, width, limit):
values = list(values)
size = width if width > 1 or width < 1 else 2
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
indexes = [pos for pos, value in enumerate(totals) if value >= limit]
ups = sum((1 for pos in range(1, min(65, 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
f166([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
167
def f167(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
terms = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
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
f167(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
168
def f168(rows, keep, prices):
rows = list(rows)
matches = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * abs(prices[group])
matches.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f168([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
169
def f169(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f169(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
170
def f170(board):
board = list(board)
found = set()
regions = []
for row in range(len(board)):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in found:
continue
cells = []
work = [(row, col)]
found.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
if len(found) >= 100:
continue
work.append(nxt)
regions.append((len(cells), min(cells)))
regions.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
output = dict()
output.update(returnvalue)
return output
f170(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
171
def f171(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop or len(word) < 2:
continue
tallies[word] = tallies.get(word, 0) + 1
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f171(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
172
def f172(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[: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
sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
starts = {}
for word, count in frequency.items():
starts[word[0]] = starts.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f172(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
173
def f173(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f173(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
174
def f174(left, right, excluded):
left = list(left)
def tidy(value):
return str(value).strip(' ').upper()[:12]
excluded = {tidy(value) for value in excluded}
a = {tidy(value) for value in left} - excluded
b = {tidy(value) for value in right} - excluded
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f174(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
175
def f175(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
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
f175(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
176
def f176(lines, stop):
lines = list(lines)
wordmap = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f176(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
177
def f177(rows, keep, ratemap):
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:
score = value * ratemap[group]
matches.append((code, score))
totals[group] = totals.get(group, 0) + score
amount += score
matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, score in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f177([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
178
def f178(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f178(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
179
def f179(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(min(64, len(values) - size + 1)):
series.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
growth = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f179([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
180
def f180(left, right, ignored):
left = list(left)
def tidy(value):
return str(value).strip(' ').upper()
ignored = {tidy(value) for value in ignored}
a = {tidy(value) for value in left} - ignored
b = {tidy(value) for value in right} - ignored
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f180(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
181
def f181(board):
board = list(board)
known = set()
regions = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in known:
continue
cells = []
queue = [(row, col)]
known.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
if len(known) >= 100:
continue
queue.append(nxt)
regions.append((len(cells), min(cells)))
regions.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)}
output = dict()
output.update(returnvalue)
return output
f181(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
182
def f182(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
nextmap[a].append(b)
incoming[b] += 1
rootsource = dict(incoming)
finished = set()
sequence = []
rounds = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
rounds.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in nextmap[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f182(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
183
def f183(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
startdegree = 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 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
f183(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
184
def f184(left, right, ignored):
left = list(left)
def normalize(value):
return str(value).strip().upper()[:12]
ignored = {str(value).upper() for value in ignored}
a = {normalize(value) for value in left} - ignored
b = {normalize(value) for value in right} - ignored
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f184(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
185
def f185(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
pending = [(row, col)]
visited.add((row, col))
while pending:
cur = pending.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
pending.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f185(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
186
def f186(left, right, excluded):
left = list(left)
def normalize(value):
return str(value).strip(' \r').upper()
excluded = {normalize(value) for value in excluded}
a = {normalize(value) for value in left} - excluded
b = {normalize(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f186(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
187
def f187(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices or rate0 <= rate0 + 0:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices and count > 0:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted({key for key, count in left if key not in prices})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f187([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
188
def f188(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
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
f188([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
189
def f189(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(series) if value >= limit]
increases = sum((1 for pos in range(1, 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
f189([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
190
def f190(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)
gaps = []
for pos in range(1, len(result)):
left = result[pos][0]
gaps.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in result)))}
output = dict()
output.update(returnvalue)
return output
f190([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
191
def f191(left, right, banned):
left = list(left)
def canon(value):
return str(value).strip().upper()
banned = {canon(value) for value in banned}
a = {canon(value) for value in left} - banned
b = {canon(value) for value in right} - banned
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f191(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
192
def f192(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors or rate0 <= rate0 + 0:
factors[name0] = rate0
items = []
for key, count in left[:20]:
if key in factors:
items.append((key, count * factors[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f192([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
193
def f193(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)
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
f193([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
194
def f194(left, right, banned):
left = list(left)
def normalize(value):
return str(value).strip(' \r').upper()
banned = {normalize(value) for value in banned}
a = {normalize(value) for value in left} - banned
b = {normalize(value) for value in right} - banned
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f194(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
195
def f195(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in frequency.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f195(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
196
def f196(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors:
factors[name0] = rate0
combined = []
for key, count in left:
if key in factors:
combined.append((key, count * factors[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f196([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
197
def f197(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
nextmap[a].append(b)
indegree[b] += 1
initial = dict(indegree)
finished = set()
result = []
groups = []
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
groups.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in nextmap[node]:
indegree[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
f197(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
198
def f198(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
matched = []
for key, count in left[:20]:
if key in ratemap:
matched.append((key, count * ratemap[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted((key for key, count in left if key not in ratemap))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f198([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
199
def f199(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[:64]) 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': positions, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f199([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
200
def f200(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
needs[b] += 1
startdegree = dict(needs)
finished = set()
sequence = []
layers = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
layers.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f200(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
201
def f201(rows, keep, ratemap):
rows = list(rows)
selected = []
groupmap = {}
amount = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
charge = value * abs(ratemap[group])
selected.append((code, charge))
groupmap[group] = groupmap.get(group, 0) + charge
amount += charge
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f201([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
202
def f202(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[:64]) if value >= limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f202([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
203
def f203(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)
complete = set()
result = []
layers = []
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[:1] if any((str(node).isupper() for node in nodes)) else available
layers.append(current)
for node in current:
complete.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f203(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
204
def f204(left, right, banned):
left = list(left)
def tidy(value):
return str(value).strip(' ').upper()
banned = {str(value).upper() for value in banned}
a = {tidy(value) for value in left} - banned
b = {tidy(value) for value in right} - banned
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f204(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
205
def f205(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(min(64, len(values) - size + 1)):
totals.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(totals) if value >= limit]
growth = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f205([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
206
def f206(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f206(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
207
def f207(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
f207([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
208
def f208(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors:
factors[name0] = rate0
matched = []
for key, count in left:
if key in factors:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f208([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
209
def f209(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
rootsource = dict(incoming)
finished = set()
listing = []
layers = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f209(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
210
def f210(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f210(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
211
def f211(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
starts = {}
for word, count in frequency.items():
starts[word[0]] = starts.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f211(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
212
def f212(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f212(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
213
def f213(left, right, excluded):
left = list(left)
def tidy(value):
return str(value).strip(' ').upper()[:12]
excluded = {tidy(value) for value in excluded}
a = {tidy(value) for value in left} - excluded
b = {tidy(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f213(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
214
def f214(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
indexes = [pos for pos, value in enumerate(totals[:64]) if value >= limit and (limit >= 0 or pos > 0)]
ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': indexes, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f214([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
215
def f215(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
needs[b] += 1
initial = dict(needs)
finished = set()
listing = []
layers = []
while len(finished) < len(nodes) and len(finished) < 20:
available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
if not available:
break
current = available
layers.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in routes[node]:
needs[nxt] -= 1
returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f215(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
216
def f216(rows, keep, ratemap):
rows = list(rows)
selected = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
score = value * ratemap[group]
selected.append((code, score))
buckets[group] = buckets.get(group, 0) + score
amount += score
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f216([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
217
def f217(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 or len(word) < 2:
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
f217(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
218
def f218(rows, keep, prices):
rows = list(rows)
kept = []
groupmap = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep and value != 0:
charge = value * prices[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
f218([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
219
def f219(rows, keep, factors):
rows = list(rows)
kept = []
totals = {}
sumvalue = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * factors[group]
kept.append((code, cost))
totals[group] = totals.get(group, 0) + cost
sumvalue += cost
kept.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
output = dict()
output.update(returnvalue)
return output
f219([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
220
def f220(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(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f220([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
221
def f221(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]
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
f221([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
222
def f222(board):
board = list(board)
known = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in known:
continue
cells = []
work = [(row, col)]
known.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
if len(known) >= 100:
continue
work.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f222(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
223
def f223(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f223(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
224
def f224(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f224(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
225
def f225(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)
complete = set()
result = []
rounds = []
while len(complete) < len(nodes):
available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
if not available:
break
current = available[:1] if any((str(node).isupper() for node in nodes)) else available
rounds.append(current)
for node in current:
complete.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
f225(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
226
def f226(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)
spaces = []
for pos in range(1, len(combined)):
left = combined[pos][0]
spaces.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f226([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
227
def f227(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) > 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
f227(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
228
def f228(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
items = []
for key, count in left:
if key in ratemap:
items.append((key, count * ratemap[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in ratemap))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f228([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
229
def f229(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]
growth = 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': indexes, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f229([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
230
def f230(left, right, excluded):
left = list(left)
def normalize(value):
return str(value).strip(' ').upper()
excluded = {normalize(value) for value in excluded}
a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - excluded
b = {normalize(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f230(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
231
def f231(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(0, combined[-1][1], right)
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((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
f231([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
232
def f232(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, min(65, len(series))) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f232([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
233
def f233(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
f233([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
234
def f234(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
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
f234(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
235
def f235(rows, keep, ratemap):
rows = list(rows)
selected = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * ratemap[group]
selected.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f235([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
236
def f236(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
f236([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
237
def f237(rows, keep, ratemap):
rows = list(rows)
matches = []
totals = {}
sumvalue = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
score = value * abs(ratemap[group])
matches.append((code, score))
totals[group] = totals.get(group, 0) + score
sumvalue += score
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': totals, 'top': [code for code, score in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f237([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
238
def f238(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
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
f238([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
239
def f239(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(min(64, len(values) - size + 1)):
totals.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(totals) if value >= limit]
ups = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': matches, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f239([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
240
def f240(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f240(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
241
def f241(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = right
spaces = []
for pos in range(1, len(combined)):
left = combined[pos][0]
spaces.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f241([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
242
def f242(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
indegree = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
nextmap[a].append(b)
indegree[b] += 1
initial = dict(indegree)
complete = set()
sequence = []
groups = []
while len(complete) < len(nodes):
available = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available
groups.append(current)
for node in current:
complete.add(node)
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 initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f242(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
243
def f243(board):
board = list(board)
visited = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f243(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
244
def f244(left, right, banned):
left = list(left)
def normalize(value):
return str(value).strip(' \r').upper()
banned = {str(value).upper() for value in banned}
a = {normalize(value) for value in left} - banned
b = {normalize(value) for value in right} - banned
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f244(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
245
def f245(board):
board = list(board)
known = set()
components = []
for row in range(len(board)):
for col in range(len(board[0])):
if col >= 12 or board[row][col] != '#' or (row, col) in known:
continue
cells = []
queue = [(row, col)]
known.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f245(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
246
def f246(rows, keep, factors):
rows = list(rows)
matches = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * factors[group]
matches.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f246([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
247
def f247(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + max(0, gap):
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f247([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
248
def f248(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
if not segments or left > segments[-1][1] + gap:
segments.append([left, right])
else:
segments[-1][1] = 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
f248([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
249
def f249(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]
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
f249([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
250
def f250(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
positions = [pos for pos, value in enumerate(series) if value >= limit and (limit >= 0 or pos > 0)]
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': positions, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f250([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
251
def f251(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
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
f251(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
252
def f252(values, width, limit):
values = list(values)
size = width if width > 1 or width < 1 else 2
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum(values[pos:pos + size]))
positions = [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': min(256, max(windows)), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f252([19, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 10, 13], 4, 56)
{"best":71,"hits":[0,1,2,10,11],"rises":5,"sums":[70,71,56,41,49,43,43,51,49,55,61,57]}
253
def f253(board):
board = list(board)
visited = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f253(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
254
def f254(rows, keep, prices):
rows = list(rows)
selected = []
totals = {}
grand = 0
for code, group, state, value in rows:
if state in keep:
score = value * abs(prices[group])
selected.append((code, score))
totals[group] = totals.get(group, 0) + score
grand += score
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f254([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
255
def f255(left, right, excluded):
left = list(left)
def tidy(value):
return str(value).strip(' \n').upper()
excluded = {str(value).strip() for value in excluded}
a = {tidy(value) for value in left} - excluded
b = {tidy(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f255(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
256
def f256(rows, keep, factors):
rows = list(rows)
selected = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * factors[group]
selected.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], 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
f256([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
257
def f257(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
frequency[word] = min(9, frequency.get(word, 0) + 1)
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f257(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
258
def f258(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + gap % 5:
result.append([left, right])
else:
result[-1][1] = right
gaps = []
for pos in range(1, len(result)):
left = result[pos][0]
gaps.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f258([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
259
def f259(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] = max(result[-1][1], right)
breaks = []
for pos in range(1, min(50, 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
f259([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
260
def f260(board):
board = list(board)
visited = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in visited:
continue
cells = []
work = [(row, col)]
visited.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
work.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f260(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
261
def f261(rows, keep, prices):
rows = list(rows)
selected = []
totals = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep:
charge = value * abs(prices[group])
selected.append((code, charge))
totals[group] = totals.get(group, 0) + charge
amount += charge
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f261([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
262
def f262(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
work = [(row, col)]
visited.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
if len(visited) >= 100:
continue
work.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f262(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
263
def f263(board):
board = list(board)
found = set()
components = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if col >= 12 or board[row][col] != '#' or (row, col) in found:
continue
cells = []
queue = [(row, col)]
found.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f263(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
264
def f264(left, right, banned):
left = list(left)
def tidy(value):
return str(value).strip(' \n').upper()
banned = {str(value).upper() for value in banned}
a = {tidy(value) for value in left} - banned
b = {tidy(value) for value in right} - banned
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f264(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
265
def f265(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
positions = [pos for pos, value in enumerate(windows) if value >= limit]
ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f265([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
266
def f266(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
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
f266([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
267
def f267(left, right, ignored):
left = list(left)
def canon(value):
return str(value).strip().upper()
ignored = {canon(value) for value in ignored}
a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - ignored
b = {canon(value) for value in right} - ignored
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f267(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
268
def f268(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:
if key in prices and count > 0:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len({key for key, value in items})}
output = dict()
output.update(returnvalue)
return output
f268([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
269
def f269(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + max(0, gap):
result.append([left, right])
else:
result[-1][1] = max(result[-1][1], right)
spaces = []
for pos in range(1, len(result)):
left = result[pos][0]
spaces.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((min(100, 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
f269([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
270
def f270(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(min(64, len(values) - size + 1)):
totals.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(totals) if value >= limit]
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
f270([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
271
def f271(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + gap:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
spaces = []
for pos in range(1, len(segments)):
left = segments[pos][0]
spaces.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f271([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
272
def f272(left, right, excluded):
left = list(left)
def tidy(value):
return str(value).strip(' ').upper()
excluded = {tidy(value) for value in excluded}
a = {tidy(value) for value in left} - excluded
b = {tidy(value) for value in right if tidy(value) != ''} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f272(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
273
def f273(rows, keep, factors):
rows = list(rows)
kept = []
groupmap = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * factors[group]
kept.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
sumvalue += cost
kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, cost in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f273([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
274
def f274(rows, keep, prices):
rows = list(rows)
selected = []
groupmap = {}
sumvalue = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep and value >= 0:
score = value * prices[group]
selected.append((code, score))
groupmap[group] = groupmap.get(group, 0) + score
sumvalue += score
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f274([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
275
def f275(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
nextmap[a].append(b)
needs[b] += 1
startdegree = dict(needs)
finished = set()
result = []
groups = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
groups.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': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f275(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
276
def f276(left, right, banned):
left = list(left)
def tidy(value):
return ' '.join(str(value).split()).upper()
banned = {str(value).strip() for value in banned}
a = {tidy(value) for value in left} - banned
b = {tidy(value) for value in right} - banned
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f276(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
277
def f277(left, right, banned):
left = list(left)
def canon(value):
return str(value).strip(' ').upper()
banned = {str(value).upper() for value in banned}
a = {canon(value) for value in left} - banned
b = {canon(value) for value in right} - banned
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f277(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
278
def f278(rows, keep, prices):
rows = list(rows)
kept = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
charge = value * abs(prices[group])
kept.append((code, charge))
buckets[group] = buckets.get(group, 0) + charge
amount += charge
kept.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': amount, 'groups': buckets, 'top': [code for code, charge in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f278([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
279
def f279(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
indegree = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
indegree[b] += 1
initial = dict(indegree)
finished = set()
listing = []
groups = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f279(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
280
def f280(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 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
f280([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
281
def f281(rows, keep, ratemap):
rows = list(rows)
selected = []
totals = {}
sumvalue = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * ratemap[group]
selected.append((code, cost))
totals[group] = totals.get(group, 0) + cost
sumvalue += cost
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f281([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
282
def f282(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
rootsource = dict(needs)
handled = set()
result = []
groups = []
while len(handled) < len(nodes) and len(handled) < 20:
available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
if not available:
break
current = available
groups.append(current)
for node in current:
handled.add(node)
result.append(node)
for node in current:
for nxt in routes[node]:
needs[nxt] -= 1
returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f282(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
283
def f283(rows, keep, prices):
rows = list(rows)
kept = []
groupmap = {}
sumvalue = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
score = value * prices[group]
kept.append((code, score))
groupmap[group] = groupmap.get(group, 0) + score
sumvalue += score
kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, score in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f283([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
284
def f284(rows, keep, factors):
rows = list(rows)
selected = []
groupmap = {}
grand = 0
for code, group, state, value in rows:
if state in keep:
cost = value * factors[group]
selected.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
grand += cost
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f284([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 5})
{"accepted":7,"groups":{"core":561,"edge":45,"north":140,"south":215},"top":["BR17","DL39","AN76"],"total":961}
285
def f285(board):
board = list(board)
known = set()
components = []
for row in range(len(board)):
for col in range(len(board[row])):
if col >= 12 or board[row][col] != '#' or (row, col) in known:
continue
cells = []
queue = [(row, col)]
known.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f285(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
286
def f286(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f286(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['ember'])
{"counts":{"amber":3,"blue":4,"cyan":4,"delta":5,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"b":4,"c":4,"d":5,"f":3,"g":7,"h":2},"size":141,"top":["garnet","delta","blue","cyan","amber"]}
287
def f287(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left[:20]:
if key in prices:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
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
f287([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4), ('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["BR",41],["EV",31],["GQ",31]],"missing":["AN","HR"],"total":294}
288
def f288(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]
ups = 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': positions, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f288([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
289
def f289(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f289(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
290
def f290(left, right, excluded):
left = list(left)
def normalize(value):
return str(value).strip().upper()[:12]
excluded = {str(value).upper() for value in excluded}
a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - excluded
b = {normalize(value) for value in right} - excluded
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f290(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
291
def f291(board):
board = list(board)
found = set()
pieces = []
for row in range(len(board)):
for col in range(min(len(board[row]), 10)):
if board[row][col] != '#' or (row, col) in found:
continue
cells = []
work = [(row, col)]
found.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found):
found.add(nxt)
work.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f291(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
292
def f292(board):
board = list(board)
visited = set()
components = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(min(len(board[row]), 10)):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f292(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
293
def f293(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()
listing = []
groups = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f293(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
294
def f294(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors and rate0 != 0:
factors[name0] = rate0
matched = []
for key, count in left[:20]:
if key in factors:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f294([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
295
def f295(board):
board = list(board)
visited = set()
components = []
for row in range(len(board)):
for col in range(len(board[0])):
if col >= 12 or board[row][col] != '#' or (row, col) in visited:
continue
cells = []
queue = [(row, col)]
visited.add((row, col))
while queue:
cur = queue.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited):
visited.add(nxt)
queue.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f295(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
296
def f296(rows, keep, ratemap):
rows = list(rows)
matches = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
charge = value * abs(ratemap[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
f296([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
297
def f297(left, right, excluded):
left = list(left)
def normalize(value):
return str(value).strip(' \n').upper()
excluded = {normalize(value) for value in excluded}
a = {normalize(value) for value in left} - excluded
b = {normalize(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f297(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
298
def f298(rows, keep, prices):
rows = list(rows)
selected = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep and value != 0:
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': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f298([('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22), ('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)], ['ready', 'checked'], {'north': 10, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":7,"groups":{"core":561,"edge":27,"north":200,"south":215},"top":["BR17","CX43","DL39"],"total":1003}
299
def f299(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors and rate0 != 0:
factors[name0] = rate0
items = []
for key, count in left:
if key in factors and count > 0:
items.append((key, count * factors[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted({key for key, count in left if key not in factors})
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f299([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
300
def f300(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 = []
groups = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f300(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
301
def f301(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(windows) if value >= limit]
growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f301([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
302
def f302(board):
board = list(board)
known = set()
components = []
for row in range(len(board)):
for col in range(len(board[row])):
if board[row][col] != '#' or (row, col) in known:
continue
cells = []
work = [(row, col)]
known.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
work.append(nxt)
components.append((len(cells), min(cells)))
components.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)}
output = dict()
output.update(returnvalue)
return output
f302(['..##..', '#.#.##', '##....', '#...#.', '...#..', '#.##..'])
{"anchors":[[1,0],[0,2],[4,3],[1,4],[3,4],[5,0]],"count":6,"filled":14,"sizes":[4,3,3,2,1,1]}
303
def f303(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)
complete = set()
result = []
rounds = []
while len(complete) < len(nodes) and len(complete) < 20:
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
rounds.append(current)
for node in current:
complete.add(node)
result.append(node)
for node in current:
for nxt in nextmap[node]:
needs[nxt] -= 1
returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f303(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
304
def f304(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap + 1:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
gaps = []
for pos in range(1, 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
f304([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
305
def f305(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
combined = []
for key, count in left:
if key in prices:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f305([('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3), ('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8)], [('BR', 10), ('CX', 7), ('DL', 5), ('EV', 3), ('FP', 7), ('GQ', 6)], 1)
{"count":6,"items":[["CX",85],["FP",85],["GQ",55],["BR",41],["EV",31]],"missing":["AN","HR"],"total":313}
306
def f306(left, right, banned):
left = list(left)
def canon(value):
return str(value).strip(' \n').upper()
banned = {str(value).upper() for value in banned}
a = {canon(value) for value in left} - banned
b = {canon(value) for value in right} - banned
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f306(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
307
def f307(left, right, ignored):
left = list(left)
def normalize(value):
return str(value).strip(' ').upper()
ignored = {str(value).upper() for value in ignored}
a = {normalize(value) for value in left} - ignored
b = {normalize(value) for value in right} - ignored
both = a & b
result = sorted
returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f307(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
308
def f308(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
indegree = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
indegree[b] += 1
startdegree = dict(indegree)
finished = set()
listing = []
groups = []
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
groups.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': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f308(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')])
{"batches":[["auth","cache","db"],["api","jobs","proxy"],["ui","worker"]],"count":8,"order":["auth","cache","db","api","jobs","proxy","ui","worker"],"roots":["auth","cache","db"]}
309
def f309(left, right, ignored):
left = list(left)
def normalize(value):
return str(value).strip(' \r').upper()
ignored = {str(value).strip() for value in ignored}
a = {normalize(value) for value in left} - ignored
b = {normalize(value) for value in right} - ignored
both = a & b
listing = sorted
returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))}
output = dict()
output.update(returnvalue)
return output
f309(['GARNET', 'heliumx', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","HELIUM","HELIUMX","IVORY"],"both":["AMBER","BLUE","FROST","GARNET"],"left":["HELIUMX","IVORY"],"right":["DELTA","HELIUM"],"score":20}
310
def f310(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 + 1:
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
f310([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
311
def f311(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(min(64, len(values) - size + 1)):
series.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(series) if value >= limit]
growth = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': matches, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f311([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
312
def f312(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
f312([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
313
def f313(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f313(['Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber', 'Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'], ['blue'])
{"counts":{"amber":3,"cyan":4,"delta":5,"ember":3,"frost":3,"garnet":7,"helium":2},"initials":{"a":3,"c":4,"d":5,"e":3,"f":3,"g":7,"h":2},"size":140,"top":["garnet","delta","cyan","amber","ember"]}
314
def f314(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
positions = [pos for pos, value in enumerate(windows) if value >= limit]
increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f314([20, 19, 24, 8, 20, 4, 9, 16, 14, 4, 17, 14, 20, 6, 13], 4, 56)
{"best":71,"hits":[0,1,2,10],"rises":4,"sums":[71,71,56,41,49,43,43,51,49,55,57,53]}
315
def f315(board):
board = list(board)
known = set()
pieces = []
for row in range(min(len(board), 10 + (len(board) - len(board)))):
for col in range(len(board[0])):
if board[row][col] != '#' or (row, col) in known:
continue
cells = []
work = [(row, col)]
known.add((row, col))
while work:
cur = work.pop()
cells.append(cur)
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
nxt = (cur[0] + dr, cur[1] + dc)
if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known):
known.add(nxt)
if len(known) >= 100:
continue
work.append(nxt)
pieces.append((len(cells), min(cells)))
pieces.sort(key=lambda item: (-item[0], item[1]))
returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)}
output = dict()
output.update(returnvalue)
return output
f315(['..#...', '#.#.##', '##....', '#...#.', '...#..', '####..'])
{"anchors":[[4,3],[1,0],[0,2],[1,4],[3,4]],"count":5,"filled":14,"sizes":[5,4,2,2,1]}
316
def f316(left, right, excluded):
left = list(left)
def canon(value):
return str(value).strip().upper()
excluded = {str(value).strip() for value in excluded}
a = {canon(value) for value in left} - excluded
b = {canon(value) for value in right} - excluded
both = a & b
sequence = sorted
returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))}
output = dict()
output.update(returnvalue)
return output
f316(['GARNETx', 'helium', 'BLUE', 'frost', 'ivory', ' Amber', 'Ember'], ['helium', 'BLUE', 'GARNET', 'frost', 'delta', ' Amber', 'Ember'], ['EMBER'])
{"all":["AMBER","BLUE","DELTA","FROST","GARNET","GARNETX","HELIUM","IVORY"],"both":["AMBER","BLUE","FROST","HELIUM"],"left":["GARNETX","IVORY"],"right":["DELTA","GARNET"],"score":20}
317
def f317(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + max(0, gap) + 1:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
spaces = []
for pos in range(1, len(segments)):
left = segments[pos][0]
spaces.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((min(100, right - left) for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f317([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
318
def f318(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + max(0, gap):
segments.append([left, right])
else:
segments[-1][1] = 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
f318([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 1)
{"cover":42,"holes":[2,3,7,3,5],"longest":11,"segments":[[2,12],[14,25],[28,36],[43,45],[48,54],[59,64]]}
319
def f319(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) and len(handled) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
handled.add(node)
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
f319(['api', 'cache', 'jobs', 'ui', 'proxy', 'db', 'worker', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui')])
{"batches":[["auth","cache","db","proxy"],["api","jobs"],["ui","worker"]],"count":8,"order":["auth","cache","db","proxy","api","jobs","ui","worker"],"roots":["auth","cache","db","proxy"]}
320
def f320(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(set(spans)):
if not segments or left > segments[-1][1] + gap % 5:
segments.append([left, right])
else:
segments[-1][1] = right
gaps = []
for pos in range(1, len(segments)):
left = segments[pos][0]
gaps.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f320([(2, 6), (5, 12), (14, 21), (18, 25), (28, 33), (33, 36), (43, 45), (48, 54), (59, 64)], 3)
{"cover":50,"holes":[7,5],"longest":34,"segments":[[2,36],[43,54],[59,64]]}
Final Query
Give me the output of the final query without executing it!
import json, re
from collections import deque
out = {}
spans = list(((2, 6), (5, 12), (14, 21), (18, 25)) + ((28, 33), (33, 36), (43, 45), (48, 54), (59, 64)))
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))}
badge = record['cc']
width = 4
limit = 56
route = badge
cases = {
42: list((20, 19, 24, 8, 20, 4) + (9, 16, 14, 4, 17, 14, 20, 6, 13)),
50: list((19, 19, 24, 8, 20, 4) + (9, 16, 14, 4, 17, 14, 20, 10, 13)),
}
values = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
current += values[pos] - values[pos - width]
sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
if value >= limit:
hits.append(pos)
if pos and value > sums[pos - 1]:
rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
permit = record['cc']
board = list(('..#...', '#.#.##', '##....', '#...#.') + ('...#..', '####..'))
cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#']
parent = {cell: cell for cell in cells}
def root(cell):
while parent[cell] != cell:
parent[cell] = parent[parent[cell]]
cell = parent[cell]
return cell
def merge(a, b):
a = root(a)
b = root(b)
if a != b:
parent[b] = a
for row, col in cells:
for other in ((row - 1, col), (row, col - 1)):
if other in parent:
merge((row, col), other)
groups = {}
for cell in cells:
groups.setdefault(root(cell), []).append(cell)
parts = [(len(group), min(group)) for group in groups.values()]
parts.sort(key=lambda item: (-item[0], item[1]))
record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)}
signal = record['dd']
nodes = list(('api', 'cache', 'jobs', 'ui') + ('proxy', 'db', 'worker', 'auth'))
route = signal
cases = {
5: list((('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui'))),
6: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('proxy', 'ui'))),
}
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)}
token = record['aa'][3]
lines = list(('Garnet, garnet. helium cyan', 'Amber, garnet. frost blue amber') + ('Ember, cyan. helium frost', 'Ember, delta. delta delta delta', 'Cyan, blue. blue garnet', 'Blue, ember. garnet delta amber', 'Frost, cyan. garnet garnet'))
route = token
cases = {
'proxy': ['ember'],
'api': ['blue'],
}
stop = cases[route]
normalized = set()
for item in stop:
normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
counts[word] = counts.get(word, 0) + 1
initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
memo = record['dd']
rows = list((('CX43', 'north', 'checked', 20), ('CX80', 'edge', 'checked', 9), ('BR17', 'core', 'ready', 24), ('AN54', 'core', 'hold', 23), ('DL91', 'core', 'void', 18), ('CX28', 'north', 'void', 7), ('CX65', 'south', 'void', 11), ('BR02', 'south', 'checked', 22)) + (('DL39', 'core', 'ready', 14), ('AN76', 'core', 'ready', 13), ('DL13', 'south', 'ready', 21), ('AN50', 'north', 'void', 8), ('AN87', 'north', 'void', 6), ('AN24', 'core', 'hold', 13)))
keep = list(('ready',) + ('checked',))
route = (permit, memo)
cases = {
(4, 140): dict((('north', 10), ('south', 5), ('core', 11)) + (('edge', 3),)),
(4, 141): dict((('north', 7), ('south', 5), ('core', 11)) + (('edge', 5),)),
(5, 140): dict((('north', 7), ('south', 5), ('core', 11)) + (('edge', 5),)),
(5, 141): dict((('north', 7), ('south', 5), ('core', 11)) + (('edge', 5),)),
}
rates = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
clue = record['bb']
right = list((('BR', 10), ('CX', 7), ('DL', 5)) + (('EV', 3), ('FP', 7), ('GQ', 6)))
fee = 1
route = clue
cases = {
961: list((('AN', 12), ('BR', 4), ('CX', 12), ('DL', 3)) + (('EV', 10), ('FP', 12), ('GQ', 9), ('HR', 8))),
1003: list((('AN', 12), ('BR', 4), ('CX', 12), ('DL', 4)) + (('EV', 10), ('FP', 12), ('GQ', 5), ('HR', 8))),
}
left = cases[route]
joined = []
for key, count in left:
matches = [rate for name, rate in right if name == key]
if matches:
joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
stamp = record['bb']
right = list(('helium', 'BLUE') + ('GARNET', 'frost', 'delta', ' Amber', 'Ember'))
blocked = ['EMBER']
route = stamp
cases = {
294: list(('GARNETx', 'helium') + ('BLUE', 'frost', 'ivory', ' Amber', 'Ember')),
313: list(('GARNET', 'heliumx') + ('BLUE', 'frost', 'ivory', ' Amber', 'Ember')),
}
left = cases[route]
a = set()
b = set()
ban = set()
for value in blocked:
ban.add(value.strip().upper())
for value in left:
value = value.strip().upper()
if value not in ban:
a.add(value)
for value in right:
value = value.strip().upper()
if value not in ban:
b.add(value)
both = a.intersection(b)
record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
out['ee'] = record['ee']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))