ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Сборники > Задачи со всего света > задача:


50980 - The smallest rectangle

Гость
• Вопросы к жюри (1)

Задачи сборника

• 50935 - Max Discount
• 50851 - Repeated Numbers
• 50838 - Balanced Numbers
• 50724 - Number of Circles
• 50916 - Ascending Numbers
• 50926 - School Mail Merge
• 50917 - Descending Numbers
• 50982 - A thief in labyrinth
• 50980 - The smallest rectangle
• 50932 - Shifting rows and columns
• 50933 - Sum of the Biggest Neighbors
• 50834 - The train which leaves the f...
• 51003 - Double Prime
• 50435 - City Electric Bills
• 50527 - Sum of LCMs
• 50353 - Cube of the Largest number
• 50539 - Number of Chairs - 2

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Question by Ibrahim Mesecan.

The smallest rectangle

Question: Your poor brother again is having trouble with the math professor. Now he is given n points. And, he has to find the smallest rectangle that encapsulates all the points.

Input specification
You will be given an integer in the beginning: the number of points (n). Then, in the following n lines, you will be given (x, y) coordinates of n points where 0 ≤ n ≤ 20,000 and x y coordinates are integers between -3e5 and +3e5.

Output specification:
Show x y coordinates of two corners (lower left corner and upper-right corner).

Sample Input
6
10 6
12 8
16 10
14 14
15 12
13 12
 		Sample Output
10 6
16 14



Для отправки решений необходимо выполнить вход.

www.contester.ru