aoc

Advent of Code
git clone https://git.pngu.org/aoc
Log | Files | Refs | README

4_2024.py (3435B)

  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
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
import sys
from pyperclip import copy

input = "data/4_2024.txt"
data = open(input).read().strip()
lines = data.split("\n")
sys.setrecursionlimit(10**6)
p1, p2 = 0, 0
rows = len(lines)
cols = len(lines[0])


for r in range(rows):
    for c in range(cols):
        if (
            c + 3 < cols
            and lines[r][c] == "X"
            and lines[r][c + 1] == "M"
            and lines[r][c + 2] == "A"
            and lines[r][c + 3] == "S"
        ):
            p1 += 1
        if (
            r + 3 < rows
            and lines[r][c] == "X"
            and lines[r + 1][c] == "M"
            and lines[r + 2][c] == "A"
            and lines[r + 3][c] == "S"
        ):
            p1 += 1
        if (
            r + 3 < rows
            and c + 3 < cols
            and lines[r][c] == "X"
            and lines[r + 1][c + 1] == "M"
            and lines[r + 2][c + 2] == "A"
            and lines[r + 3][c + 3] == "S"
        ):
            p1 += 1
        if (
            c + 3 < cols
            and lines[r][c] == "S"
            and lines[r][c + 1] == "A"
            and lines[r][c + 2] == "M"
            and lines[r][c + 3] == "X"
        ):
            p1 += 1
        if (
            r + 3 < rows
            and lines[r][c] == "S"
            and lines[r + 1][c] == "A"
            and lines[r + 2][c] == "M"
            and lines[r + 3][c] == "X"
        ):
            p1 += 1
        if (
            r + 3 < rows
            and c + 3 < cols
            and lines[r][c] == "S"
            and lines[r + 1][c + 1] == "A"
            and lines[r + 2][c + 2] == "M"
            and lines[r + 3][c + 3] == "X"
        ):
            p1 += 1
        if (
            r - 3 >= 0
            and c + 3 < cols
            and lines[r][c] == "S"
            and lines[r - 1][c + 1] == "A"
            and lines[r - 2][c + 2] == "M"
            and lines[r - 3][c + 3] == "X"
        ):
            p1 += 1
        if (
            r - 3 >= 0
            and c + 3 < cols
            and lines[r][c] == "X"
            and lines[r - 1][c + 1] == "M"
            and lines[r - 2][c + 2] == "A"
            and lines[r - 3][c + 3] == "S"
        ):
            p1 += 1
        if (
            r + 2 < rows
            and c + 2 < cols
            and lines[r][c] == "M"
            and lines[r + 1][c + 1] == "A"
            and lines[r + 2][c + 2] == "S"
            and lines[r + 2][c] == "M"
            and lines[r][c + 2] == "S"
        ):
            p2 += 1
        if (
            r + 2 < rows
            and c + 2 < cols
            and lines[r][c] == "M"
            and lines[r + 1][c + 1] == "A"
            and lines[r + 2][c + 2] == "S"
            and lines[r + 2][c] == "S"
            and lines[r][c + 2] == "M"
        ):
            p2 += 1
        if (
            r + 2 < rows
            and c + 2 < cols
            and lines[r][c] == "S"
            and lines[r + 1][c + 1] == "A"
            and lines[r + 2][c + 2] == "M"
            and lines[r + 2][c] == "M"
            and lines[r][c + 2] == "S"
        ):
            p2 += 1
        if (
            r + 2 < rows
            and c + 2 < cols
            and lines[r][c] == "S"
            and lines[r + 1][c + 1] == "A"
            and lines[r + 2][c + 2] == "M"
            and lines[r + 2][c] == "S"
            and lines[r][c + 2] == "M"
        ):
            p2 += 1


def solve(s):
    print(s)
    copy(s)


solve(p1)
solve(p2)