Advent of Code 2016

--- Day 19: An Elephant Named Joseph --- The Elves contact you over a highly secure emergency channel. Back at the North Pole, the Elves are busy misunderstanding White Elephant parties. Each Elf brings a present. They all sit in a circle, numbered starting with position 1. Then, starting with the first Elf, they take turns stealing all the presents from the Elf to their left. An Elf with no presents is removed from the circle and does not take turns. For example, with five Elves (numbered 1 to 5): 1 5 2 4 3 - Elf 1 takes Elf 2's present. - Elf 2 has no presents and is skipped. - Elf 3 takes Elf 4's present. - Elf 4 has no presents and is also skipped. - Elf 5 takes Elf 1's two presents. - Neither Elf 1 nor Elf 2 have any presents, so both are skipped. - Elf 3 takes Elf 5's three presents. So, with five Elves, the Elf that sits starting in position 3 gets all the presents. With the number of Elves given in your puzzle input, which Elf gets all the presents? Your puzzle input is 3005290.



In [1]:

    
def white_elephant_recursive(d={}, i=0, elves=None):
    if elves:
        d = {e: 1 for e in range(elves)}
    if d[i] == 0:
        print('skip', i + 1)
        return white_elephant_recursive(d, (i + 1) % len(d))
    for j in range(1, len(d)):
        if d[(i + j) % len(d)] > 0:
            d[i] += d[(i + j) % len(d)]
            d[(i + j) % len(d)] = 0
            print(i + 1, 'stole from', (i + j) % len(d) + 1)
            return white_elephant_recursive(d, (i + 1) % len(d))
    return [k + 1 for k, v in d.items() if v > 0][0]



In [2]:

    
# Test
assert white_elephant_recursive(elves=5) == 3









    



1 stole from 2
skip 2
3 stole from 4
skip 4
5 stole from 1
skip 1
skip 2
3 stole from 5
skip 4
skip 5
skip 1
skip 2



In [3]:

    
def white_elephant(elves, verbose=False):
    d = {e: 1 for e in range(elves)}
    while len([v for v in d.values() if v > 0]) > 1:
        for i in range(elves):
            if d[i] == 0:
                if verbose:
                    print('skip', i + 1)
                continue
            for j in range(1, len(d)):
                if d[(i + j) % len(d)] > 0:
                    d[i] += d[(i + j) % len(d)]
                    d[(i + j) % len(d)] = 0
                    if verbose:
                        print(i + 1, 'stole from', (i + j) % len(d) + 1)
                    break
    return [k + 1 for k, v in d.items() if v > 0][0]



In [4]:

    
assert white_elephant(elves=5, verbose=True) == 3









    



1 stole from 2
skip 2
3 stole from 4
skip 4
5 stole from 1
skip 1
skip 2
3 stole from 5
skip 4
skip 5



In [5]:

    
white_elephant(elves=3005290)









    Out[5]:





1816277

--- Part Two --- Realizing the folly of their present-exchange rules, the Elves agree to instead steal presents from the Elf directly across the circle. If two Elves are across the circle, the one on the left (from the perspective of the stealer) is stolen from. The other rules remain unchanged: Elves with no presents are removed from the circle entirely, and the other elves move in slightly to keep the circle evenly spaced. For example, with five Elves (again numbered 1 to 5): The Elves sit in a circle; Elf 1 goes first: 1 5 2 4 3 Elves 3 and 4 are across the circle; Elf 3's present is stolen, being the one to the left. Elf 3 leaves the circle, and the rest of the Elves move in: 1 1 5 2 --> 5 2 4 - 4 Elf 2 steals from the Elf directly across the circle, Elf 5: - 2 --> 2 4 4 Next is Elf 4 who, choosing between Elves 1 and 2, steals from Elf 1: - 2 2 --> 4 4 Finally, Elf 2 steals from Elf 4: 2 --> 2 - So, with five Elves, the Elf that sits starting in position 2 gets all the presents. With the number of Elves given in your puzzle input, which Elf now gets all the presents?



In [6]:

    
from tqdm import tqdm



In [7]:

    
class WhiteElephant:
    
    def __init__(self, elves):
        self.elves = elves
        self.players = list(range(elves))
        self.distance = elves / 2
        
    def solve(self):
        p = 0
        for _ in tqdm(range(self.elves - 1)):
            index_to_remove = (p + int(self.distance)) % len(self.players)
            self.players.pop(index_to_remove)
            if p < index_to_remove:
                p += 1
            p = p % len(self.players)
            self.distance -= 0.5
        return self.players[0] + 1



In [8]:

    
# Test
obj = WhiteElephant(5)
assert obj.solve() == 2









    



  0%|          | 0/4 [00:00<?, ?it/s]100%|██████████| 4/4 [00:00<00:00, 28679.00it/s]



In [9]:

    
obj = WhiteElephant(3005290)
obj.solve()









    



100%|██████████| 3005289/3005289 [21:14<00:00, 2358.44it/s]  8/3005289 [00:00<1:04:58, 770.82it/s] 33%|███▎      | 1001774/3005289 [07:00<14:00, 2382.42it/s]






    Out[9]:





1410967