-
Notifications
You must be signed in to change notification settings - Fork 0
/
day3p2-attempt2.py
195 lines (176 loc) · 7.25 KB
/
day3p2-attempt2.py
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
import re
from array import *
'''--- Day 3: Toboggan Trajectory ---
With the toboggan login problems resolved, you set off toward the airport. While travel by toboggan might be easy, it's certainly not safe: there's very minimal steering and the area is covered in trees. You'll need to see which angles will take you near the fewest trees.
Due to the local geology, trees in this area only grow on exact integer coordinates in a grid. You make a map (your puzzle test) of the open squares (.) and trees (#) you can see. For example:
..##.......
#...#...#..
.#....#..#.
..#.#...#.#
.#...##..#.
..#.##.....
.#.#.#....#
.#........#
#.##...#...
#...##....#
.#..#...#.#
These aren't the only trees, though; due to something you read about once involving arboreal genetics and biome stability, the same pattern repeats to the right many times:
..##.........##.........##.........##.........##.........##....... --->
#...#...#..#...#...#..#...#...#..#...#...#..#...#...#..#...#...#..
.#....#..#..#....#..#..#....#..#..#....#..#..#....#..#..#....#..#.
..#.#...#.#..#.#...#.#..#.#...#.#..#.#...#.#..#.#...#.#..#.#...#.#
.#...##..#..#...##..#..#...##..#..#...##..#..#...##..#..#...##..#.
..#.##.......#.##.......#.##.......#.##.......#.##.......#.##..... --->
.#.#.#....#.#.#.#....#.#.#.#....#.#.#.#....#.#.#.#....#.#.#.#....#
.#........#.#........#.#........#.#........#.#........#.#........#
#.##...#...#.##...#...#.##...#...#.##...#...#.##...#...#.##...#...
#...##....##...##....##...##....##...##....##...##....##...##....#
.#..#...#.#.#..#...#.#.#..#...#.#.#..#...#.#.#..#...#.#.#..#...#.# --->
You start on the open square (.) in the top-left corner and need to reach the bottom (below the bottom-most row on your map).
The toboggan can only follow a few specific slopes (you opted for a cheaper model that prefers rational numbers); start by counting all the trees you would encounter for the slope right 3, down 1:
From your starting position at the top-left, check the position that is right 3 and down 1. Then, check the position that is right 3 and down 1 from there, and so on until you go past the bottom of the map.
The locations you'd check in the above example are marked here with O where there was an open square and X where there was a tree:
..##.........##.........##.........##.........##.........##....... --->
#..O#...#..#...#...#..#...#...#..#...#...#..#...#...#..#...#...#..
.#....X..#..#....#..#..#....#..#..#....#..#..#....#..#..#....#..#.
..#.#...#O#..#.#...#.#..#.#...#.#..#.#...#.#..#.#...#.#..#.#...#.#
.#...##..#..X...##..#..#...##..#..#...##..#..#...##..#..#...##..#.
..#.##.......#.X#.......#.##.......#.##.......#.##.......#.##..... --->
.#.#.#....#.#.#.#.O..#.#.#.#....#.#.#.#....#.#.#.#....#.#.#.#....#
.#........#.#........X.#........#.#........#.#........#.#........#
#.##...#...#.##...#...#.X#...#...#.##...#...#.##...#...#.##...#...
#...##....##...##....##...#X....##...##....##...##....##...##....#
.#..#...#.#.#..#...#.#.#..#...X.#.#..#...#.#.#..#...#.#.#..#...#.# --->
In this example, traversing the map using this slope would cause you to encounter 7 trees.
Starting at the top-left corner of your map and following a slope of right 3 and down 1, how many trees would you encounter?'''
#is this one we will start with the sample test which results in 7 trees hit, then we will use the real test
def growArray(input, slope):
for i in range(0,len(input)):
slope[i]=slope[i]+input[i]
def checkNext(slope, addx, addy):
global locationy, locationx, pathx, pathy
## print("checknext: addx")
## print(addx)
## print("checknext: addy")
## print(addy)
## print("checknext: locationx")
## print(locationx)
## print("checknext: locationy")
## print(locationy)
## print("checknext: slopelen[1]")
## print(len(slope[1]))
## print("checknext: slopelen")
## print(len(slope))
#trying to remove y from this to simplify
if (locationx + addx) <= len(slope[1])-1 and locationy + addy <= len(slope)-1:
#print("posx is " + str(posx))
#print("slope is " + str(len(slope[1])) + " wide")
return 0
if (locationx + addx) <= len(slope[1])-1 and locationy + addy >= len(slope)-1:
# #print (locationy)
# #print (addy)
# #print (len(slope))
pathy - 1
return 0
else:
return 1
def move(slope,addx,addy):
global locationy,locationx,trees,bottom
#print("pos is [" + str(locationx) + "][" + str(locationy) + "]")
# print("pos is [" + str(locationx) + "][" + str(locationy) + "]")
#print(locationy)
#print(len(slope))
#print(locationx)
#print(len(slope[1]))
if locationy == len(slope)-1:
#print("YOU WIN")
#print(trees)
# print("locationy is " + str(locationy))
# print("locationx is " + str(locationx))
# print("slope is + " )
# print(len(slope))
bottom=1
if slope[locationy][locationx] == "#":
trees=trees+1
#print("TREEEEEEEE oof!")
locationy = locationy+addy
locationx = locationx+addx
else:
#print("dirt")
locationy = locationy+addy
locationx = locationx+addx
elif locationy == len(slope):
print("this is gametime")
else:
if slope[locationy][locationx] == "#":
trees=trees+1
#print("TREEEEEEEE oof!")
locationy = locationy+addy
locationx = locationx+addx
else:
#print("dirt")
locationy = locationy+addy
locationx = locationx+addx
def checkSlope(pathx,pathy):
# print(str(pathx) + " x " + str(pathy))
global locationx, locationy
while bottom==0:
if checkNext(slope,pathx,pathy) == 0:
# print(locationy)
move(slope,pathx,pathy)
# print(locationy)
else:
# print ("growing array")
growArray(input,slope)
# print(str(len(slope)) + " x " + str(len(slope[1])))
return trees
#file=open("day3-input.sample","r")
file=open("day3-input","r")
#this re regular expression removes the /n or whatever
input=re.findall(r"\S+",file.read())
file.close()
slope=input.copy()
#we may need to kind of do an 3d array and then maybe a method to grow the array if you reach the edge
#growArray(input,slope)
locationx=0
locationy=0
pathx=0
pathy=0
#for i in slope:
# print(i)
bottom = 0
trees = 0
#print("below should be 2 trees")
slope1=checkSlope(1,1)
print("hit trees: " + str(trees))
locationx=0
locationy=0
bottom = 0
trees = 0
#print("below should be 7 trees")
slope2=checkSlope(3,1)
print("hit trees: " + str(trees))
locationx=0
locationy=0
bottom = 0
trees = 0
#print("below should be 3 trees")
slope3=checkSlope(5,1)
print("hit trees: " + str(trees))
locationx=0
locationy=0
bottom = 0
trees = 0
#print("below should be 4 trees")
slope4=checkSlope(7,1)
print("hit trees: " + str(trees))
locationx=0
locationy=0
bottom = 0
trees = 0
#print("below should be 2 trees")
slope5=checkSlope(1,2)
print("hit trees: " + str(trees))
print("multiplies to:")
print(slope1 * slope2 * slope3 * slope4 * slope5)
#print("answer is :" + str(slope5 * slope4 * slope3 * slope2 * slope1))