HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > CEN112 Questions 2016 > problem:


15-PE2-1. 50980 - The smallest rectangle

CEN112 Questions 2016

Start: Mar.30.2016 at 03:10:22 PM
Finish: Apr.01.2016 at 05:00:00 AM
The contest is finished!
• Contest scoreboard

Guest
• Review clarifications (1)

Contest problems

• 15-MdtE-5. 50912 - Trip to Librazhd
• 15-MdtE-6. 50914 - Buy 3, Pay 2
• 15-PE-1. 50865 - Apartment Building...
• 15-PE-2. 50866 - Buy the cheapest
• 15-PE-4. 50868 - Sort Frequencies
• 15-PE-5. 50869 - Birthday Celebration
• 15-PE-7. 50871 - Harmonic Mean
• 15-PE-8. 50872 - Top M Grades
• 15-PE2-1. 50980 - The smallest ...
• 15-PE2-2. 50981 - Top popular m-st...
• 15-PE2-2. 50984 - Top m hardworki...
• 15-PE2-2. 51086 - Top popular student
• 15-PE2-3. 50982 - A thief in labyrinth
• 15-PE2-4. 50983 - Course Selection
• 15-PE2-6. 50985 - Books Waiting
• 15-PE2-8. 50987 - Very Looong Queue
• 15-RE-2. 50999 - Overlapping Trips

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
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