+/AoC

advent of code

git clone https://git.julia.blue/+/AoC

Joseph RyanStart 2018!38c0746

master
1.0 KiB35 linesraw
1raw = "hwlqcszp"
2length = 256
3board = []
4for q in range(128):
5    knot = range(length)
6    skip = 0
7    current = 0
8    for n in range(64):
9        for i in map(ord, raw + '-' + str(q)) + [17, 31, 73, 47, 23]:
10            for j in range(i // 2):
11                front = (current + j) % length
12                back = (current + i - j - 1) % length
13                knot[front], knot[back] = knot[back], knot[front]
14            current += i + skip
15            skip += 1
16    board.append(reduce(lambda x, y: x + y, [map(int, bin(i)[2:].zfill(8)) for i in [reduce(lambda x, y: x ^ y, knot[i * 16:(i + 1) * 16]) for i in range(16)]]))
17
18print "Part 1:", sum(i.count(1) for i in board)
19
20
21def explore(x, y):
22    board[x][y] = 0
23    for i in range(-1, 2):
24        for j in range(-1, 2):
25            if (j == 0 or i == 0) and 0 <= x + i < 128 and 0 <= y + j < 128 and board[x + i][y + j]:
26                explore(x + i, y + j)
27
28total = 0
29for i in range(128):
30    for j in range(128):
31        if board[i][j]:
32            total += 1
33            explore(i, j)
34
35print "Part 2:", total