Check Fixed Board Placements Against Number-Line Blockers

You are given point blockers on an infinite number line and proposed boards, each with a fixed starting coordinate and length. Determine independently whether each board can be placed without covering a blocker. Implement `can_place_boards(blockers: int[], boards: int[][]) -> bool[]`. Each board row is `[start, length]`. Return one Boolean per board in input order. ### Constraints & Assumptions - For this deterministic practice version, a board occupies the half-open interval `[start, start + length)`. A blocker at the start prevents placement; one exactly at the end does not. - The report's examples do not resolve endpoint contact. The half-open convention is an explicit practice assumption. - Lengths are positive integers at most 1,000,000,000. Blocker coordinates and board starts range from -1,000,000,000 through 1,000,000,000. - There are at most 200,000 blockers and 200,000 boards. Blockers may be unsorted or repeated. - All blockers are fixed before the checks. A successful check does not place a permanent board or affect later checks. - The board must start at the specified coordinate. Do not search for a different location or a free subinterval within a larger prefix. ### Examples ```text blockers = [3,7,11] boards = [[0,2],[5,3]] result = [true,false] ``` The second board covers coordinate 7. ```text blockers = [3] boards = [[1,2],[3,1],[4,1]] result = [true,false,true] ``` The first board ends exactly at 3 and does not include that coordinate under the chosen convention. ```hint Find the nearest relevant blocker For a board starting at a fixed coordinate, blockers to its left cannot matter. Consider the first blocker at or to the right of that start. ```