cp_library/alg/divcon/bisect_left_fn.py

• View this file on GitHub
• Last update: 2025-06-20 03:24:59+09:00

Required by

• cp_library/alg/dp/lis_fn.py
• cp_library/ds/wavelet/wm_bit_compressed_cls.py
• cp_library/ds/wavelet/wm_bit_points_cls.py
• cp_library/ds/wavelet/wm_compressed_cls.py
• cp_library/ds/wavelet/wm_group_compressed_cls.py
• cp_library/ds/wavelet/wm_group_points_cls.py
• cp_library/ds/wavelet/wm_monoid_compressed_cls.py
• cp_library/ds/wavelet/wm_monoid_points_cls.py
• cp_library/ds/wavelet/wm_points_cls.py
• cp_library/ds/wavelet/wm_segtree_compressed_cls.py
• cp_library/ds/wavelet/wm_segtree_points_cls.py
• cp_library/ds/wavelet/wm_weighted_compressed_cls.py
• cp_library/ds/wavelet/wm_weighted_points_cls.py

Verified with

• test/library-checker/data-structure/point_add_rectangle_sum_wm_bit_points.test.py
• test/library-checker/data-structure/range_kth_smallest_wm_compressed.test.py
• test/library-checker/data-structure/range_kth_smallest_wm_points.test.py
• test/library-checker/data-structure/rectangle_sum_wm_bit_compressed.test.py
• test/library-checker/data-structure/rectangle_sum_wm_bit_points.test.py
• test/library-checker/data-structure/rectangle_sum_wm_group_compressed.test.py
• test/library-checker/data-structure/rectangle_sum_wm_group_points.test.py
• test/library-checker/data-structure/rectangle_sum_wm_segtree_compressed.test.py
• test/library-checker/data-structure/rectangle_sum_wm_segtree_points.test.py
• test/library-checker/data-structure/rectangle_sum_wm_weighted.test.py
• test/library-checker/data-structure/rectangle_sum_wm_weighted_compressed.test.py
• test/library-checker/data-structure/rectangle_sum_wm_weighted_points.test.py
• test/library-checker/data-structure/static_range_frequency_wavelet_matrix.test.py
• test/library-checker/data-structure/static_rectangle_add_rectangle_sum_wm_group_points.test.py
• test/library-checker/other/longest_increasing_sequence.test.py

Code

import cp_library.__header__
import cp_library.alg.__header__
import cp_library.alg.divcon.__header__

def bisect_left(A, x, l, r):
    while l<r:
        if A[m:=(l+r)>>1]<x:l=m+1
        else:r=m
    return l

'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
             https://kobejean.github.io/cp-library               
'''



def bisect_left(A, x, l, r):
    while l<r:
        if A[m:=(l+r)>>1]<x:l=m+1
        else:r=m
    return l

Back to top page