-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay8_part1.py
72 lines (71 loc) · 2.26 KB
/
Day8_part1.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
import pandas as pd
File = open("Day_8_Input.txt", "r")
Lines = File.readlines()
width = len(Lines[0].strip())
height = len(Lines)
DF = pd.DataFrame()
for i in range(0,len(Lines[0])-1):
list = []
for j in range(0,len(Lines)):
list.append(int(Lines[j][i]))
DF[i]=list
print(DF)
def CheckVisibility(row,column):
print("row, column =", row,column)
Visible = False
#Up
if all(item < DF[column][row] for item in DF.iloc[0:row,column].values.tolist()):
# print("up")
# print('Tree is visible')
# print(DF[column][row])
# print(DF.iloc[0:row,column].values.tolist())
Visible = True
# else:
# print("up")
# print('Tree is not visible')
# print(DF[column][row])
# print(DF.iloc[0:row,column].values.tolist())
#Down
if all(item < DF[column][row] for item in DF.iloc[row+1:,column].values.tolist()):
# print("down")
# print('Tree is visible')
# print(DF[column][row])
# print(DF.iloc[row+1:,column].values.tolist())
Visible = True
# else:
# print("down")
# print('Tree is not visible')
# print(DF[column][row])
# print(DF.iloc[row+1:,column].values.tolist())
#Left
if all(item < DF[column][row] for item in DF.iloc[row,0:column].values.tolist()):
# print('Tree is visible')
# print("left")
# print(DF[column][row])
# print(DF.iloc[row,0:column].values.tolist())
Visible = True
# else:
# print("left")
# print('Tree is not visible')
# print(DF[column][row])
# print(DF.iloc[row,0:column].values.tolist())
#Right
if all(item < DF[column][row] for item in DF.iloc[row,column+1:].values.tolist()):
# print('Tree is visible')
# print("right")
# print(DF[column][row])
# print(DF.iloc[row,column+1:].values.tolist())
Visible = True
# else:
# print("right")
# print('Tree is not visible')
# print(DF[column][row])
# print(DF.iloc[row,column+1:].values.tolist())
return Visible
ans = 0
for k in range(1,len(Lines)-1):
for l in range(1,len(Lines[k].strip())-1):
if CheckVisibility(k,l) == True:
print("+1")
ans += 1
print(ans)