Submission #1583653

---

Source Code Expand

import itertools

inf = 10 ** 12

n, m, r = map(int, input().split())
n += 1
rl = [int(i) for i in input().split()]
d = [[inf for _ in[0]*n] for _ in[0]*n]

for _ in[0]*m:
    f, t, c = map(int, input().split())
    d[f][t], d[t][f] = c, c

for i in range(n):
    for j in range(n):
        for k in range(n):
            d[j][k] = min(d[j][k], d[j][i] + d[i][k])

ans = inf
for arr in itertools.permutations(rl):
    ans = min(ans, sum([d[arr[i]][arr[i+1]] for i in range(0, r-1)]))
print(ans)

Submission Info

Judge Result