advent_2022/day_5.py at main · language-shprt/advent_2022 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
"""
After the rearrangement procedure completes, what crate ends up on top of each stack?
"""

piles_of_crates = [['S','L','W'],['J','T','N','Q'],['S','C','H','F','J'],['T','R','M','W','N','G','B'],['T','R','L','S','D','H','Q','B'],['M','J','B','V','F','H','R','L'],['D','W','R','N','J','M'],['B','Z','T','F','H','N','D','J'],['H','L','Q','N','B','F','T']]

with open('day_5_input.txt', encoding='utf-8') as input_data:
    rearranging_procedure = input_data.readlines()

rearranging_procedure = [step.replace('move','').replace('from','').replace('to','').replace('\n','') for step in rearranging_procedure]

# Part 1

def using_crate_mover_9000(piles_of_crates, rearranging_procedure):
    for step in rearranging_procedure:
        step = step.split(' ')
        step = [step[1], step[3], step[5]]
        number_of_crates = int(step[0])
        from_where = int(step[1])-1
        to_where = int(step[2])-1
        for i in range(number_of_crates): # do it how many times
            moving_crate = piles_of_crates[from_where].pop()
            piles_of_crates[to_where].append(moving_crate)
    return piles_of_crates

def finding_top_crates(piles_of_crates):
    top_crates = ''
    for pile in piles_of_crates:
        top_crate = pile[-1]
        top_crates = top_crates + top_crate
    return top_crates

piles_after_rearrangement = using_crate_mover_9000(piles_of_crates, rearranging_procedure)
print(finding_top_crates(piles_after_rearrangement))

#Part 2

"""
Moved crates stay in the same order.
"""

piles_of_crates = [['S','L','W'],['J','T','N','Q'],['S','C','H','F','J'],['T','R','M','W','N','G','B'],['T','R','L','S','D','H','Q','B'],['M','J','B','V','F','H','R','L'],['D','W','R','N','J','M'],['B','Z','T','F','H','N','D','J'],['H','L','Q','N','B','F','T']]

def using_crate_mover_9001(piles_of_crates, rearranging_procedure):
    for step in rearranging_procedure:
        step = step.split(' ')
        step = [step[1], step[3], step[5]]
        number_of_crates = int(step[0])
        from_where = int(step[1])-1
        to_where = int(step[2])-1
        moving_crates = piles_of_crates[from_where][-number_of_crates:]
        piles_of_crates[to_where] = piles_of_crates[to_where] + moving_crates
        piles_of_crates[from_where] = piles_of_crates[from_where][:-number_of_crates]
    return piles_of_crates

piles_after_rearrangement = using_crate_mover_9001(piles_of_crates, rearranging_procedure)
print(finding_top_crates(piles_after_rearrangement))