Problem:

Optimal Binary Search Tree

Optimal Binary Search Tree is a binary search tree constructed from $n$ keys and $n+1$ dummy keys so as to minimize the expected value of cost for a search operation.

  We are given a sequence $K = {k_1, k_2, ..., k_n}$ of $n$ distinct keys in sorted order $(k_1 optimal binary search tree.

Each key $k_i$ is an internal node and each dummy key $d_i$ is a leaf. For example, the following figure shows the optimal binary search tree obtained from Sample Input 1.

  

Task

Write a program which calculates the expected value of a search operation on the optimal binary search tree obtained by given $p_i$ that a search will be for $k_i$ and $q_i$ that a search will correspond to $d_i$.

Input

$n$
$p_1$ $p_2$ ... $p_n$
$q_0$ $q_1$ $q_2$ ... $q_n$

  In the first line, an integer $n$ which represents the number of keys is given.

In the second line, $p_i (1 \le i \le n)$ are given in real numbers with four decimal places.

In the third line, $q_i (0 \le i \le n)$ are given in real numbers with four decimal places.

Output

  Print the expected value for a search operation on the optimal binary search tree in a line.
The output must not contain an error greater than $10^{−4}$.

Constraints

  
$1 \le n \le 500$

  
$0 \lt p_i, q_i \lt 1$

  
$\displaystyle \sum_{i=1}^n p_i + \sum_{i=0}^n q_i = 1$

Sample Input 1

5
0.1500 0.1000 0.0500 0.1000 0.2000
0.0500 0.1000 0.0500 0.0500 0.0500 0.1000

Sample Output 1

2.75000000

Sample Input 2

7
0.0400 0.0600 0.0800 0.0200 0.1000 0.1200 0.1400
0.0600 0.0600 0.0600 0.0600 0.0500 0.0500 0.0500 0.0500

Sample Output 2

3.12000000



Sample input:
5
0.1500 0.1000 0.0500 0.1000 0.2000
0.0500 0.1000 0.0500 0.0500 0.0500 0.1000


Sample output:
2.75000000

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())
a = [0.0] * (2*n+1)
b = list(map(float, sys.stdin.readline().split()))
for i,c in enumerate(b):    a[i*2+1] = c
b = list(map(float, sys.stdin.readline().split()))
for i,c in enumerate(b):    a[i*2] = c
depth = [0]*(n*2+1)
ans = max(a)*(n*2+1)*n
def walk(d, s, e):
    global ans
    if s>=e:
        depth[s*2+1]=d
        er = 0
        for i in range(0,n*2+1,2):
            if i==0:      depth[i]=depth[i+1]+1
            elif i==n*2:  depth[i]=depth[i-1]+1
            else:         depth[i]=max(depth[i-1],depth[i+1])+1
        for i in range(n*2+1):
            er += (depth[i]+1)*a[i]
        if ans>er: ans = er
        return
    for m in range(s, e+1):
        depth[m*2+1]=d
        if s<=m-1:  walk(d+1,  s, m-1)
        if m+1<=e:  walk(d+1, m+1, e)
        
walk(0, 0, n-1)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())
a = [0.0] * (2*n+1)
b = list(map(float, sys.stdin.readline().split()))
for i,c in enumerate(b):    a[i*2+1] = c
b = list(map(float, sys.stdin.readline().split()))
for i,c in enumerate(b):    a[i*2] = c
depth = [0]*(n*2+1)
ans = max(a)*(n*2+1)*(n+1)
def walk(d, s, e):
    global ans
    if s>=e:
        depth[s*2+1]=d
        er = 0
        for i in range(0,n*2+1,2):
            if i==0:      depth[i]=depth[i+1]+1
            elif i==n*2:  depth[i]=depth[i-1]+1
            else:         depth[i]=max(depth[i-1],depth[i+1])+1
        for i in range(n*2+1):
            er += (depth[i]+1)*a[i]
        if ans>er: ans = er
        return
    for m in range(s, e+1):
        depth[m*2+1]=d
        if s<=m-1:  walk(d+1,  s, m-1)
        if m+1<=e:  walk(d+1, m+1, e)
        
walk(0, 0, n-1)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())
a = [0.0] * (2*n+1)
b = list(map(float, sys.stdin.readline().split()))
for i,c in enumerate(b):    a[i*2+1] = c
b = list(map(float, sys.stdin.readline().split()))
for i,c in enumerate(b):    a[i*2] = c
depth = [0]*(n*2+1)
ans = max(a)*(n*2+1)*(n+1)
def traverse(d, s, e):
    global ans
    if s>=e:
        depth[s*2+1]=d
        er = 0
        for i in range(0,n*2+1,2):
            if i==0:      depth[i]=depth[i+1]+1
            elif i==n*2:  depth[i]=depth[i-1]+1
            else:         depth[i]=max(depth[i-1],depth[i+1])+1
        for i in range(n*2+1):
            er += (depth[i]+1)*a[i]
        if ans>er: ans = er
        return
    for m in range(s, e+1):
        depth[m*2+1]=d
        if s<=m-1: traverse(d+1,  s, m-1)
        if m+1<=e: traverse(d+1, m+1, e)
        
traverse(0, 0, n-1)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())

ky = list(map(float, sys.stdin.readline().split()))
dm = list(map(float, sys.stdin.readline().split()))
depth = [0]*n
ans = max(max(ky),max(dm))*(n*2+1)*(n+1)

print(ky, dm)


def traverse(d, s, e, note):
    global ans
    if s==e:
        depth[s]=d
        er = 0

        for i in range(n):         er += depth[i]*ky[i]
        er += (depth[0]+1)*dm[0]
        for i in range(1, n):      er += (max(depth[i-1], depth[i])+1)*dm[i]
        er += (depth[n-1]+1)*dm[n]
        
        if ans>er: ans = er
        return
    for m in range(s, e+1):
        depth[m]=d
        if s<=m-1: traverse(d+1,  s, m-1, 'left')
        if m+1<=e: traverse(d+1, m+1, e, 'right')


traverse(1, 0, n-1, '')
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())

ky = list(map(float, sys.stdin.readline().split()))
dm = list(map(float, sys.stdin.readline().split()))
depth = [0]*n
ans = max(max(ky),max(dm))*(n*2+1)*(n+1)

def traverse(d, s, e, note):
    global ans
    if s==e:
        depth[s]=d
        er = 0

        for i in range(n):         er += depth[i]*ky[i]
        er += (depth[0]+1)*dm[0]
        for i in range(1, n):      er += (max(depth[i-1], depth[i])+1)*dm[i]
        er += (depth[n-1]+1)*dm[n]
        
        if ans>er: ans = er
        return
    for m in range(s, e+1):
        depth[m]=d
        if s<=m-1: traverse(d+1,  s, m-1, 'left')
        if m+1<=e: traverse(d+1, m+1, e, 'right')


traverse(1, 0, n-1, '')
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())

ky = list(map(float, sys.stdin.readline().split()))
dm = list(map(float, sys.stdin.readline().split()))
depth = [0]*n
ans = max(max(ky),max(dm))*(n*2+1)*(n+1)

print(ky, dm)


def traverse(d, s, e, note):
    global ans
    if s==e:
        depth[s]=d
        r = 0
        for i in range(n):         r += depth[i]*ky[i]
        r += (depth[0]+1)*dm[0]
        for i in range(1, n):      r += (max(depth[i-1], depth[i])+1)*dm[i]
        r += (depth[n-1]+1)*dm[n]
        if ans>r: ans = r
        return
    for m in range(s, e+1):
        depth[m]=d
        if s<=m-1: traverse(d+1,  s, m-1, 'left')
        if m+1<=e: traverse(d+1, m+1, e, 'right')


traverse(1, 0, n-1, '')
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.readline())

ky = list(map(float, sys.stdin.readline().split()))
dm = list(map(float, sys.stdin.readline().split()))
depth = [0]*n
ans = max(max(ky),max(dm))*(n*2+1)*(n+1)


def traverse(d, s, e, note):
    global ans
    if s==e:
        depth[s]=d
        r = 0
        for i in range(n):         r += depth[i]*ky[i]
        r += (depth[0]+1)*dm[0]
        for i in range(1, n):      r += (max(depth[i-1], depth[i])+1)*dm[i]
        r += (depth[n-1]+1)*dm[n]
        if ans>r: ans = r
        return
    for m in range(s, e+1):
        depth[m]=d
        if s<=m-1: traverse(d+1,  s, m-1, 'left')
        if m+1<=e: traverse(d+1, m+1, e, 'right')


traverse(1, 0, n-1, '')
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[float(i) for i in input().split()]
q=[float(i) for i in input().split()]
pq = [q[-1]]*2*(n+1)
dp = {}
for i in range(n):
    pq[2*i+1] = q[i]
    pq[2*i+2] = p[i]
for i in range(len(pq)):
    for j in range(len(pq)-i):
        if i == 0:
            dp[(j,j+i)] = 0
        elif i == 1:
            dp[(j,j+i)] = pq[j+i]
        else:
            tmp = 1001
            for k in range(i):
                c = dp[(j,j+k)] + dp[(j+k+1,j+i)]+sum(pq[j+1:j+i+1])
                if c < tmp:
                    tmp = c
            dp[(j,j+i)] = tmp
print(dp[(0,2*n+1)])

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[float(i) for i in input().split()]
q=[float(i) for i in input().split()]
pq = [q[-1]]*(2*n+1)
dp = {}
for i in range(n):
    pq[2*i] = q[i]
    pq[2*i+1] = p[i]
pq = [0.0]+pq
for j in range(len(pq)):
    for i in range(len(pq)-j):
        if j == 0:
            dp[(i,i+j)] = 0.0
        elif j == 1:
            dp[(i,i+j)] = pq[i+j]
        else:
            tmp = 1001
            for k in range(j):
                c = dp[(i,i+k)] + dp[(i+k+1,i+j)]+sum(pq[i+1:i+j+1])
                if c < tmp:
                    if j == len(pq)-1 and i+k % 2 == 1:
                        continue
                    tmp = c
            dp[(i,i+j)] = tmp
print(dp[(0,2*n+1)])

Submission status: Time Limit Exceeded

Solution code:
global memo
global memo_pq
global p_list
global q_list



def mk_memo(i,j):#memo[i][j]を求める
    tmp_min=9999999
    for k in range(1,j-1):
        tmp=p_list[i+k] + memo[i][k] + memo_pq[i][k] + memo[i+k+1][j-k-1] + memo_pq[i+k+1][j-k-1]
        if(tmp < tmp_min):
            tmp_min=tmp
    if(j!=1):
        tmp_min=min([tmp_min, p_list[i] +2*q_list[i] + memo[i+1][j-1] +memo_pq[i+1][j-1]])
        tmp_min=min([tmp_min, p_list[i+j-1] +2*q_list[i+j] + memo[i][j-1] +memo_pq[i][j-1]])
    else:
        tmp_min=p_list[i] + 2*q_list[i] + 2*q_list[i+1]
    memo[i][j]=tmp_min



n=int(input())
p_list=list(map(float,input().split()))
q_list=list(map(float,input().split()))



memo=[[0]*(n+1-i) for i in range(n+1)]#memo[i][j]はlist[i]から始まるj個の部分集合に対する解
memo_pq=[[0]*(n+1-i) for i in range(n+1)]#memo_pq[i][j]はlist[i]から始まる
                                       #ｊ個の部分集合に対応する重みpと重みqの和
for p in range(n+1):
    for q in range(n+1-p):
        if(q==0):
            memo_pq[p][q]=q_list[p]
        else:
            memo_pq[p][q]=memo_pq[p][q-1] + p_list[p+q-1] + q_list[p+q]
    



for i in range(n):
    for j in range(1,2+i):
        mk_memo(n-1-i,j)

print(memo[0][-1])

Submission status: Time Limit Exceeded

Solution code:
global memo
global memo_pq
global p_list
global q_list



def mk_memo(i,j):#memo[i][j]を求める
    tmp=[]
    for k in range(1,j-1):
        tmp.append(p_list[i+k] + memo[i][k] + memo_pq[i][k] + memo[i+k+1][j-k-1] + memo_pq[i+k+1][j-k-1])        
    if(j!=1):
        tmp.append(p_list[i] +2*q_list[i] + memo[i+1][j-1] +memo_pq[i+1][j-1])
        tmp.append(p_list[i+j-1] +2*q_list[i+j] + memo[i][j-1] +memo_pq[i][j-1])
        memo[i][j]=min(tmp)
    else:
        memo[i][j]=p_list[i] + 2*q_list[i] + 2*q_list[i+1]



n=int(input())
p_list=list(map(float,input().split()))
q_list=list(map(float,input().split()))



memo=[[0]*(n+1-i) for i in range(n+1)]#memo[i][j]はlist[i]から始まるj個の部分集合に対する解
memo_pq=[[0]*(n+1-i) for i in range(n+1)]#memo_pq[i][j]はlist[i]から始まる
                                       #ｊ個の部分集合に対応する重みpと重みqの和
for p in range(n+1):
    for q in range(n+1-p):
        if(q==0):
            memo_pq[p][q]=q_list[p]
        else:
            memo_pq[p][q]=memo_pq[p][q-1] + p_list[p+q-1] + q_list[p+q]
    



for i in range(n):
    for j in range(1,2+i):
        mk_memo(n-1-i,j)

print(memo[0][-1])

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
    
n = int(input())
p = [None] + list(map(float, input().split()))
q = list(map(float, input().split()))
T = [[500 for i in range(n+1)] for j in range(n+1)]

psum = [0] * (n+1)
qsum = [0] * (n+1)
qsum[0] = q[0]
for i in range(1,n+1):
    psum[i] = psum[i-1] + p[i]
    qsum[i] = qsum[i-1] + q[i]
    
for i in range(1,n+1):
    T[i][i] = p[i] + (q[i-1] + q[i])*2
    
for l in range(2,n+1):
    for i in range(1,n-l+1+1):
        val_list = [T[i][j] + T[j+2][i+l-1] for j in range(i,i+l-2)]
        val_list.append(T[i][i+l-2] + q[i+l-1])
        val_list.append(T[i+1][i+l-1] + q[i-1])
        if i-2>=0:
            w = psum[i+l-1]-psum[i-1] + qsum[i+l-1]-qsum[i-2]
        else:
            w = psum[i+l-1]-psum[i-1] + qsum[i+l-1]
        T[i][i+l-1] = min(val_list) + w
        
print(T[1][n])

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
write = sys.stdout.write

N = int(readline())
*P, = map(float, readline().split())
*Q, = map(float, readline().split())

K = [[None]*(N+1) for i in range(N+1)]
C = [[None]*(N+1) for i in range(N+1)]
S = [0]*(2*N+2)
for i in range(2*N+1):
    S[i+1] = S[i] + (P[i//2] if i % 2 else Q[i//2])

for i in range(N+1):
    C[i][i] = Q[i]
    K[i][i] = i

for l in range(1, N+1):
    for i in range(N+1-l):
        j = i+l
        k0 = K[i][j-1]; k1 = K[i+1][j]
        tmp = 1e30
        k2 = None
        for k in range(k0, min(k1+1, j)):
            v = C[i][k] + C[k+1][j]
            if v < tmp:
                k2 = k
                tmp = v
        K[i][j] = k2
        C[i][j] = tmp + (S[2*j+1] - S[2*i])
write("%.10f\n" % C[0][N])

Submission status: Accepted

Solution code:
def main():
    """最適二分探索木での探索一回あたりの期待値の最小値を求める
    """
    inf = 10*6
    n = int(input())
    # 内包よりはやい
    P = [0.0] + list(map(float, input().split()))
    Q = list(map(float, input().split()))
    E = [[0.0]*(n+1) for _ in range(n+1)]
    W = [[0.0]*(n+1) for _ in range(n+1)]
    for i in range(1, n+1):
        W[i][i] = Q[i-1] + P[i] + Q[i]
        E[i][i] = P[i] + (Q[i-1] + Q[i])*2
    for i in range(1, n+1):
        for j in range(i+1, n+1):
            W[i][j] = W[i][j-1] + P[j] + Q[j]
    for d in range(1, n):
        for i in range(1, n-d+1):
            j = i + d
            e = Q[i-1] + E[i+1][j] + W[i][j] 
            for k in range(i+1, j):
                ne =  E[i][k-1] + E[k+1][j] + W[i][j]
                if ne < e:
                    e = ne
            ne = E[i][j-1] + Q[j] + W[i][j]
            if ne < e:
                e = ne
            E[i][j] = e
    print(E[1][-1])

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    num_nodes = int(input())
    P = list(map(lambda x: float(x), input().split()))
    Q = list(map(lambda x: float(x), input().split()))

    Depth = [[0] * (num_nodes + 1) for i in range(num_nodes + 1)]
    Exp = [[0.0] * (num_nodes + 1) for i in range(num_nodes + 1)]
    Cum_prob = [0.0] * (2 * num_nodes + 2)

    for i in range(2 * num_nodes + 1):
        Cum_prob[i + 1] = Cum_prob[i] + (P[i // 2] if i % 2 else Q[i // 2])

    for i in range(num_nodes + 1):
        Exp[i][i] = Q[i]
        Depth[i][i] = i

    for l in range(1, num_nodes + 1):
        for i in range(num_nodes + 1 - l):
            j = i + l
            d0 = Depth[i][j - 1]
            d1 = Depth[i + 1][j]
            d2 = -1
            cost = 1e30
            for k in range(d0, min(d1 + 1, j)):
                v = Exp[i][k] + Exp[k + 1][j]
                if v < cost:
                    d2 = k
                    cost = v
            Depth[i][j] = d2
            Exp[i][j] = cost + Cum_prob[2 * j + 1] - Cum_prob[2 * i]

    print(f"{Exp[0][num_nodes]:.5f}")

Submission status: Accepted

Solution code:
n=int(input())
A=[0.0]+[float(i) for i in input().split()]
B=[float(i) for i in input().split()]
W={}
E={}
for i in range(1,n+2):
    W[i,i-1] = B[i-1]
    E[i,i-1] = B[i-1],i
for i in range(1,n+1):
    for j in range(i,n+1):
        W[i,j] = W[i,j-1]+A[j]+B[j]
for i in range(1,n+1):
    E[i,i] = E[i,i-1][0] + E[i+1,i][0] + W[i,i],i
for h in range(1,n):
    for i in range(1,n-h+1):
        e = 1001,None
        j = i + h
        k0 = E[i,j-1][1]
        k1 = E[i+1,j][1]
        for r in range(k0,k1+1):
            tmp = E[i,r-1][0] + E[r+1,j][0] + W[i,j]
            if tmp < e[0]:
                e = tmp,r
        E[i,j] = e
print(E[1,n][0])

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
write = sys.stdout.write

N = int(readline())
*P, = map(float, readline().split())
*Q, = map(float, readline().split())

K = [[None]*(N+1) for i in range(N+1)]
C = [[None]*(N+1) for i in range(N+1)]
S = [0]*(2*N+2)
for i in range(2*N+1):
    S[i+1] = S[i] + (P[i//2] if i % 2 else Q[i//2])

for i in range(N+1):
    C[i][i] = Q[i]
    K[i][i] = i

for l in range(1, N+1):
    for i in range(N+1-l):
        j = i+l
        k0 = K[i][j-1]; k1 = K[i+1][j]
        tmp = 1e30
        k2 = None
        for k in range(k0, min(k1+1, j)):
            v = C[i][k] + C[k+1][j]
            if v < tmp:
                k2 = k
                tmp = v
        K[i][j] = k2
        C[i][j] = tmp + (S[2*j+1] - S[2*i])
write("%.10f\n" % C[0][N])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# ALDS_10_D: Dynamic Programming - Optimal Binary Search Tree


def optimal_cost(n, kp, dp):
    sums = [sum(kp[0:i]) + sum(dp[0:i+1]) for i in range(n+1)]
    expects = [[kp[i] + (dp[i] + dp[i+1])*2 for i in range(n)]]

    for w in range(2, n+1):
        exps = []
        for i in range(n-w+1):
            j = i + w
            exp = min(dp[i] + expects[j-i-2][i+1], expects[j-i-2][i] + dp[j])
            for k in range(i+1, j-1):
                _exp = expects[k-i-1][i] + expects[j-k-2][k+1]
                if exp > _exp:
                    exp = _exp
            exps.append(exp + sums[j] - sums[i] + dp[i])
        expects.append(exps)

    return expects[-1][0]


def run():
    n = int(input())
    ps = [float(x) for x in input().split()]
    qs = [float(x) for x in input().split()]

    print("{:.8f}".format(optimal_cost(n, ps, qs)))


if __name__ == '__main__':
    run()