tests/bit.py

• View this file on GitHub
• Last update: 2025-04-17 21:49:15+09:00
• Problem: https://judge.yosupo.jp/problem/point_add_range_sum

Depends on

• libs/bit.py
• libs/standard_input.py

Code

# competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/point_add_range_sum
from libs.bit import BIT
from libs.standard_input import *

N, Q = il()
A = il()
bit = BIT(N)

for i in range(N):
    bit.add(i + 1, A[i])

while Q:
    lis = il()
    if lis[0] == 0:
        bit.add(lis[1] + 1, lis[2])
    else:
        print(bit.interval_sum(lis[1], lis[2]))

    Q -= 1

Test cases

Env	Name	Status	Elapsed	Memory
Python	example_00	AC	33 ms	12 MB
Python	max_random_00	AC	4532 ms	71 MB
Python	max_random_01	AC	4329 ms	71 MB
Python	max_random_02	AC	4304 ms	71 MB
Python	max_random_03	AC	4159 ms	71 MB
Python	max_random_04	AC	4201 ms	71 MB
Python	random_00	AC	3537 ms	55 MB
Python	random_01	AC	3700 ms	63 MB
Python	random_02	AC	2337 ms	17 MB
Python	random_03	AC	898 ms	59 MB
Python	random_04	AC	1081 ms	42 MB
Python	small_00	AC	36 ms	12 MB
Python	small_01	AC	36 ms	12 MB
Python	small_02	AC	36 ms	12 MB
Python	small_03	AC	36 ms	12 MB
Python	small_04	AC	36 ms	12 MB
Python	small_05	AC	34 ms	12 MB
Python	small_06	AC	34 ms	12 MB
Python	small_07	AC	34 ms	12 MB
Python	small_08	AC	34 ms	12 MB
Python	small_09	AC	34 ms	12 MB

Back to top page