##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Union of rectangles
Given a list of axis-aligned rectangles, find the total area covered (counting overlapping regions only once).
Example: rectangles have total area . You're solving the rectangle union problem.
Sweep line with interval tree or segment tree solves it in . Constraints: up to rectangles, coordinates up to .
