001
def f1(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[: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
f1(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
002
def f2(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x = max(-64, min(64, x + dx))
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f2([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
003
def f3(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(min(64, len(values) - size + 1)):
series.append(sum((max(item, 0) for item in values[pos:pos + size])))
matches = [pos for pos, value in enumerate(series) if value >= limit]
ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': matches, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f3([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
004
def f4(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used = min(64, used + 1)
point = (x, y)
if point in found and list(point) not in returns:
returns.append(list(point))
found.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f4([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
005
def f5(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]))
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
f5([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
006
def f6(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()
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), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
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
f6(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
007
def f7(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
incoming[b] += 1
rootsource = dict(incoming)
finished = set()
sequence = []
groups = []
while len(finished) < len(nodes):
available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not available:
break
current = available
groups.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in routes[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f7(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
008
def f8(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(min(count, 64)):
x += dx
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in returns:
returns.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f8([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
009
def f9(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in edges:
routes.setdefault(a, []).append(b)
distance = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
pending = [start]
while pending:
cur = pending.pop(0)
if distance[cur] < limit:
for nxt in sorted(routes.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
pending.append(nxt)
sequence = list(distance)
lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel[:3], 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f9([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
010
def f10(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if edge[0] <= edge[1]):
children.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < min(limit, 3):
for nxt in sorted(children.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f10([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
011
def f11(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
combined = []
for key, count in left:
if key in prices and count > 0:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f11([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
012
def f12(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]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f12([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
013
def f13(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in (edge for edge in edges if edge[0] <= edge[1]):
routes.setdefault(a, []).append(b)
steps = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if steps[cur] < limit:
for nxt in sorted(routes.get(cur, []))[:20]:
if nxt not in steps:
steps[nxt] = steps[cur] + 1
queue.append(nxt)
result = list(steps)
furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f13([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
014
def f14(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
children.setdefault(a, []).append(b)
steps = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if steps[cur] < limit:
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in steps:
steps[nxt] = steps[cur] + 1
queue.append(nxt)
listing = list(steps)
furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': listing, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f14([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
015
def f15(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if edge[0] <= edge[1]):
children.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in sorted(children.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f15([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
016
def f16(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if edge[0] <= edge[1]):
nextmap.setdefault(a, []).append(b)
steps = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if steps[cur] < limit:
for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
if nxt not in steps:
steps[nxt] = steps[cur] + 1
queue.append(nxt)
listing = list(steps)
lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': listing, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f16([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
017
def f17(rows, keep, factors):
rows = list(rows)
selected = []
groupmap = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * factors[group]
selected.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], 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
f17([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
018
def f18(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
startdegree = dict(incoming)
complete = set()
sequence = []
groups = []
while len(complete) < len(nodes) and len(complete) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
groups.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': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f18(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
019
def f19(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
nextmap.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < min(limit, 3):
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
result = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f19([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
020
def f20(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)
handled = set()
sequence = []
groups = []
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[:1] if any((str(node).isupper() for node in nodes)) else available
groups.append(current)
for node in current:
handled.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f20(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
021
def f21(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in edges:
routes.setdefault(a, []).append(b)
steps = {start: 0}
pending = [start]
while pending:
cur = pending.pop(0)
if steps[cur] < limit:
for nxt in sorted(routes.get(cur, [])):
if nxt not in steps:
steps[nxt] = steps[cur] + 1
pending.append(nxt)
sequence = list(steps)
edge = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f21([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
022
def f22(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap % 5:
combined.append([left, right])
else:
combined[-1][1] = right
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
f22([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
023
def f23(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
children.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in distance and (not nxt.startswith('Z')):
distance[nxt] = distance[cur] + 1
queue.append(nxt)
result = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f23([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
024
def f24(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
matched = []
for key, count in left:
if key in ratemap:
matched.append((key, count * ratemap[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in ratemap))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f24([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
025
def f25(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y += dy
used += 1
point = (x, y)
if point in found and list(point) not in repeats:
repeats.append(list(point))
found.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f25([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
026
def f26(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]
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
f26([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
027
def f27(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
incoming[b] += 1
initial = dict(incoming)
finished = set()
sequence = []
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 routes[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
f27(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
028
def f28(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
nextmap[a].append(b)
incoming[b] += 1
initial = dict(incoming)
handled = set()
result = []
groups = []
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
groups.append(current)
for node in current:
handled.add(node)
result.append(node)
for node in current:
for nxt in nextmap[node]:
incoming[nxt] -= 1
returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f28(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
029
def f29(rows, keep, factors):
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}:
charge = value * abs(factors[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
f29([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
030
def f30(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop or len(word) < 2:
continue
frequency[word] = min(9, 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
f30(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
031
def f31(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x = max(-64, min(64, x + dx))
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f31([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
032
def f32(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not segments or left > segments[-1][1] + gap % 5:
segments.append([left, right])
else:
segments[-1][1] = max(0, segments[-1][1], right)
gaps = []
for pos in range(1, len(segments)):
left = segments[pos][0]
gaps.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f32([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
033
def f33(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if edge[0] <= edge[1]):
children.setdefault(a, []).append(b)
levels = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if levels[cur] < min(limit, 3):
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
queue.append(nxt)
sequence = list(levels)
furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f33([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
034
def f34(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y = max(-64, min(64, y + dy))
used = min(64, used + 1)
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f34([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
035
def f35(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in edges:
routes.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in sorted(routes.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
listing = list(distance)
edge = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': listing, 'depth': distance, 'frontier': edge, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f35([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
036
def f36(values, width, limit):
values = list(values)
size = width if width > 1 or width < 1 else 2
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]
ups = 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': ups}
output = dict()
output.update(returnvalue)
return output
f36([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
037
def f37(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges:
children.setdefault(a, []).append(b)
levels = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
pending = [start]
while pending:
cur = pending.pop(0)
if levels[cur] < limit:
for nxt in sorted(children.get(cur, [])):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
pending.append(nxt)
result = list(levels)
lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': result, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f37([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
038
def f38(rows, keep, ratemap):
rows = list(rows)
matches = []
groupmap = {}
amount = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * ratemap[group]
matches.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
amount += cost
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
output = dict()
output.update(returnvalue)
return output
f38([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
039
def f39(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
startdegree = dict(incoming)
complete = set()
result = []
rounds = []
while len(complete) < len(nodes) and len(complete) < 20:
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
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 startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f39(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
040
def f40(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
nextmap.setdefault(a, []).append(b)
steps = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if steps[cur] < limit:
for nxt in sorted(nextmap.get(cur, []))[:20]:
if nxt not in steps:
steps[nxt] = steps[cur] + 1
queue.append(nxt)
result = list(steps)
furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f40([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
041
def f41(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors or rate0 <= rate0 + 0:
factors[name0] = rate0
matched = []
for key, count in left:
if key in factors and count > 0:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted({key for key, count in left if key not in factors})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f41([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
042
def f42(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
nextmap.setdefault(a, []).append(b)
distance = {start: 0} if any((start in edge for edge in edges)) else {}
work = [start]
while work:
cur = work.pop(0)
if distance[cur] < limit:
for nxt in sorted(nextmap.get(cur, []))[:20]:
if nxt not in distance:
distance[nxt] = distance[cur] + 1
work.append(nxt)
result = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f42([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
043
def f43(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] = 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
f43(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
044
def f44(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges[:16]:
children.setdefault(a, []).append(b)
steps = {start: 0}
pending = [start]
while pending:
cur = pending.pop(0)
if steps[cur] < min(limit, 3):
for nxt in sorted(children.get(cur, [])):
if nxt not in steps and (not nxt.startswith('Z')):
steps[nxt] = steps[cur] + 1
pending.append(nxt)
sequence = list(steps)
lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': sequence, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f44([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
045
def f45(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors:
factors[name0] = rate0
matched = []
for key, count in left[:20]:
if key in factors:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f45([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
046
def f46(rows, keep, prices):
rows = list(rows)
selected = []
buckets = {}
amount = 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
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
f46([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
047
def f47(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
f47([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
048
def f48(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in edges:
nextmap.setdefault(a, []).append(b)
steps = {start: 0} if limit > 0 or limit < 0 else {}
work = [start]
while work:
cur = work.pop(0)
if steps[cur] < limit:
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in steps and (not nxt.startswith('Z')):
steps[nxt] = steps[cur] + 1
work.append(nxt)
sequence = list(steps)
edge = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge[:3], 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f48([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
049
def f49(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted({key for key, count in left if key not in prices})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f49([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
050
def f50(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)
handled = set()
listing = []
layers = []
while len(handled) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
handled.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
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
f50(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
051
def f51(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], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f51([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
052
def f52(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors:
factors[name0] = rate0
matched = []
for key, count in left:
if key in factors and count > 0:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted({key for key, count in left if key not in factors})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f52([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
053
def f53(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors:
factors[name0] = rate0
matched = []
for key, count in left[:20]:
if key in factors:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f53([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
054
def f54(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]
growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': indexes, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f54([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
055
def f55(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(windows) if value > limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f55([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
056
def f56(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right[:20]:
if name0 not in factors:
factors[name0] = rate0
matched = []
for key, count in left[:20]:
if key in factors and count > 0:
matched.append((key, count * factors[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted((key for key, count in left if key not in factors))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f56([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
057
def f57(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)
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
f57([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
058
def f58(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
f58([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
059
def f59(rows, keep, ratemap):
rows = list(rows)
selected = []
totals = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep:
charge = value * ratemap[group]
selected.append((code, charge))
totals[group] = totals.get(group, 0) + charge
sumvalue += charge
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f59([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
060
def f60(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f60(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
061
def f61(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
nextmap = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
nextmap[a].append(b)
indegree[b] += 1
startdegree = dict(indegree)
handled = set()
result = []
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)
result.append(node)
for node in current:
for nxt in nextmap[node]:
indegree[nxt] -= 1
returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f61(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
062
def f62(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f62([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
063
def f63(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({key for key, value in combined})}
output = dict()
output.update(returnvalue)
return output
f63([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
064
def f64(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(min(count, 64)):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in repeats:
repeats.append(list(point))
visited.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f64([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
065
def f65(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f65(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
066
def f66(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:
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
f66(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
067
def f67(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
nextmap.setdefault(a, []).append(b)
distance = {start: 0}
pending = [start]
while pending:
cur = pending.pop(0)
if distance[cur] < limit:
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
pending.append(nxt)
listing = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f67([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
068
def f68(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
indegree = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
indegree[b] += 1
initial = dict(indegree)
handled = set()
sequence = []
layers = []
while len(handled) < len(nodes) and len(handled) < 20:
available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
if not available:
break
current = available
layers.append(current)
for node in current:
handled.add(node)
sequence.append(node)
for node in current:
for nxt in routes[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f68(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
069
def f69(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f69([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
070
def f70(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
wordmap[word] = 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
f70(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
071
def f71(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges:
children.setdefault(a, []).append(b)
steps = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if steps[cur] < limit:
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in steps:
steps[nxt] = steps[cur] + 1
queue.append(nxt)
sequence = list(steps)
edge = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f71([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
072
def f72(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
complete = set()
sequence = []
layers = []
while len(complete) < len(nodes):
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f72(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
073
def f73(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f73(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
074
def f74(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[:64]) if value >= limit]
growth = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max([0] + series), 'hits': matches, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f74([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
075
def f75(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(set(spans)):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = right
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
f75([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
076
def f76(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
matches = [pos for pos, value in enumerate(totals) if value >= limit]
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
f76([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
077
def f77(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f77(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
078
def f78(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop or len(word) < 2:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
output = dict()
output.update(returnvalue)
return output
f78(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
079
def f79(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(0, segments[-1][1], right)
spaces = []
for pos in range(1, len(segments)):
left = segments[pos][0]
spaces.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f79([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
080
def f80(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(series) if value >= limit]
increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f80([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
081
def f81(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(spans):
if not combined or left > combined[-1][1] + gap % 5 + 1:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f81([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
082
def f82(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
f82([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
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))]
indegree = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
indegree[b] += 1
initial = dict(indegree)
complete = set()
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
layers.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in routes[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f83(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
084
def f84(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in repeats:
repeats.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f84([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
085
def f85(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
complete = set()
sequence = []
rounds = []
while len(complete) < len(nodes) and len(complete) < 20:
available = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
if not available:
break
current = available
rounds.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f85(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
086
def f86(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f86([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
087
def f87(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f87([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
088
def f88(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[: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({key for key, value in items})}
output = dict()
output.update(returnvalue)
return output
f88([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
089
def f89(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
positions = [pos for pos, value in enumerate(windows) if value > limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f89([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
090
def f90(rows, keep, ratemap):
rows = list(rows)
selected = []
buckets = {}
sumvalue = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
cost = value * ratemap[group]
selected.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
sumvalue += cost
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f90([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
091
def f91(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
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)
complete = set()
sequence = []
layers = []
while len(complete) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
layers.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in nextmap[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f91(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
092
def f92(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) 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
f92([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
093
def f93(rows, keep, prices):
rows = list(rows)
kept = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * abs(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(dict.fromkeys(kept)), 'total': amount, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f93([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
094
def f94(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]))
unmatched = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f94([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
095
def f95(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
routes.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f95([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
096
def f96(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(totals) if value >= limit 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': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f96([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
097
def f97(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] = 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
f97(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
098
def f98(spans, gap):
spans = list(spans)
result = []
for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
if not result or left > result[-1][1] + gap % 5 + 1:
result.append([left, right])
else:
result[-1][1] = max(result[-1][1], right)
spaces = []
for pos in range(1, len(result)):
left = result[pos][0]
spaces.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f98([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
099
def f99(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not result or left > result[-1][1] + max(0, gap):
result.append([left, right])
else:
result[-1][1] = max(result[-1][1], right)
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
f99([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
100
def f100(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right[:20]:
if name0 not in ratemap and rate0 != 0:
ratemap[name0] = rate0
matched = []
for key, count in left:
if key in ratemap:
matched.append((key, count * ratemap[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in ratemap))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f100([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
101
def f101(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right[:20]:
if name0 not in ratemap:
ratemap[name0] = rate0
items = []
for key, count in left:
if key in ratemap and count > 0:
items.append((key, count * ratemap[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
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
f101([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
102
def f102(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f102([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
103
def f103(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right[:20]:
if name0 not in ratemap:
ratemap[name0] = rate0
matched = []
for key, count in left:
if key in ratemap:
matched.append((key, count * ratemap[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f103([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
104
def f104(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
incoming[b] += 1
rootsource = dict(incoming)
handled = set()
sequence = []
layers = []
while len(handled) < len(nodes) and len(handled) < 20:
available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available
layers.append(current)
for node in current:
handled.add(node)
sequence.append(node)
for node in current:
for nxt in routes[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f104(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
105
def f105(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
handled = set()
sequence = []
groups = []
while len(handled) < len(nodes):
available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=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]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f105(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
106
def f106(values, width, limit):
values = list(values)
size = width
series = []
for pos in range(len(values) - size + 1):
series.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(series[:64]) if value > limit]
increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f106([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
107
def f107(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + max(0, gap):
result.append([left, right])
else:
result[-1][1] = right
gaps = []
for pos in range(1, len(result)):
left = result[pos][0]
gaps.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f107([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
108
def f108(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
nextmap.setdefault(a, []).append(b)
levels = {start: 0} if limit > 0 or limit < 0 else {}
work = [start]
while work:
cur = work.pop(0)
if levels[cur] < limit:
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
work.append(nxt)
result = list(levels)
furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f108([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
109
def f109(rows, keep, factors):
rows = list(rows)
matches = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
charge = value * abs(factors[group])
matches.append((code, charge))
totals[group] = totals.get(group, 0) + charge
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
f109([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
110
def f110(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
incoming[b] += 1
startdegree = dict(incoming)
finished = set()
listing = []
groups = []
while len(finished) < len(nodes):
available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available
groups.append(current)
for node in current:
finished.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
f110(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
111
def f111(rows, keep, ratemap):
rows = list(rows)
matches = []
totals = {}
grand = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * ratemap[group]
matches.append((code, cost))
totals[group] = totals.get(group, 0) + cost
grand += cost
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': grand, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f111([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
112
def f112(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f112([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
113
def f113(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': min(256, max(series)), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f113([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
114
def f114(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, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f114([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
115
def f115(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
rootsource = dict(incoming)
complete = set()
result = []
groups = []
while len(complete) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
if not nextbatch:
break
current = nextbatch
groups.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': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f115(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
116
def f116(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], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f116([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
117
def f117(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f117(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
118
def f118(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in repeats:
repeats.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f118([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
119
def f119(rows, keep, prices):
rows = list(rows)
matches = []
groupmap = {}
amount = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * prices[group]
matches.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
amount += cost
matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f119([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
120
def f120(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in frequency.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
output = dict()
output.update(returnvalue)
return output
f120(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
121
def f121(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
routes[a].append(b)
indegree[b] += 1
startdegree = dict(indegree)
finished = set()
listing = []
groups = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
finished.add(node)
listing.append(node)
for node in current:
for nxt in routes[node]:
indegree[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f121(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
122
def f122(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in wordmap.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f122(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
123
def f123(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(min(64, len(values) - size + 1)):
totals.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(totals) if value >= limit]
ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': matches, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f123([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
124
def f124(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(spans):
if not combined or left > combined[-1][1] + gap + 1:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
breaks = []
for pos in range(1, len(combined)):
left = combined[pos][0]
breaks.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f124([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
125
def f125(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap % 5:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
spaces = []
for pos in range(1, len(combined)):
left = combined[pos][0]
spaces.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f125([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
126
def f126(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges[:16]:
children.setdefault(a, []).append(b)
steps = {start: 0} if any((start in edge for edge in edges)) else {}
queue = [start]
while queue:
cur = queue.pop(0)
if steps[cur] < limit:
for nxt in sorted(children.get(cur, [])):
if nxt not in steps and (not nxt.startswith('Z')):
steps[nxt] = steps[cur] + 1
queue.append(nxt)
sequence = list(steps)
furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f126([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
127
def f127(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(min(count, 64)):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f127([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
128
def f128(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in edges[:16]:
nextmap.setdefault(a, []).append(b)
levels = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if levels[cur] < limit:
for nxt in sorted(nextmap.get(cur, []))[:20]:
if nxt not in levels and (not nxt.startswith('Z')):
levels[nxt] = levels[cur] + 1
queue.append(nxt)
result = list(levels)
furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f128([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
129
def f129(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
startdegree = dict(incoming)
handled = set()
result = []
layers = []
while len(handled) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
handled.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f129(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
130
def f130(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(combined)}
output = dict()
output.update(returnvalue)
return output
f130([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
131
def f131(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z' 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
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
f131(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
132
def f132(spans, gap):
spans = list(spans)
result = []
for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
if not result or left > result[-1][1] + gap:
result.append([left, right])
else:
result[-1][1] = max(result[-1][1], right)
gaps = []
for pos in range(1, len(result)):
left = result[pos][0]
gaps.append(min(100, 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
f132([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
133
def f133(rows, keep, prices):
rows = list(rows)
matches = []
buckets = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep:
cost = value * abs(prices[group])
matches.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
amount += cost
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': amount, 'groups': buckets, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f133([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
134
def f134(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + gap:
result.append([left, right])
else:
result[-1][1] = right
spaces = []
for pos in range(1, min(50, len(result))):
left = result[pos][0]
spaces.append(min(100, left - result[pos - 1][1]))
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f134([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
135
def f135(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
items = []
for key, count in left:
if key in prices:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f135([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
136
def f136(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
children.setdefault(a, []).append(b)
distance = {start: 0} if limit > 0 or limit < 0 else {}
pending = [start]
while pending:
cur = pending.pop(0)
if distance[cur] < limit:
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
pending.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f136([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
137
def f137(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used = min(64, used + 1)
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f137([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
138
def f138(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:
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
f138(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
139
def f139(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], item[0]))
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
f139([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
140
def f140(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]))
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
f140(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
141
def f141(rows, keep, prices):
rows = list(rows)
selected = []
totals = {}
amount = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * abs(prices[group])
selected.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f141([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
142
def f142(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + gap:
result.append([left, right])
else:
result[-1][1] = max(result[-1][1], right)
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
f142([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
143
def f143(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
children.setdefault(a, []).append(b)
levels = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
pending = [start]
while pending:
cur = pending.pop(0)
if levels[cur] < limit:
for nxt in sorted(children.get(cur, [])):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
pending.append(nxt)
sequence = list(levels)
lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': sequence, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f143([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
144
def f144(rows, keep, factors):
rows = list(rows)
selected = []
totals = {}
grand = 0
for code, group, state, value in rows:
if str(state).lower() in {str(item).lower() for item in keep}:
cost = value * factors[group]
selected.append((code, cost))
totals[group] = totals.get(group, 0) + cost
grand += cost
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f144([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
145
def f145(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
breaks = []
for pos in range(1, len(combined)):
left = combined[pos][0]
breaks.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((min(100, 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
f145([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
146
def f146(rows, keep, prices):
rows = list(rows)
kept = []
buckets = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep:
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], str(item[0]).casefold()))
returnvalue = {'accepted': len(kept), 'total': amount, 'groups': buckets, 'top': [code for code, charge in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f146([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
147
def f147(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]
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
f147([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
148
def f148(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
if word in stop:
continue
wordmap[word] = min(9, wordmap.get(word, 0) + 1)
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f148(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
149
def f149(left, right, fee):
left = list(left)
factors = {}
for name0, rate0 in right:
if name0 not in factors and rate0 != 0:
factors[name0] = rate0
items = []
for key, count in left:
if key in factors:
items.append((key, count * factors[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
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
f149([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
150
def f150(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], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f150([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
151
def f151(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in found and list(point) not in crossings:
crossings.append(list(point))
found.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f151([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
152
def f152(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(set(spans)):
if not segments or left > segments[-1][1] + gap:
segments.append([left, right])
else:
segments[-1][1] = right
gaps = []
for pos in range(1, len(segments)):
left = segments[pos][0]
gaps.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in segments)))}
output = dict()
output.update(returnvalue)
return output
f152([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
153
def f153(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
finished = set()
sequence = []
layers = []
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
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 initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f153(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
154
def f154(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]))
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
f154([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
155
def f155(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
routes.setdefault(a, []).append(b)
distance = {start: 0} if any((start in edge for edge in edges)) else {}
work = [start]
while work:
cur = work.pop(0)
if distance[cur] < min(limit, 3):
for nxt in sorted(routes.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
work.append(nxt)
result = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f155([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
156
def f156(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
positions = [pos for pos, value in enumerate(totals) if value >= limit]
ups = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f156([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
157
def f157(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[:64]:
if word in stop:
continue
wordmap[word] = min(9, wordmap.get(word, 0) + 1)
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f157(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
158
def f158(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
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
f158([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
159
def f159(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in repeats:
repeats.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f159([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
160
def f160(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
nextmap.setdefault(a, []).append(b)
distance = {start: 0} if any((start in edge for edge in edges)) else {}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
listing = list(distance)
lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': listing, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f160([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
161
def f161(rows, keep, prices):
rows = list(rows)
selected = []
groupmap = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
charge = value * prices[group]
selected.append((code, charge))
groupmap[group] = groupmap.get(group, 0) + charge
amount += charge
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f161([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
162
def f162(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
frequency[word] = 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
f162(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
163
def f163(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y = max(-64, min(64, y + dy))
used = min(64, used + 1)
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f163([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
164
def f164(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]
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
f164([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
165
def f165(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
items = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f165(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
166
def f166(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
items = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
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
f166(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
167
def f167(rows, keep, prices):
rows = list(rows)
kept = []
buckets = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * prices[group]
kept.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
sumvalue += cost
kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f167([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
168
def f168(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(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': min(100, max((right - left for left, right in combined)))}
output = dict()
output.update(returnvalue)
return output
f168([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
169
def f169(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
nextmap.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f169([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
170
def f170(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
positions = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f170([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
171
def f171(rows, keep, factors):
rows = list(rows)
matches = []
totals = {}
grand = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * 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
f171([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
172
def f172(rows, keep, ratemap):
rows = list(rows)
selected = []
buckets = {}
sumvalue = 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
sumvalue += cost
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f172([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
173
def f173(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)
complete = set()
result = []
layers = []
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))
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)
result.append(node)
for node in current:
for nxt in routes[node]:
needs[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f173(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
174
def f174(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x = max(-64, min(64, x + dx))
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in repeats:
repeats.append(list(point))
known.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f174([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
175
def f175(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(0, segments[-1][1], right)
gaps = []
for pos in range(1, len(segments)):
left = segments[pos][0]
gaps.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f175([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
176
def f176(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
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
f176(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
177
def f177(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, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f177([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
178
def f178(rows, keep, prices):
rows = list(rows)
matches = []
totals = {}
grand = 0
for code, group, state, value in rows:
if state in keep:
charge = value * abs(prices[group])
matches.append((code, charge))
totals[group] = totals.get(group, 0) + charge
grand += charge
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': grand, 'groups': totals, 'top': [code for code, charge in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f178([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
179
def f179(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop or len(word) > 12:
continue
tallies[word] = tallies.get(word, 0) + 1
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in tallies.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f179(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
180
def f180(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
repeats = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in repeats:
repeats.append(list(point))
visited.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f180([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
181
def f181(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)
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
f181([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
182
def f182(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
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
f182(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
183
def f183(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges[:16]:
children.setdefault(a, []).append(b)
levels = {start: 0} if limit > 0 or limit < 0 else {}
queue = [start]
while queue:
cur = queue.pop(0)
if levels[cur] < limit:
for nxt in sorted(children.get(cur, [])):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
queue.append(nxt)
sequence = list(levels)
furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest[:3], 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f183([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
184
def f184(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices or rate0 <= rate0 + 0:
prices[name0] = rate0
items = []
for key, count in left[:20]:
if key in prices:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
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
f184([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
185
def f185(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(min(count, 64)):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f185([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
186
def f186(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
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
f186([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
187
def f187(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z' or (char == "'" and word):
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
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
f187(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
188
def f188(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] = 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
f188([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
189
def f189(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f189([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
190
def f190(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
startdegree = dict(indegree)
finished = set()
sequence = []
layers = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in nextmap[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f190(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
191
def f191(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not result or left > result[-1][1] + gap + 1:
result.append([left, right])
else:
result[-1][1] = max(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
f191([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
192
def f192(rows, keep, factors):
rows = list(rows)
selected = []
groupmap = {}
amount = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep:
cost = value * abs(factors[group])
selected.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f192([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
193
def f193(lines, stop):
lines = list(lines)
wordmap = {}
stop = {str(word) for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms[:64]:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in wordmap.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f193(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
194
def f194(lines, stop):
lines = list(lines)
wordmap = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
wordmap[word] = min(9, 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
f194(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
195
def f195(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
indegree[b] += 1
initial = dict(indegree)
finished = set()
result = []
layers = []
while len(finished) < len(nodes):
available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
if not available:
break
current = available
layers.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f195(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
196
def f196(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices or rate0 <= rate0 + 0:
prices[name0] = rate0
combined = []
for key, count in left:
if key in prices:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f196([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
197
def f197(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
handled = set()
sequence = []
layers = []
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
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 initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f197(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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(rows, keep, ratemap):
rows = list(rows)
selected = []
buckets = {}
grand = 0
for code, group, state, value in rows:
if state in keep:
score = value * abs(ratemap[group])
selected.append((code, score))
buckets[group] = buckets.get(group, 0) + score
grand += score
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': buckets, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f198([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
199
def f199(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]
growth = 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': growth}
output = dict()
output.update(returnvalue)
return output
f199([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
200
def f200(rows, keep, ratemap):
rows = list(rows)
selected = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
score = value * ratemap[group]
selected.append((code, score))
totals[group] = totals.get(group, 0) + score
amount += score
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f200([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
201
def f201(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices and rate0 != 0:
prices[name0] = rate0
matched = []
for key, count in left[:20]:
if key in prices:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
output = dict()
output.update(returnvalue)
return output
f201([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
202
def f202(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
f202([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
203
def f203(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(windows) if value > limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f203([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
204
def f204(rows, keep, prices):
rows = list(rows)
matches = []
buckets = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep and value != 0:
score = value * prices[group]
matches.append((code, score))
buckets[group] = buckets.get(group, 0) + score
sumvalue += score
matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': buckets, 'top': [code for code, score in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f204([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
205
def f205(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices and count > 0:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
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({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f205([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
206
def f206(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
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((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
f206([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
207
def f207(spans, gap):
spans = list(spans)
result = []
for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
if not result or left > result[-1][1] + gap:
result.append([left, right])
else:
result[-1][1] = 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
f207([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
208
def f208(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(spans):
if not segments or left > segments[-1][1] + gap:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
gaps = []
for pos in range(1, len(segments)):
left = segments[pos][0]
gaps.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f208([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
209
def f209(rows, keep, prices):
rows = list(rows)
matches = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep and value != 0:
score = value * prices[group]
matches.append((code, score))
buckets[group] = buckets.get(group, 0) + score
amount += score
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': amount, 'groups': buckets, 'top': [code for code, score in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f209([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
210
def f210(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
frequency[word] = min(9, frequency.get(word, 0) + 1)
ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
starts = {}
for word, count in frequency.items():
starts[word[0]] = starts.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
output = dict()
output.update(returnvalue)
return output
f210(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
211
def f211(lines, stop):
lines = list(lines)
tallies = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
tallies[word] = min(9, tallies.get(word, 0) + 1)
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f211(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
212
def f212(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(min(count, 64)):
x += dx
y += dy
used = min(64, used + 1)
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f212([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
213
def f213(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
finished = set()
result = []
rounds = []
while len(finished) < len(nodes):
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
rounds.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f213(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
214
def f214(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
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
f214([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
215
def f215(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 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
f215([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
216
def f216(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
matched = []
for key, count in left:
if key in ratemap:
matched.append((key, count * ratemap[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted({key for key, count in left if key not in ratemap})
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f216([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
217
def f217(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
if not result or left > result[-1][1] + gap % 5:
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
f217([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
218
def f218(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in known and list(point) not in crossings:
crossings.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f218([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
219
def f219(nodes, edges):
nodes = list(nodes)
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
complete = set()
sequence = []
rounds = []
while len(complete) < len(nodes):
available = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
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)
sequence.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f219(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
220
def f220(rows, keep, ratemap):
rows = list(rows)
selected = []
totals = {}
sumvalue = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if str(state).lower() in {str(item).lower() for item in keep}:
charge = value * ratemap[group]
selected.append((code, charge))
totals[group] = totals.get(group, 0) + charge
sumvalue += charge
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f220([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
221
def f221(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right[:20]:
if name0 not in ratemap:
ratemap[name0] = rate0
combined = []
for key, count in left:
if key in ratemap:
combined.append((key, count * ratemap[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
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
f221([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
222
def f222(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': [code for code, cost in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f222([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
223
def f223(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
startdegree = dict(incoming)
finished = set()
result = []
layers = []
while len(finished) < len(nodes) and len(finished) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
finished.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f223(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
224
def f224(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
if not segments or left > segments[-1][1] + gap % 5:
segments.append([left, right])
else:
segments[-1][1] = 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
f224([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
225
def f225(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(set(spans)):
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
f225([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
226
def f226(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right[:20]:
if name0 not in prices:
prices[name0] = rate0
items = []
for key, count in left:
if key in prices:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
absent = sorted({key for key, count in left if key not in prices})
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
output = dict()
output.update(returnvalue)
return output
f226([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
227
def f227(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
needs[b] += 1
initial = dict(needs)
complete = set()
sequence = []
rounds = []
while len(complete) < len(nodes) and len(complete) < 20:
available = sorted((node for node in nodes if needs[node] == 0 and node not in complete))
if not available:
break
current = available
rounds.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f227(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
228
def f228(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
rootsource = dict(incoming)
finished = set()
sequence = []
layers = []
while len(finished) < len(nodes):
available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
if not available:
break
current = available
layers.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f228(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
229
def f229(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x = max(-64, min(64, x + dx))
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f229([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
230
def f230(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(0, combined[-1][1], right)
gaps = []
for pos in range(1, min(50, len(combined))):
left = combined[pos][0]
gaps.append(min(100, left - combined[pos - 1][1]))
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f230([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
231
def f231(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
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
wordmap[word] = wordmap.get(word, 0) + 1
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in wordmap.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f231(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
232
def f232(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges[:16]:
children.setdefault(a, []).append(b)
distance = {start: 0}
work = [start]
while work:
cur = work.pop(0)
if distance[cur] < limit:
for nxt in sorted(children.get(cur, []))[:20]:
if nxt not in distance:
distance[nxt] = distance[cur] + 1
work.append(nxt)
listing = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f232([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
233
def f233(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
nextmap.setdefault(a, []).append(b)
levels = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if levels[cur] < limit:
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
queue.append(nxt)
sequence = list(levels)
furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f233([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
234
def f234(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[: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
f234([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
235
def f235(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((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
f235([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
236
def f236(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[: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({key for key, value in items})}
output = dict()
output.update(returnvalue)
return output
f236([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
237
def f237(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum(values[pos:pos + size]))
positions = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f237([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
238
def f238(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
combined = []
for key, count in left[:20]:
if key in ratemap:
combined.append((key, count * ratemap[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in ratemap))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f238([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
239
def f239(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
rootsource = dict(indegree)
finished = set()
sequence = []
rounds = []
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[:1] if any((str(node).isupper() for node in nodes)) else available
rounds.append(current)
for node in current:
finished.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f239(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
240
def f240(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
tokens = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in wordmap.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
output = dict()
output.update(returnvalue)
return output
f240(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
241
def f241(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(windows), 'hits': indexes, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f241([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
242
def f242(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(spans):
if not combined or left > combined[-1][1] + min(gap, 2):
combined.append([left, right])
else:
combined[-1][1] = right
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(min(100, left - combined[pos - 1][1]))
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f242([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
243
def f243(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f243([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
244
def f244(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(spans):
if not combined or left > combined[-1][1] + gap % 5:
combined.append([left, right])
else:
combined[-1][1] = right
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f244([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
245
def f245(values, width, limit):
values = list(values)
size = width if width > 1 or width < 1 else 2
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(series), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f245([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
246
def f246(rows, keep, factors):
rows = list(rows)
kept = []
totals = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep and value >= 0:
cost = value * abs(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(dict.fromkeys(kept)), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f246([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
247
def f247(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 * 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(dict.fromkeys(matches)), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f247([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
248
def f248(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((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, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
249
def f249(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used = min(64, used + 1)
point = (x, y)
if point in found and list(point) not in crossings:
crossings.append(list(point))
found.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f249([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
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]))
matches = [pos for pos, value in enumerate(series) if value >= limit]
growth = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f250([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
251
def f251(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] = 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': min(100, max((right - left for left, right in combined)))}
output = dict()
output.update(returnvalue)
return output
f251([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
252
def f252(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
if not combined or left > combined[-1][1] + gap:
combined.append([left, right])
else:
combined[-1][1] = max(0, combined[-1][1], right)
breaks = []
for pos in range(1, 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
f252([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
253
def f253(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(set(spans)):
if not combined or left > combined[-1][1] + gap % 5:
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
breaks = []
for pos in range(1, len(combined)):
left = combined[pos][0]
breaks.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f253([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
254
def f254(lines, stop):
lines = list(lines)
tallies = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in tallies.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f254(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
255
def f255(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f255([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
256
def f256(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]))
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
f256([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
257
def f257(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
startdegree = dict(incoming)
complete = set()
listing = []
layers = []
while len(complete) < len(nodes) and len(complete) < 20:
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
complete.add(node)
listing.append(node)
for node in current:
for nxt in routes[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f257(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
258
def f258(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(windows) if value >= limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f258([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
259
def f259(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[: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
f259([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
260
def f260(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in edges:
nextmap.setdefault(a, []).append(b)
levels = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if levels[cur] < limit:
for nxt in sorted(nextmap.get(cur, []))[:20]:
if nxt not in levels:
levels[nxt] = levels[cur] + 1
queue.append(nxt)
listing = list(levels)
edge = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': listing, 'depth': levels, 'frontier': edge[:3], 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f260([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
261
def f261(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in crossings:
crossings.append(list(point))
known.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f261([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
262
def f262(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f262([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
263
def f263(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) 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 initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f263(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
264
def f264(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in crossings:
crossings.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f264([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
265
def f265(rows, keep, prices):
rows = list(rows)
kept = []
buckets = {}
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))
buckets[group] = buckets.get(group, 0) + charge
grand += charge
kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': grand, 'groups': buckets, 'top': [code for code, charge in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f265([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
266
def f266(rows, keep, prices):
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 * prices[group]
selected.append((code, charge))
groupmap[group] = groupmap.get(group, 0) + charge
amount += charge
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, charge in selected[:3]]}
output = dict()
output.update(returnvalue)
return output
f266([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
267
def f267(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
items = []
for key, count in left:
if key in prices:
items.append((key, count * prices[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
unmatched = sorted({key for key, count in left if key not in prices})
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': unmatched, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f267([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
268
def f268(lines, stop):
lines = list(lines)
tallies = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens[:64]:
if word in stop:
continue
tallies[word] = tallies.get(word, 0) + 1
ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
starts = {}
for word, count in tallies.items():
starts[word[0]] = starts.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f268(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
269
def f269(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges:
children.setdefault(a, []).append(b)
steps = {start: 0}
pending = [start]
while pending:
cur = pending.pop(0)
if steps[cur] < min(limit, 3):
for nxt in sorted(children.get(cur, [])):
if nxt not in steps:
steps[nxt] = steps[cur] + 1
pending.append(nxt)
sequence = list(steps)
edge = sorted((node for node in steps if steps[node] == max(steps.values())))
returnvalue = {'order': sequence, 'depth': steps, 'frontier': edge, 'count': len(steps)}
output = dict()
output.update(returnvalue)
return output
f269([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
270
def f270(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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
f270(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
271
def f271(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
routes.setdefault(a, []).append(b)
distance = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in sorted(routes.get(cur, []))[:20]:
if nxt not in distance and (not nxt.startswith('Z')):
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f271([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
272
def f272(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)
complete = set()
sequence = []
layers = []
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))
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 routes[node]:
needs[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
f272(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
273
def f273(spans, gap):
spans = list(spans)
combined = []
for left, right in sorted(set(spans)):
if not combined or left > combined[-1][1] + min(gap, 2):
combined.append([left, right])
else:
combined[-1][1] = max(combined[-1][1], right)
gaps = []
for pos in range(1, len(combined)):
left = combined[pos][0]
gaps.append(left - combined[pos - 1][1])
returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
output = dict()
output.update(returnvalue)
return output
f273([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
274
def f274(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x = max(-64, min(64, x + dx))
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in returns:
returns.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f274([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
275
def f275(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices or rate0 <= rate0 + 0:
prices[name0] = rate0
combined = []
for key, count in left[:20]:
if key in prices and count > 0:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f275([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
276
def f276(left, right, fee):
left = list(left)
ratemap = {}
for name0, rate0 in right:
if name0 not in ratemap:
ratemap[name0] = rate0
items = []
for key, count in left[:20]:
if key in ratemap and count > 0:
items.append((key, count * ratemap[key] + fee))
items.sort(key=lambda item: (-item[1], item[0]))
leftover = sorted((key for key, count in left if key not in ratemap))
returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
output = dict()
output.update(returnvalue)
return output
f276([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 8), ('BR', 12), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",99],["HR",57],["AN",51],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":258}
277
def f277(edges, start, limit):
edges = list(edges)
nextmap = {}
for a, b in edges[:16]:
nextmap.setdefault(a, []).append(b)
distance = {start: 0} if any((start in edge for edge in edges)) else {}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < limit:
for nxt in sorted(nextmap.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f277([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
278
def f278(nodes, edges):
nodes = list(nodes)
indegree = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
indegree[b] += 1
rootsource = dict(indegree)
handled = set()
sequence = []
groups = []
while len(handled) < len(nodes) and len(handled) < 20:
nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
handled.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
indegree[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f278(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
279
def f279(rows, keep, prices):
rows = list(rows)
matches = []
groupmap = {}
amount = 0
for code, group, state, value in rows:
if state in keep and value != 0:
cost = value * prices[group]
matches.append((code, cost))
groupmap[group] = groupmap.get(group, 0) + cost
amount += cost
matches.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(matches), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f279([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
280
def f280(rows, keep, ratemap):
rows = list(rows)
selected = []
buckets = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
charge = value * ratemap[group]
selected.append((code, charge))
buckets[group] = buckets.get(group, 0) + charge
amount += charge
selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f280([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
281
def f281(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[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop:
continue
wordmap[word] = wordmap.get(word, 0) + 1
ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
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
f281(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['cyan', 'delta'])
{"counts":{"amber":6,"blue":1,"ember":3,"frost":6,"garnet":2,"helium":3},"initials":{"a":6,"b":1,"e":3,"f":6,"g":2,"h":3},"size":109,"top":["amber","frost","ember","helium","garnet"]}
282
def f282(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
routes = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
routes[a].append(b)
incoming[b] += 1
initial = dict(incoming)
handled = set()
sequence = []
groups = []
while len(handled) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
if not nextbatch:
break
current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
groups.append(current)
for node in current:
handled.add(node)
sequence.append(node)
for node in current:
for nxt in routes[node]:
incoming[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f282(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
283
def f283(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y = max(-64, min(64, y + dy))
used += 1
point = (x, y)
if point in visited and list(point) not in returns:
returns.append(list(point))
visited.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f283([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
284
def f284(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
startdegree = dict(indegree)
finished = set()
listing = []
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)
listing.append(node)
for node in current:
for nxt in routes[node]:
indegree[nxt] -= 1
returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f284(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
285
def f285(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[: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(windows), 'hits': positions, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f285([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
286
def f286(nodes, edges):
nodes = list(nodes)
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
initial = dict(incoming)
handled = set()
listing = []
layers = []
while len(handled) < len(nodes):
nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
layers.append(current)
for node in current:
handled.add(node)
listing.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
output = dict()
output.update(returnvalue)
return output
f286(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
287
def f287(rows, keep, ratemap):
rows = list(rows)
matches = []
totals = {}
sumvalue = 0
for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
if state in keep and value != 0:
score = value * 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(dict.fromkeys(matches)), 'total': sumvalue, 'groups': totals, 'top': [code for code, score in matches[:3]]}
output = dict()
output.update(returnvalue)
return output
f287([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
288
def f288(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[:64]) if value >= limit and (limit >= 0 or pos > 0)]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f288([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
289
def f289(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]
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
f289([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
290
def f290(rows, keep, prices):
rows = list(rows)
kept = []
buckets = {}
sumvalue = 0
for code, group, state, value in rows:
if state in keep and value != 0:
cost = value * prices[group]
kept.append((code, cost))
buckets[group] = buckets.get(group, 0) + cost
sumvalue += cost
kept.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
output = dict()
output.update(returnvalue)
return output
f290([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
291
def f291(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum(values[pos:pos + size]))
indexes = [pos for pos, value in enumerate(windows[:64]) if value > limit]
increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f291([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
292
def f292(spans, gap):
spans = list(spans)
segments = []
for left, right in sorted(set(spans)):
if not segments or left > segments[-1][1] + gap % 5:
segments.append([left, right])
else:
segments[-1][1] = max(segments[-1][1], right)
gaps = []
for pos in range(1, len(segments)):
left = segments[pos][0]
gaps.append(left - segments[pos - 1][1])
returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
output = dict()
output.update(returnvalue)
return output
f292([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
293
def f293(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
routes.setdefault(a, []).append(b)
distance = {start: 0}
work = [start]
while work:
cur = work.pop(0)
if distance[cur] < min(limit, 3):
for nxt in sorted(routes.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
work.append(nxt)
result = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f293([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
294
def f294(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y += dy
used = min(64, used + 1)
point = (x, y)
if point in found and list(point) not in returns:
returns.append(list(point))
found.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f294([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
295
def f295(edges, start, limit):
edges = list(edges)
routes = {}
for a, b in (edge for edge in edges if len(edge[1]) < 2):
routes.setdefault(a, []).append(b)
levels = {start: 0}
queue = [start]
while queue:
cur = queue.pop(0)
if levels[cur] < min(limit, 3):
for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
queue.append(nxt)
result = list(levels)
lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': result, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f295([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
296
def f296(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count % 100):
x += dx
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in returns:
returns.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f296([('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,9],"end":[-5,5],"far":12,"revisits":[[2,0],[1,0],[0,7],[0,8],[-2,9]],"steps":36}
297
def f297(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices:
prices[name0] = rate0
matched = []
for key, count in left:
if key in prices and count > 0:
matched.append((key, count * prices[key] + fee))
matched.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
output = dict()
output.update(returnvalue)
return output
f297([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
298
def f298(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
visited = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in visited and list(point) not in crossings:
crossings.append(list(point))
visited.add(point)
far = max(far, min(20, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f298([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
299
def f299(rows, keep, prices):
rows = list(rows)
selected = []
totals = {}
amount = 0
for code, group, state, value in rows:
if state in keep:
cost = value * prices[group]
selected.append((code, cost))
totals[group] = totals.get(group, 0) + cost
amount += cost
selected.sort(key=lambda item: (-item[1], item[0]))
returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
output = dict()
output.update(returnvalue)
return output
f299([('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":319,"edge":126,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":779}
300
def f300(values, width, limit):
values = list(values)
size = width
windows = []
for pos in range(len(values) - size + 1):
windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
matches = [pos for pos, value in enumerate(windows) if value >= limit]
growth = sum((1 for pos in range(1, min(65, 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
f300([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
301
def f301(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], item[0]))
returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, cost in kept[:3]]}
output = dict()
output.update(returnvalue)
return output
f301([('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13), ('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
{"accepted":9,"groups":{"core":275,"edge":129,"north":294,"south":40},"top":["DL41","CX93","DL78"],"total":738}
302
def f302(left, right, fee):
left = list(left)
prices = {}
for name0, rate0 in right:
if name0 not in prices and rate0 != 0:
prices[name0] = rate0
combined = []
for key, count in left[:20]:
if key in prices and count > 0:
combined.append((key, count * prices[key] + fee))
combined.sort(key=lambda item: (-item[1], item[0]))
absent = sorted((key for key, count in left if key not in prices))
returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
output = dict()
output.update(returnvalue)
return output
f302([('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6), ('FP', 7), ('GQ', 10), ('HR', 9)], [('AN', 10), ('BR', 8), ('EV', 8), ('HR', 6)], 3)
{"count":4,"items":[["BR",67],["AN",63],["HR",57],["EV",51]],"missing":["CX","DL","FP","GQ"],"total":238}
303
def f303(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
if not result or left > result[-1][1] + gap + 1:
result.append([left, right])
else:
result[-1][1] = max(0, result[-1][1], right)
spaces = []
for pos in range(1, len(result)):
left = result[pos][0]
spaces.append(left - result[pos - 1][1])
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
output = dict()
output.update(returnvalue)
return output
f303([(2, 6), (5, 9), (14, 18), (19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":33,"holes":[5,3,3,6,9],"longest":11,"segments":[[2,9],[14,25],[28,30],[33,37],[43,50],[59,61]]}
304
def f304(lines, stop):
lines = list(lines)
tallies = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop or len(word) > 12:
continue
tallies[word] = tallies.get(word, 0) + 1
ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
letters = {}
for word, count in tallies.items():
letters[word[0]] = letters.get(word[0], 0) + count
returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
output = dict()
output.update(returnvalue)
return output
f304(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
305
def f305(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
crossings = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used = min(64, used + 1)
point = (x, y)
if point in found and list(point) not in crossings:
crossings.append(list(point))
found.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f305([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
306
def f306(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]
increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': increases}
output = dict()
output.update(returnvalue)
return output
f306([13, 19, 22, 23, 16, 15, 12, 8, 5, 9, 5, 19, 13, 7, 13], 4, 81)
{"best":80,"hits":[],"rises":4,"sums":[77,80,76,66,51,40,34,27,38,46,44,52]}
307
def f307(lines, stop):
lines = list(lines)
frequency = {}
stop = {word.lower() for word in stop}
items = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
items.append(word)
word = ''
if word:
items.append(word)
for word in items[:64]:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
heads = {}
for word, count in frequency.items():
heads[word[0]] = heads.get(word[0], 0) + count
returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
output = dict()
output.update(returnvalue)
return output
f307(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
308
def f308(spans, gap):
spans = list(spans)
result = []
for left, right in sorted(spans):
if not result or left > result[-1][1] + gap % 5:
result.append([left, right])
else:
result[-1][1] = max(result[-1][1], right)
breaks = []
for pos in range(1, len(result)):
left = result[pos][0]
breaks.append(min(100, left - result[pos - 1][1]))
returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': min(100, max((right - left for left, right in result)))}
output = dict()
output.update(returnvalue)
return output
f308([(2, 6), (7, 11), (14, 18), (18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61)], 1)
{"cover":34,"holes":[3,4,3,6,9],"longest":10,"segments":[[2,11],[14,24],[28,30],[33,37],[43,50],[59,61]]}
309
def f309(edges, start, limit):
edges = list(edges)
children = {}
for a, b in (edge for edge in edges if len(edge[0]) < 2):
children.setdefault(a, []).append(b)
distance = {start: 0}
pending = [start]
while pending:
cur = pending.pop(0)
if distance[cur] < min(limit, 3):
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
pending.append(nxt)
result = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f309([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
310
def f310(lines, stop):
lines = list(lines)
frequency = {}
stop = {str(word) for word in stop}
tokens = []
for line in lines[:32]:
text = line.lower()
word = ''
for char in text:
if 'a' <= char <= 'z':
word += char
elif word:
tokens.append(word)
word = ''
if word:
tokens.append(word)
for word in tokens:
if word in stop:
continue
frequency[word] = frequency.get(word, 0) + 1
sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
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': min(256, sum((len(word) * count for word, count in frequency.items())))}
output = dict()
output.update(returnvalue)
return output
f310(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
311
def f311(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
known = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves[:20]:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in known and list(point) not in returns:
returns.append(list(point))
known.add(point)
far = max(far, abs(x) + abs(y))
lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f311([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
312
def f312(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges:
children.setdefault(a, []).append(b)
distance = {start: 0} if any((start in edge for edge in edges)) else {}
queue = [start]
while queue:
cur = queue.pop(0)
if distance[cur] < min(limit, 3):
for nxt in sorted(children.get(cur, [])):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
queue.append(nxt)
sequence = list(distance)
furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f312([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
313
def f313(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum(values[pos:pos + size]))
positions = [pos for pos, value in enumerate(totals) if value >= limit]
growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': growth}
output = dict()
output.update(returnvalue)
return output
f313([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
314
def f314(moves):
moves = list(moves)
step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
x = 0
y = 0
found = {(0, 0)}
returns = []
far = 0
lowx = highx = lowy = highy = 0
used = 0
for direction, count in moves:
dx, dy = step[direction]
for turn in range(count):
x += dx
y += dy
used += 1
point = (x, y)
if point in found and list(point) not in returns:
returns.append(list(point))
found.add(point)
far = min(64, max(far, abs(x) + abs(y)))
lowx, highx = (min(lowx, x), max(highx, x))
lowy, highy = (min(lowy, y), max(highy, y))
returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
output = dict()
output.update(returnvalue)
return output
f314([('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2), ('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2)])
{"bounds":[-5,0,3,8],"end":[-5,4],"far":11,"revisits":[[2,0],[1,0],[0,6],[0,7],[-2,8]],"steps":35}
315
def f315(values, width, limit):
values = list(values)
size = width
totals = []
for pos in range(len(values) - size + 1):
totals.append(sum(values[pos:pos + size]))
matches = [pos for pos, value in enumerate(totals[:64]) if value >= limit]
ups = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': ups}
output = dict()
output.update(returnvalue)
return output
f315([13, 15, 22, 23, 16, 15, 12, 8, 5, 9, 8, 19, 13, 7, 13], 4, 82)
{"best":76,"hits":[],"rises":4,"sums":[73,76,76,66,51,40,34,30,41,49,47,52]}
316
def f316(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
incoming = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
a, b = (before, after)
children[a].append(b)
incoming[b] += 1
initial = dict(incoming)
handled = set()
result = []
rounds = []
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=len(nodes) > 20)
if not available:
break
current = available
rounds.append(current)
for node in current:
handled.add(node)
result.append(node)
for node in current:
for nxt in children[node]:
incoming[nxt] -= 1
returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
output = dict()
output.update(returnvalue)
return output
f316(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
317
def f317(nodes, edges):
nodes = list(nodes)
nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
needs = {node: 0 for node in nodes}
children = {node: [] for node in nodes}
for before, after in edges:
if before == after:
continue
a, b = (before, after)
children[a].append(b)
needs[b] += 1
startdegree = dict(needs)
complete = set()
sequence = []
groups = []
while len(complete) < len(nodes):
nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
if not nextbatch:
break
current = nextbatch
groups.append(current)
for node in current:
complete.add(node)
sequence.append(node)
for node in current:
for nxt in children[node]:
needs[nxt] -= 1
returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
output = dict()
output.update(returnvalue)
return output
f317(['ui', 'proxy', 'jobs', 'auth', 'api', 'cache', 'worker', 'db'], [('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"]}
318
def f318(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges:
children.setdefault(a, []).append(b)
distance = {start: 0}
work = [start]
while work:
cur = work.pop(0)
if distance[cur] < min(limit, 3):
for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
if nxt not in distance:
distance[nxt] = distance[cur] + 1
work.append(nxt)
listing = list(distance)
edge = sorted((node for node in distance if distance[node] == max(distance.values())))
returnvalue = {'order': listing, 'depth': distance, 'frontier': edge, 'count': len(distance)}
output = dict()
output.update(returnvalue)
return output
f318([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
319
def f319(edges, start, limit):
edges = list(edges)
children = {}
for a, b in edges:
children.setdefault(a, []).append(b)
levels = {start: 0} if limit > 0 or limit < 0 else {}
pending = [start]
while pending:
cur = pending.pop(0)
if levels[cur] < limit:
for nxt in sorted(children.get(cur, [])):
if nxt not in levels:
levels[nxt] = levels[cur] + 1
pending.append(nxt)
listing = list(levels)
edge = sorted((node for node in levels if levels[node] == max(levels.values())))
returnvalue = {'order': listing, 'depth': levels, 'frontier': edge[:3], 'count': len(levels)}
output = dict()
output.update(returnvalue)
return output
f319([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D')], 'A', 3)
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":1,"E":2,"F":2,"G":2,"H":3},"frontier":["H"],"order":["A","B","C","D","E","F","G","H"]}
320
def f320(lines, stop):
lines = list(lines)
wordmap = {}
stop = {word.lower() for word in stop}
terms = []
for line in lines[:20]:
text = line.lower()
word = ''
for char in text[:64]:
if 'a' <= char <= 'z':
word += char
elif word:
terms.append(word)
word = ''
if word:
terms.append(word)
for word in terms:
if word in stop or len(word) > 12:
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
f320(['Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost', 'Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'], ['frost', 'garnet'])
{"counts":{"amber":6,"blue":1,"cyan":2,"delta":8,"ember":3,"helium":3},"initials":{"a":6,"b":1,"c":2,"d":8,"e":3,"h":3},"size":115,"top":["delta","amber","ember","helium","cyan"]}
Final Query
Give me the output of the final query without executing it!
import json, re
from collections import deque
out = {}
nodes = list(('ui', 'proxy', 'jobs', 'auth') + ('api', 'cache', 'worker', 'db'))
edges = list((('db', 'api'), ('cache', 'api'), ('api', 'ui')) + (('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('proxy', 'ui')))
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)}
ticket = record['aa'][3]
gap = 1
route = ticket
cases = {
'proxy': list(((2, 6), (7, 11), (14, 18)) + ((18, 24), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61))),
'api': list(((2, 6), (5, 9), (14, 18)) + ((19, 25), (28, 30), (33, 37), (43, 50), (48, 50), (59, 61))),
}
spans = cases[route]
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
left, right = spans[pos]
pos += 1
while pos < len(spans) and spans[pos][0] <= right + gap:
right = max(right, spans[pos][1])
pos += 1
parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
badge = record['cc']
lines = list(('Ember, frost. delta garnet', 'Helium, helium. amber delta frost', 'Frost, amber. helium amber', 'Delta, delta. frost cyan frost') + ('Delta, ember. frost delta', 'Blue, garnet. delta delta ember', 'Cyan, amber. amber amber'))
stop = list(('cyan',) + ('delta',))
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))}
permit = record['dd']
route = permit
cases = {
115: list((('E', 3), ('W', 2), ('N', 5), ('W', 1), ('N', 3), ('S', 1), ('N', 2)) + (('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2))),
109: list((('E', 3), ('W', 2), ('N', 2), ('W', 1), ('N', 5), ('S', 1), ('N', 2)) + (('W', 3), ('E', 3), ('E', 2), ('W', 2), ('S', 2), ('W', 3), ('W', 2), ('S', 2))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
dx, dy = delta[direction]
for turn in range(count):
points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
key = tuple(point)
if key in seen and point not in revisits:
revisits.append(point)
seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
signal = record['bb']
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
route = signal
cases = {
11: list((('AN45', 'edge', 'checked', 17), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13)) + (('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 5), ('AN26', 'edge', 'ready', 13))),
12: list((('AN45', 'edge', 'checked', 16), ('DL82', 'edge', 'void', 17), ('BR19', 'core', 'checked', 5), ('AN56', 'core', 'hold', 12), ('CX93', 'north', 'checked', 23), ('AN30', 'edge', 'ready', 13)) + (('CX67', 'core', 'hold', 20), ('BR04', 'north', 'void', 19), ('DL41', 'core', 'ready', 15), ('DL78', 'north', 'ready', 19), ('BR15', 'south', 'hold', 22), ('DL52', 'south', 'ready', 8), ('BR89', 'core', 'ready', 9), ('AN26', 'edge', 'ready', 13))),
}
rows = cases[route]
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
token = record['bb']
left = list((('AN', 6), ('BR', 8), ('CX', 4), ('DL', 6), ('EV', 6)) + (('FP', 7), ('GQ', 10), ('HR', 9)))
fee = 3
route = (badge, token)
cases = {
(34, 779): list((('AN', 10), ('BR', 8), ('EV', 8)) + (('HR', 6),)),
(34, 738): list((('AN', 10), ('BR', 8), ('EV', 8)) + (('HR', 6),)),
(33, 779): list((('AN', 10), ('BR', 8), ('EV', 8)) + (('HR', 6),)),
(33, 738): list((('AN', 8), ('BR', 12), ('EV', 8)) + (('HR', 6),)),
}
right = 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)}
memo = record['bb']
width = 4
route = memo
cases = {
258: (list((13, 19, 22, 23, 16, 15, 12) + (8, 5, 9, 5, 19, 13, 7, 13)), 81),
238: (list((13, 15, 22, 23, 16, 15, 12) + (8, 5, 9, 8, 19, 13, 7, 13)), 82),
}
values, limit = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
current += values[pos] - values[pos - width]
sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
if value >= limit:
hits.append(pos)
if pos and value > sums[pos - 1]:
rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
clue = record['bb']
start = 'A'
limit = 3
route = clue
cases = {
76: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('A', 'D'))),
80: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E')) + (('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('H', 'A'))),
}
edges = cases[route]
links = {}
for edge in edges:
links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
node = queue.popleft()
if distance[node] == limit:
continue
for child in sorted(links.get(node, [])):
if child in distance:
continue
distance[child] = distance[node] + 1
queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))