Preparing NOJ

# Rectangles

2000ms 262144K

## Description:

You are given $n$ rectangles on a plane with coordinates of their bottom left and upper right points. Some $(n-1)$ of the given $n$ rectangles have some common point. A point belongs to a rectangle if this point is strictly inside the rectangle or belongs to its boundary.

Find any point with integer coordinates that belongs to at least $(n-1)$ given rectangles.

## Input:

The first line contains a single integer $n$ ($2 \le n \le 132\,674$) — the number of given rectangles.

Each the next $n$ lines contains four integers $x_1$, $y_1$, $x_2$ and $y_2$ ($-10^9 \le x_1 < x_2 \le 10^9$, $-10^9 \le y_1 < y_2 \le 10^9$) — the coordinates of the bottom left and upper right corners of a rectangle.

## Output:

Print two integers $x$ and $y$ — the coordinates of any point that belongs to at least $(n-1)$ given rectangles.

## Sample Input:

30 0 1 11 1 2 23 0 4 1

## Sample Output:

1 1

## Sample Input:

30 0 1 10 1 1 21 0 2 1

## Sample Output:

1 1

## Sample Input:

40 0 5 50 0 4 41 1 4 41 1 4 4

## Sample Output:

1 1

## Sample Input:

50 0 10 81 2 6 72 3 5 63 4 4 58 1 9 2

## Sample Output:

3 4

## Note:

The picture below shows the rectangles in the first and second samples. The possible answers are highlighted.

The picture below shows the rectangles in the third and fourth samples.

Info

Provider CodeForces

Code CF1028C

Tags

geometryimplementationsortings

Submitted 18

Passed 6

AC Rate 33.33%

Date 03/04/2019 16:33:06

Related

Nothing Yet