Problem:


Score : 100 points

Problem Statement

There are N slimes lining up in a row.
Initially, the i-th slime from the left has a size of a_i.

Taro is trying to combine all the slimes into a larger slime.
He will perform the following operation repeatedly until there is only one slime:

Choose two adjacent slimes, and combine them into a new slime. The new slime has a size of x + y, where x and y are the sizes of the slimes before combining them. Here, a cost of x + y is incurred. The positional relationship of the slimes does not change while combining slimes.

Find the minimum possible total cost incurred.

Constraints

All values in input are integers.

2 \leq N \leq 400

1 \leq a_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 \ldots a_N

Output

Print the minimum possible total cost incurred.

Sample Input 1

4
10 20 30 40

Sample Output 1

190

Taro should do as follows (slimes being combined are shown in bold):

(10, 20, 30, 40) → (30, 30, 40)

(30, 30, 40) → (60, 40)

(60, 40) → (100)

Sample Input 2

5
10 10 10 10 10

Sample Output 2

120

Taro should do, for example, as follows:

(10, 10, 10, 10, 10) → (20, 10, 10, 10)

(20, 10, 10, 10) → (20, 20, 10)

(20, 20, 10) → (20, 30)

(20, 30) → (50)

Sample Input 3

3
1000000000 1000000000 1000000000

Sample Output 3

5000000000

The answer may not fit into a 32-bit integer type.

Sample Input 4

6
7 6 8 6 1 1

Sample Output 4

68

Taro should do, for example, as follows:

(7, 6, 8, 6, 1, 1) → (7, 6, 8, 6, 2)

(7, 6, 8, 6, 2) → (7, 6, 8, 8)

(7, 6, 8, 8) → (13, 8, 8)

(13, 8, 8) → (13, 16)

(13, 16) → (29)



Sample input:
4
10 20 30 40


Sample output:
190

Submission status: Wrong Answer

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    N = r_int()
    A = R()

    l = [ai + ai2 for (ai, ai2) in zip(A, A[1:])]
    ans = 0
    for _ in range(N-1):
        tmp = INF
        i = INF
        for j, k in enumerate(l):
            if k <= tmp:
                tmp = k
                i = j
        ans += l[i]
        A[i] = A[i] + A[i+1]
        A.pop(i+1)
        l = [ai + ai2 for (ai, ai2) in zip(A, A[1:])]
    print(ans)


    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import heapq as hq

N=int(input())
a=list(map(int,input().split()))

hq.heapify(a)
ans=0
while len(a)>1:
    x=hq.heappop(a)
    y=hq.heappop(a)
    ans+=x+y
    hq.heappush(a,x+y)
    
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(a) for a in input().split()]

L = [[0]*N for _ in range(N)]
for i in range(N):
    L[0][i] = A[i]
    
inf = 10**13
ans = 0
for i in range(N-1):
    c = inf
    for j in range(N-1):
        if L[i][j] == "F":
            continue
        k = 1
        while j+k < N and L[i][j+k] == "F":
            k += 1
        if j+k == N:
            break
        if c > L[i][j] + L[i][j+k]:
            c = L[i][j] + L[i][j+k]
            idx = [j, j+k]
    ans += c
    for j in range(N):
        if j == idx[0]:
            L[i+1][j] = c
        elif j == idx[1]:
            L[i+1][j] = "F"
        else:
            L[i+1][j] = L[i][j]
            
print(ans)

Submission status: Wrong Answer

Solution code:
import itertools
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
    ind=0
    num=float("inf")
    for i in range(1,len(a)):
        if a[i]+a[i-1]<num:
            num=a[i]+a[i-1]
            ind=i
    a=list(itertools.chain(a[:ind-1],[num],a[ind+1:]))
    ans+=num
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
cnt = 0
while len(A)>1:
    cmin = 10**12
    for i in range(len(A)-2+1):
        if A[i]+A[i+1]<cmin:
            ind = i
            cmin = A[i]+A[i+1]
    cnt += cmin
    A[ind] += A[ind+1]
    A.pop(ind+1)
print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(x) for x in input().strip().split()]

c = [[None for i in range(n)] for j in range(n)]
s = [[0 for i in range(n)] for j in range(n)]

for i in range(n):
    c[i][i] = 0
    s[i][i] = a[i]

for i in range(n):
    for j in range(i+1,n):
        s[i][j] = s[i][j-1]+a[j]

def solve(i,j):
    if c[i][j] is not None:
        return c[i][j]
    mn = 10**10
    for k in range(i,j):
        mn = min(mn,solve(i,k)+solve(k+1,j)+s[i][k]+s[k+1][j])
    c[i][j] = mn
    return c[i][j]

# print(s)
print(solve(0,n-1))
# print(c)

Submission status: Wrong Answer

Solution code:
import heapq
n = int(input())
a = list(map(int, input().split()))
heapq.heapify(a)
res = 0
for i in range(n - 1):
    x = heapq.heappop(a)
    y = heapq.heappop(a)
    res += x + y
    heapq.heappush(a, x + y)
print(res)

Submission status: Wrong Answer

Solution code:
def p_n():
    from itertools import accumulate
    n = int(input())
    *a, = map(int, input().split())
    ac = list(accumulate(a)) + [0]
    dp = [[0] * (n + 1) for _ in range(n + 1)]
    for i in range(2, n + 1):
        for j in range(n - i + 1):
            dp[i][j] = ac[j + i - 1] - ac[j - 1] + min(dp[k][j] + dp[i - k][j + k] for k in range(1, i))
    print(dp)
    print(dp[-1][0])


if __name__ == '__main__':
    p_n()

Submission status: Wrong Answer

Solution code:
def p_n():
    from heapq import heappush, heappop, heapify
    n = int(input())
    *a, = map(int, input().split())
    heapify(a)
    ans = 0
    for _ in range(n - 1):
        x = heappop(a)
        y = heappop(a)
        ans += x + y
        heappush(a, x + y)
    print(ans)


if __name__ == '__main__':
    p_n()

Submission status: Wrong Answer

Solution code:
import sys
import itertools
input = sys.stdin.readline


n=int(input())
a=list(map(int, input().split()))
b=itertools.accumulate(a)
b=[0]+list(b)
dp=[[0]*(n) for i in range(n)]

x=float('inf')
for i in range(n-1,-1,-1):
    for j in range(i+1,n):
        for k in range(i,j):
            dp[i][j]=min(dp[i+1][k]+dp[k+1][j],x)+(b[j+1]-b[i])
print(b)
print(dp)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
ans=0
while n>1:
  l.sort()
  x=[]
  x.append(l[0]+l[1])
  ans+=l[0]+l[1]
  for i in range(2,n):
    x.append(l[i])
  l=list(x)
  n-=1
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
a=list(map(int,input().split()))
ans=0
while len(a)>2:
  lst=[]
  for i in range(len(a)-1):
    lst.append(a[i]+a[i+1])
  m=min(lst)
  index=lst.index(m)
  a.pop(index)
  a[index]=m
  ans+=m
ans+=sum(a)
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    a = list(map(int, input().split()))
    r = 0
    for i in range(N-1):
        m = (10 ** 9) * 401
        mi = 0
        for j in range(N-i-1):
            t = a[j] + a[j + 1]
            if t < m:
                mi = j
                m = t
        r += m
        a = a[:mi] + [m] + a[mi+2:]
    return r

print(main())

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    A = list(map(int, input().split()))
    c = [0] * N
    r = 0
    for i in range(N - 1):
        mv = 10 ** 20
        mi = -1
        vv = A[0]
        vi = 0
        uu = -1
        for j, v in enumerate(c[1:], 1):
            if v == 1:
                vv += A[j]
                continue
            if uu > 0:
                if uu + vv < mv:
                    mv = uu + vv
                    mi = vi
            uu = vv
            vi = j
            vv = A[j]
        if uu > 0:
            if uu + vv < mv:
                mv = uu + vv
                mi = vi
        r += mv
        c[mi] = 1
    print(r) 

main()

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

def main():
    def cost(l, r):
        if l + 2 == r:
            return aa[l] + aa[l + 1]
        if l + 1 == r:
            return 0
        if dp[l][r] != -1:
            return dp[l][r]
        res = 10 ** 10
        for m in range(l + 1, r):
            res = min(res, cost(l, m) + cost(m, r))
        res += cumsum_aa[r] - cumsum_aa[l]
        dp[l][r] = res
        return res

    n = int(input())
    aa = list(map(int, input().split()))
    dp = [[-1] * (n + 1) for _ in range(n + 1)]
    cumsum_aa = [0]
    for i, a in enumerate(aa):
        cumsum_aa.append(cumsum_aa[i] + a)
    print(cost(0, n))

main()

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

def main():
    n = int(input())
    aa = list(map(int, input().split()))
    dead = [False] * n
    ans = 0
    for _ in range(n - 1):
        mn = 10 ** 10
        mi = [0, 0]
        for i, a in enumerate(aa):
            if i == 0:
                pa = a
                pi = 0
                continue
            if dead[i]: continue
            if pa + a < mn:
                mi = [pi, i]
                mn = pa + a
            pi, pa = i, a
        ans += mn
        aa[mi[0]] = mn
        dead[mi[1]] = True
    print(ans)

main()

Submission status: Wrong Answer

Solution code:
def slimes(a): # aの大きさのスライムを合体させていく
    n=len(a)
    # dp[i][j] : a[i,j]の部分文字列でゲームをスタートしたときの最適解
    dp=[[10**12 for _ in range(n)] for _ in range(n)]
    # 文字1つではじめた時のコストは0
    for i in range(n):
        dp[i][i]=0
    w=[0,a[0]]+[0 for _ in range(n-1)]
    for i in range(n-1):
        w[i+2]=w[i+1]+a[i+1]
    for length in range(1,n+1):
        for i in range(n-length):
            j=i+length
            minimum=10**12
            for k in range(j-i):
                minimum = min( minimum , dp[i][i+k]+dp[i+k+1][j] )
            dp[i][j] = minimum + w[j+1]-w[i]
    print(dp[0][n-1])

def main():
    n=int(input())
    a = list(map(int,input().split()))
    slimes(a)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys

n = int(input())
INF = 10**9
a_ls = [int(i) for i in sys.stdin.readline().split()]
memo_ls = [[0 for j in range(n)] for i in range(n)]
for _ in range(1,n):
    for i in range(n-_):
        j = i + _
        sum_ij = sum(a_ls[i:j+1])
        memo_ls[i][j] = sum_ij
        res = INF if j - i > 1 else 0
        for k in range(i,j):
            res = min(memo_ls[i][k] + memo_ls[k+1][j], res)
        memo_ls[i][j] += res
print(memo_ls[0][-1])

Submission status: Wrong Answer

Solution code:
import sys
import heapq
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
heapq.heapify(a_ls)
cost = 0
while len(a_ls) > 1:
    first = heapq.heappop(a_ls)
    second = heapq.heappop(a_ls)
    cost += first + second
    heapq.heappush(a_ls, first + second)
print(cost)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
A = list(map(int,input().split()))

CSUM = [0 for _ in range(N)]
CSUM[0] = A[0]
for i in range(1,N):
  CSUM[i] = CSUM[i-1] + A[i]
#print(CSUM)
def csum(i,j):
  if i == 0:
    return CSUM[j]
  else:
    return CSUM[j]-CSUM[i-1]

dp = [[0 for _ in range(N)] for _ in range(N)]

for k in range(1,N):
  for i in range(N-k):
    j = i+k
    tmp = 10**10
    for l in range(i,j):
      tmp = min(tmp,dp[i][l]+dp[l+1][j] + csum(i,j))
    dp[i][j] = tmp

print(dp[0][N-1])
#print(dp)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)

N = int(input()) 
A = list(map(int,input().split()))

CSUM = [0 for _ in range(N)]
CSUM[0] = A[0]
for i in range(1,N):
  CSUM[i] = CSUM[i-1] + A[i]
#print(CSUM)
def csum(i,j):
  if i == 0:
    return CSUM[j]
  else:
    return CSUM[j]-CSUM[i-1]

dp = [[0 for _ in range(N)] for _ in range(N)]

for k in range(1,N):
  for i in range(N-k):
    j = i+k
    tmp = 10**10
    for l in range(i,j):
      tmp = min(tmp,dp[i][l]+dp[l+1][j])
    dp[i][j] = tmp + sum(A[i:j+1])

print(dp[0][N-1])
#print(dp)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)

N = int(input()) 
A = list(map(int,input().split()))

CSUM = [0 for _ in range(N)]
CSUM[0] = A[0]
for i in range(1,N):
  CSUM[i] = CSUM[i-1] + A[i]
#print(CSUM)
def csum(i,j):
  if i == 0:
    return CSUM[j]
  else:
    return CSUM[j]-CSUM[i-1]

dp = [[0 for _ in range(N)] for _ in range(N)]

for k in range(1,N):
  for i in range(N-k):
    j = i+k
    tmp = 10**10
    for l in range(i,j):
      tmp = min(tmp,dp[i][l]+dp[l+1][j])
    dp[i][j] = tmp + csum(i,j)

print(dp[0][N-1])
#print(dp)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)

N = int(input()) 
A = list(map(int,input().split()))

CSUM = [0 for _ in range(N)]
CSUM[0] = A[0]
for i in range(1,N):
  CSUM[i] = CSUM[i-1] + A[i]
#print(CSUM)
def csum(i,j):
  if i == 0:
    return CSUM[j]
  else:
    return CSUM[j]-CSUM[i-1]

dp = [[0 for _ in range(N)] for _ in range(N)]

def rec(i,j):
  if dp[i][j] != 0:
    return dp[i][j]
  if i == j:
    return 0
  res = 10**10
  for k in range(i,j):
    res = min(res,rec(i,k)+rec(k+1,j))
  dp[i][j] = res + csum(i,j)
  return dp[i][j]

print(rec(0,N-1))
#print(dp)

Submission status: Wrong Answer

Solution code:
n,*a=list(map(int,open(0).read().split()))
b = [0] * -~n
for i in range(n): b[i+1] = b[i] + a[i]

dp = [[-1] * -~n for _ in range(-~n)]
def rec(l, r):
    if l == r: return 0
    if ~dp[l][r]:return dp[l][r]

    ret = 1000000000000
    for i in range(l, r):
        ret = min(ret, rec(l, i) + rec(i+1, r) + b[r+1] - b[l])
    dp[l][r] = ret
    return ret
print(rec(0, n-1))

Submission status: Wrong Answer

Solution code:
n=int(input())
alist=[int(i) for i in input().split()]
ans=0
length=n
for j in range(n-1):
	min=10**190
	minIndex=-1
	for i in range(length-1):
		if alist[i]+alist[i+1]<min:
			min=alist[i]+alist[i+1]
			minIndex=i
	alist[minIndex]=min
	del alist[minIndex+1]
	length-=1
	ans+=min
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
alist=[int(i) for i in input().split()]
ans=0
length=n
for j in range(n-1):
	min=10**9
	minIndex=-1
	for i in range(length-1):
		if alist[i]+alist[i+1]<min:
			min=alist[i]+alist[i+1]
			minIndex=i
	alist[minIndex]=min
	del alist[minIndex+1]
	length-=1
	ans+=min
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
slime = [ int(v) for v in input().split() ]

ans = 0
for k in range(n-1):
    slime_connect = [ slime[i] + slime[i+1] for i in range(n-k-1) ]
    con = (10**12,-1)
    for i, v in enumerate(slime_connect):
        if v <= con[0]:
            con = v, i

    ans += con[0]
    slime[con[1]] = -1
    slime[con[1]+1] = con[0]

    slime = [ i for i in slime if i != -1 ]

print(ans)

Submission status: Wrong Answer

Solution code:

import heapq
n = int(input())
slime = [ int(v) for v in input().split() ]
slime.sort()
ans = 0
for i in range(n-1):
    x = heapq.heappop(slime)
    y = heapq.heappop(slime)
    ans += x + y
    heapq.heappush(slime,x+y)
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
dp=[[0]*(n+2) for i in range(2)]
for i in range(n):
    dp[0][i]=a[i]

ans=0
for i in range(n):
    x=y=0
    for j in range(2):
        for k in range(n-i-2,-1,-1):
            if j==0:
                if x==0 or x>(dp[i%2][k]+dp[i%2][k+1]):
                    x=dp[i%2][k]+dp[i%2][k+1]
                    y=k
            else:
                if k>y:
                    dp[(i+1)%2][k]=dp[i%2][k+1]
                elif k==y:
                    dp[(i+1)%2][k]=dp[i%2][k]+dp[i%2][k+1]
                else:
                    dp[(i+1)%2][k]=dp[i%2][k]
    ans+=x
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = 0

while len(a) > 1:
	t = []
	for i in range(len(a) - 1):
		t.append(a[i] + a[i + 1])
	
	i = t.index(min(t))
	ans += t[i]

	a = a[:i] + [t[i]] + a[i + 2:]

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))

ans = 0
while len(A) > 1:
    left = 0
    for i in range(len(A) - 1):
        if A[i] + A[i + 1] < A[left] + A[left + 1]:
            left = i
    ans += A[left] + A[left + 1]
    A[left] = A[left] + A[left + 1]
    A.pop(left + 1)

print(ans)

Submission status: Wrong Answer

Solution code:
from heapq import heappush, heappop

N = int(input())
A = list(map(int, input().split()))

que = []
for a in A:
    heappush(que, a)

ans = 0
while len(que) > 1:
    a, b = heappop(que), heappop(que)
    ans += a + b
    heappush(que, a + b)

print(ans)