Dynamic Range Minimum Queries

n, q = [int(x) for x in input().split()]
N = 1 << (n-1).bit_length()
print(N)
array = [int(x) for x in input().split()]
minimums = [10**10 for _ in range(N)]
minimums.extend(array)


def BuildSparseTree():
    for i in range(N-1, 0, -1):
        minimums[i] = min(minimums[i*2], minimums[i*2+1])

BuildSparseTree()

output = []

for i in range(q):
    action, k, u = [int(x) for x in input().split()]
    if action == 1: 
        k = (k + N - 1) // 2
        minimums[k+N] = u
        while k > 0:
            minimums[k] = min(minimums[k*2], minimums[k*2+1])
            k = k // 2
    else: 
        s = 10**10
        k += N - 1
        u += N
        while k < u:
            # print("Values", k, u)
            if k % 2 == 1: 
                s = min(s, minimums[k])
                k += 1
            if u % 2 == 0: 
                u -= 1
                s = min(s, minimums[u])
            k = k // 2
            u = u // 2
        output.append(str(s))

print("\n".join(output))

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 14, in <module>
    BuildS...