-
Notifications
You must be signed in to change notification settings - Fork 0
/
p083.py
62 lines (45 loc) · 1.67 KB
/
p083.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
import copy
def improvedResult(x, y):
res = False
if x > 0:
if shortestPaths[x - 1][y] + matrix[x][y] < shortestPaths[x][y]:
shortestPaths[x][y] = shortestPaths[x - 1][y] + matrix[x][y]
res = True
if y < len(shortestPaths[0]) - 1:
if shortestPaths[x][y + 1] + matrix[x][y] < shortestPaths[x][y]:
shortestPaths[x][y] = shortestPaths[x][y + 1] + matrix[x][y]
res = True
if y > 0:
if shortestPaths[x][y - 1] + matrix[x][y] < shortestPaths[x][y]:
shortestPaths[x][y] = shortestPaths[x][y - 1] + matrix[x][y]
res = True
if x < len(shortestPaths) - 1:
if shortestPaths[x + 1][y] + matrix[x][y] < shortestPaths[x][y]:
shortestPaths[x][y] = shortestPaths[x + 1][y] + matrix[x][y]
res = True
return res
#example solution should be: 2297
matrix = []
# read file and store it in matrix
with open("./p083_matrix.txt") as f:
content = f.readlines()
for line in content:
val = line.split(",")
for i in range(0, len(val)):
val[i] = int(val[i])
matrix.append(val)
shortestPaths = copy.deepcopy(matrix)
# set shortest paths to 1000000, except for the start cell
for i in range(0, len(shortestPaths)):
for j in range(0, len(shortestPaths[0])):
if i == 0 and j == 0:
continue
shortestPaths[i][j] = 1000000
somethingChanged = True
while somethingChanged:
somethingChanged = False
for i in range(0, len(shortestPaths)):
for j in range(0, len(shortestPaths[0])):
somethingChanged = somethingChanged or improvedResult(i, j)
print(shortestPaths)
print(matrix)