Submission #57760905

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from itertools import permutations
n = int(input())
G = [[0] * n for _ in range(n)]
H = [[0] * n for _ in range(n)]
mg = int(input())
for _ in range(mg):
    u, v = [int(x) - 1 for x in input().split()]
    G[u][v] = 1
    G[v][u] = 1
mh = int(input())
for _ in range(mh):
    u, v = [int(x) - 1 for x in input().split()]
    H[u][v] = 1
    H[v][u] = 1
cost = [[0] * n for _ in range(n)]
for i in range(n - 1):
    lst = list(map(int, input().split()))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from itertools import permutations

n = int(input())
G = [[0] * n for _ in range(n)]
H = [[0] * n for _ in range(n)]

mg = int(input())
for _ in range(mg):
    u, v = [int(x) - 1 for x in input().split()]
    G[u][v] = 1
    G[v][u] = 1

mh = int(input())
for _ in range(mh):
    u, v = [int(x) - 1 for x in input().split()]
    H[u][v] = 1
    H[v][u] = 1

cost = [[0] * n for _ in range(n)]
for i in range(n - 1):
    lst = list(map(int, input().split()))
    for j, a in enumerate(lst):
        cost[i][i + 1 + j] = a

def calc(prm):
    tot = 0
    for i in range(n):
        for j in range(i + 1, n):
            hi = prm[i]
            hj = prm[j]
            if G[i][j] ^ H[hi][hj]:
                if hi > hj:
                    hi, hj = hj, hi
                tot += cost[hi][hj]
    return tot


ans = 1 << 61
for prm in permutations(range(n)):
    ans = min(ans, calc(prm))

print(ans)

Submission Info

Judge Result