Bounding Box

Difficulty: 1000 3500 ms 128 MB

geometry

Print the area of the smallest axis-aligned rectangle containing all N points (0 if they are collinear on an axis-parallel line).

Input: the first line has N; the next N lines each have x y.

Output: (max x − min x) · (max y − min y).

Constraints:

• 1 ≤ N ≤ 5×10⁴
• |coordinates| ≤ 10⁶

Sample Tests

3
1 1
4 5
2 3

12

1
7 7

0

Read the Editorial