Submission #21,491

2026-01-13 10:37:34

python3

Time limit exceeded 40/50

591ms

6648 KiB

n, m = map(int, input().split())
tree = (2**n) * [0]
vals = (2**n) * [1]
out = []

for i in range(2**(n-1) - 1, 0, -1):
    tree[i] = max(tree[2*i], tree[2*i+1]) + vals[i]

def update(idx, new_val):
    vals[idx] = new_val
    j = idx
    while j > 0:
        if j <= 2**(n-1) - 1:
            tree[j] = max(tree[2 * j] + vals[2 * j], tree[2 * j + 1] + vals[2*j + 1])
        else:
            tree[j] = 0
        j = j // 2
    out.append(tree[1])

for _ in range(m):
    index, val = map(int, input().split())
    update(index, val)

for i in out:
    print(i)

	Sum	Test	Verdict		Time	Memory
base	40/50
		1	Accepted	0/0	16ms	3312 KiB
		2	Accepted	0/0	439ms	6416 KiB
		3	Accepted	2/2	18ms	3112 KiB
		4	Accepted	2/2	18ms	3124 KiB
		5	Accepted	2/2	20ms	3232 KiB
		6	Accepted	2/2	19ms	3124 KiB
		7	Accepted	3/3	19ms	3232 KiB
		8	Accepted	3/3	20ms	3124 KiB
		9	Accepted	3/3	20ms	3272 KiB
		10	Accepted	3/3	19ms	3264 KiB
		11	Time limit exceeded	0/2	588ms	4884 KiB
		12	Time limit exceeded	0/2	589ms	4884 KiB
		13	Time limit exceeded	0/2	591ms	4876 KiB
		14	Time limit exceeded	0/2	579ms	4628 KiB
		15	Time limit exceeded	0/2	577ms	4672 KiB
		16	Accepted	2/2	439ms	6420 KiB
		17	Accepted	2/2	441ms	6648 KiB
		18	Accepted	2/2	446ms	6420 KiB
		19	Accepted	2/2	441ms	6436 KiB
		20	Accepted	3/3	474ms	6424 KiB
		21	Accepted	3/3	469ms	6420 KiB
		22	Accepted	3/3	474ms	6420 KiB
		23	Accepted	3/3	477ms	6420 KiB