Implementation steps:
Coordinate compress -values
Create events: for each rectangle edge
Sort events by
Sweep: between events, add (covered length) ( difference) to area
Update segment tree for the current event The segment tree tracks how much of each -segment is covered. Nodes store cover count; query returns total covered length. This is an advanced problem combining sweep line, coordinate compression, and segment trees. Time: . Space: .