oj.uz

Submission #877389

# Submission time Handle Problem Language Result Execution time Memory
877389 2023-11-23T08:04:23 Z AI_2512 Bootfall (IZhO17_bootfall) Python 3
0 / 100
 1000 ms 3096 KB 
def split_array_helper(nums, index, sum1, sum2, arr1, arr2):
    size = len(nums)
    if index == size:
        return sum1 == sum2

    arr1.append(nums[index])
    if split_array_helper(nums, index + 1, sum1 + nums[index], sum2, arr1, arr2):
        return True
    arr1.pop()

    arr2.append(nums[index])
    if split_array_helper(nums, index + 1, sum1, sum2 + nums[index], arr1, arr2):
        return True
    arr2.pop()

    return False

def split_array(nums, arr1, arr2):
    sum1, sum2 = 0, 0
    return split_array_helper(nums, 0, sum1, sum2, arr1, arr2)

n = int(input())
arr = list(map(int, input().split()))
arr2, arr3 = [], []
res = []
total_sum = sum(arr)
ruined = False
for i in range(1, total_sum + 1):
    ruined = False
    size = len(arr)
    if size > n:
        arr.pop()
    arr.append(i)
    for k in range(n + 1):
        darr = arr[:]
        del darr[k]
        if not split_array(darr, arr2, arr3):
            ruined = True
            break
        arr2.clear()
        arr3.clear()
    if not ruined:
        res.append(i)
print(len(res))

if res:
    print(" ".join(map(str, res)))

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2908 KB Output is correct
2 Correct 13 ms 3096 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 19 ms 3060 KB Output is correct
5 Execution timed out 1066 ms 2908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2908 KB Output is correct
2 Correct 13 ms 3096 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 19 ms 3060 KB Output is correct
5 Execution timed out 1066 ms 2908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2908 KB Output is correct
2 Correct 13 ms 3096 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 19 ms 3060 KB Output is correct
5 Execution timed out 1066 ms 2908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2908 KB Output is correct
2 Correct 13 ms 3096 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 19 ms 3060 KB Output is correct
5 Execution timed out 1066 ms 2908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2908 KB Output is correct
2 Correct 13 ms 3096 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 19 ms 3060 KB Output is correct
5 Execution timed out 1066 ms 2908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2908 KB Output is correct
2 Correct 13 ms 3096 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 19 ms 3060 KB Output is correct
5 Execution timed out 1066 ms 2908 KB Time limit exceeded
6 Halted 0 ms 0 KB -