-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathday4.py
More file actions
67 lines (55 loc) · 1.8 KB
/
day4.py
File metadata and controls
67 lines (55 loc) · 1.8 KB
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
l = []
with open("d4.txt", "r") as fin:
lines = fin.readlines()
for x in lines:
l.append(list(x.strip()))
searchStr = "XMAS"
def dfsSearch(i, j, ind, dirX, dirY):
if (ind >= len(searchStr)):
return 0
if (i < 0 or i >= len(l)):
return 0
elif (j < 0 or j >= len(l[i])):
return 0
elif (l[i][j] == searchStr[ind]):
if (ind == len(searchStr) - 1):
return 1
return dfsSearch(i + dirX, j + dirY, ind + 1, dirX, dirY)
return 0
# part 1
total = 0
for i in range(len(l)):
for j in range(len(l[i])):
total += dfsSearch(i, j, 0, -1, 0) # left
total += dfsSearch(i, j, 0, 1, 0) # right
total += dfsSearch(i, j, 0, 0, -1) # up
total += dfsSearch(i, j, 0, 0, 1) # down
total += dfsSearch(i, j, 0, -1, 1) # left up
total += dfsSearch(i, j, 0, -1, -1) # left down
total += dfsSearch(i, j, 0, 1, 1) # right up
total += dfsSearch(i, j , 0, 1, -1) # right down
print(total)
# part 2
def verifyX_MAS(i, j):
if (i < 1 or i >= len(l) - 1):
return 0
elif (j < 1 or j >= len(l[i]) - 1):
return 0
elif (l[i][j] == "A"):
if (l[i - 1][j + 1] == "M" and l[i + 1][j - 1] == "S"):
if (l[i - 1][j - 1] == "M" and l[i + 1][j + 1] == "S"):
return 1
elif (l[i - 1][j - 1] == "S" and l[i + 1][j + 1] == "M"):
return 1
elif (l[i - 1][j + 1] == "S" and l[i + 1][j - 1] == "M"):
if (l[i - 1][j - 1] == "M" and l[i + 1][j + 1] == "S"):
return 1
elif (l[i - 1][j - 1] == "S" and l[i + 1][j + 1] == "M"):
return 1
return 0
# part 2
total2 = 0
for i in range(len(l)):
for j in range(len(l[i])):
total2 += verifyX_MAS(i, j)
print(total2)