Submission #53254287

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
N = int(input())
D = [[0]*N for _ in range(N)]
for i in range(N - 1):
    d = list(map(int, input().split()))
    for j in range(N - i - 1):
        D[i][i + j + 1] = d[j]
dp = [0]*(1 << N)
for S in range(1 << N):
    for i in range(N):
        for j in range(i + 1, N):
            if (S >> i) & 1:
                continue
            if (S >> j) & 1:
                continue
            p = S
            p |= (1 << i)
            p |= (1 << j)
            dp[p] = max(dp[p], dp[S] + D[i][j])
print(dp[-1])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N = int(input())
D = [[0]*N for _ in range(N)]
for i in range(N - 1):
    d = list(map(int, input().split()))
    for j in range(N - i - 1):
        D[i][i + j + 1] = d[j]

dp = [0]*(1 << N)
for S in range(1 << N):
    for i in range(N):
        for j in range(i + 1, N):
            if (S >> i) & 1:
                continue
            if (S >> j) & 1:
                continue
            p = S
            p |= (1 << i)
            p |= (1 << j)
            dp[p] = max(dp[p], dp[S] + D[i][j])

print(dp[-1])

Submission Info

Judge Result