05: Python: Faster
This commit is contained in:
parent
5c8be75eee
commit
cbb0c57d81
|
@ -14,16 +14,16 @@ for l in sys.stdin:
|
||||||
for i, c in enumerate(l[1::4], 1):
|
for i, c in enumerate(l[1::4], 1):
|
||||||
if c != ' ':
|
if c != ' ':
|
||||||
c = ord(c)
|
c = ord(c)
|
||||||
stacksA[i].append(c)
|
stacksA[i].insert(0, c)
|
||||||
stacksB[i].append(c)
|
stacksB[i].insert(0, c)
|
||||||
|
|
||||||
im = insr.match(l)
|
im = insr.match(l)
|
||||||
if im:
|
if im:
|
||||||
n, f, t = map(int, im.groups())
|
n, f, t = map(int, im.groups())
|
||||||
stacksA[t] = bytearray(reversed(stacksA[f][:n])) + stacksA[t]
|
stacksA[t] += stacksA[f][-n:][::-1]
|
||||||
stacksA[f] = stacksA[f][n:]
|
stacksA[f] = stacksA[f][:-n]
|
||||||
stacksB[t] = stacksB[f][:n] + stacksB[t]
|
stacksB[t] += stacksB[f][-n:]
|
||||||
stacksB[f] = stacksB[f][n:]
|
stacksB[f] = stacksB[f][:-n]
|
||||||
|
|
||||||
print(f"""Silver: {"".join(chr(stacksA[i][0]) for i in sorted(stacksA))}
|
print(f"""Silver: {"".join(chr(stacksA[i][-1]) for i in sorted(stacksA))}
|
||||||
Gold: {"".join(chr(stacksB[i][0]) for i in sorted(stacksB))}""")
|
Gold: {"".join(chr(stacksB[i][-1]) for i in sorted(stacksB))}""")
|
||||||
|
|
Loading…
Reference in New Issue