aboutsummaryrefslogtreecommitdiff
path: root/2023/14/solve.py
blob: cedaf8f24a27247df8d7a140e5e7d93343c5f9ea (plain) (blame)
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
L = [l.strip() for l in open("input").readlines()]


def tilt(mp, d):
    transposed = d == 0 or d == 2
    if transposed:  # north or south
        mp = list(map(list, zip(*mp)))

    pat = ".O" if d == 0 or d == 1 else "O."

    done = False
    while not done:
        done = True
        for l in mp:
            for i in range(len(l) - 1):
                if f"{l[i]}{l[i+1]}" != pat:
                    continue
                l[i + 1], l[i] = l[i], l[i + 1]
                done = False

    if transposed:  # north or south
        mp = list(map(list, zip(*mp)))

    return mp


def part1():
    res = 0

    mp = tilt(L, 0)

    for i, l in enumerate(mp):
        res += (len(mp) - i) * l.count("O")
    print(res)


def part2():
    res = 0

    mp = L
    for i in range(100):
        mp = tilt(mp, 0)
        mp = tilt(mp, 1)
        mp = tilt(mp, 2)
        mp = tilt(mp, 3)

    res = 0
    for j, l in enumerate(mp):
        res += (len(mp) - j) * l.count("O")
    print(res)


part1()
part2()