89 lines
2.3 KiB
Python
89 lines
2.3 KiB
Python
a = []
|
|
ff = open('../matrix.txt', 'r')
|
|
for i in ff.readlines():
|
|
tmp = i.split(',')
|
|
for j in xrange(len(tmp)):
|
|
tmp[j] = int(tmp[j])
|
|
a.append(tmp)
|
|
ff.close()
|
|
|
|
n = len(a)
|
|
|
|
path = []
|
|
for i in xrange(n):
|
|
path.append([a[i][-1] + a[i][-2], []])
|
|
|
|
for j in xrange(n - 3, -1, -1):
|
|
#newpath = [a[0][j] + min(path[0][0], a[1][j] + path[1][0])]
|
|
if path[0][0] <= a[1][j] + path[1][0]:
|
|
tmp = path[0][1] + [(0, j)]
|
|
newpath.append([path[0][0] + a[0][j], tmp])
|
|
else:
|
|
tmp = path[1][1] + [(1, j), (0, j)]
|
|
newpath.append([path[1][0] + a[1][j] + a[0][j], tmp])
|
|
for i in xrange(1, n - 1):
|
|
better = min(a[i - 1][j] + path[i - 1][0], path[i][0], a[i + 1][j] + path[i + 1][0])
|
|
#newpath.append(a[i][j] + better)
|
|
if better == path[i][0]:
|
|
tmp = path[i][1] + [(i, j)]
|
|
newpath.append([path[i][0] + a[i][j], tmp])
|
|
elif better == a[i - 1][j] + path[i - 1][0]:
|
|
tmp = path[i - 1][1] + [(i - 1, j), (i, j)]
|
|
newpath.append([])
|
|
#newpath.append(a[-1][j] + min(path[-1], a[-2][j] + path[-2]))
|
|
if path[-1][0] <= a[-2][j] + path[-2][0]:
|
|
tmp = path[-1][1] + [(n - 1, j)]
|
|
newpath.append([a[-1][j] + path[-1][0], tmp])
|
|
else:
|
|
tmp = path[-1][1] + [(n - 2, j), (n - 1, j)]
|
|
newpath.append([a[-1][j] + a[-2][j] + path[-2][0], tmp])
|
|
path = newpath
|
|
|
|
|
|
print sorted(path)
|
|
|
|
'''
|
|
|
|
path = []
|
|
for i in xrange(n):
|
|
path.append([a[i][0], [[i, 0]]])
|
|
|
|
|
|
for y in xrange(1, n):
|
|
pathtmp = []
|
|
for x in xrange(n):
|
|
tmp = [[0, 0]]
|
|
#papapa = 0
|
|
if x - 1 >= 0:
|
|
if a[x - 1][y] < a[x][y - 1]:
|
|
tmp.append([a[x - 1][y], -1, [x - 1, y]])
|
|
path[x] =
|
|
else:
|
|
if not [x, y - 1] in path[x - 1][1]:
|
|
tmp.append([a[x][y - 1], -1, [x, y - 1]])
|
|
#else:
|
|
#papapa += 1
|
|
if x + 1 < n:
|
|
if a[x + 1][y] < a[x][y - 1]:
|
|
tmp.append([a[x + 1][y], 1, [x + 1, y]])
|
|
else:
|
|
if not [x, y - 1] in path[x + 1][1]:
|
|
tmp.append([a[x][y - 1], 1, [x, y - 1]])
|
|
#else:
|
|
#papapa += 2
|
|
for item in tmp:
|
|
item[0] += path[x + item[1]][0]
|
|
tmp.sort()
|
|
#if papapa != 0:
|
|
#print papapa, "**", tmp
|
|
if len(tmp[0]) > 2:
|
|
last = [tmp[0][-1], [x, y]]
|
|
else:
|
|
last = [[x, y]]
|
|
pathtmp.append([tmp[0][0] + a[x][y], path[x + tmp[0][1]][1] + last])
|
|
path = pathtmp
|
|
|
|
path.sort()
|
|
print path[0]
|
|
'''
|