def minArea(image: List[List[str]], x: int, y: int) -> int:
    # 最小のcheck_funを満たすindexを返す
    # lo == hiでbreakとなる
    def binary_search(lo, hi, check_fun):
        while lo < hi:
            mid = (lo + hi) // 2
            if check_fun(mid):
                hi = mid
            else:
                lo = mid + 1
        return lo
    top    = binary_search(0, x,             lambda x: '1' in image[x])
    bottom = binary_search(x, len(image),    lambda x: '1' not in image[x])
    left   = binary_search(0, y,             lambda y: any(row[y] == '1' for row in image))
    right  = binary_search(y, len(image[0]), lambda y: all(row[y] == '0' for row in image))
    print(top, bottom)
    print(left, right)
    return (bottom - top) * (right - left
  
minArea(image = [["0","0","1","0"],["0","1","1","0"],["0","1","0","0"]], x = 0, y = 2) # 6
"""
0 3
1 3
"""