HS12MBR  Minimum Bounding Rectangle
Compute the Minimum Bounding Rectangle (MBR) that surrounds the given set of 2D objects, i.e., the axisaligned rectangle, which contains all of the specified objects and is the one with minimum area among all rectangles with this property.
Input
First, you are given t (t<100)  the number of test cases.
Each of the test cases starts with one integer n (n < 100)  the number of objects in the set. In the successive n lines, the descriptions of the objects follow.
Each object is described by one character and some parameters:
 a point: p x y, where x and y are point coordinates.
 a circle: c x y r, where x and y are the center coordinates and r is the radius of the circle.
 a line segment: l x_{1} y_{1} x_{2} y_{2}, where x_{i}, y_{i} are the coordinates of the endpoints of the line.
Successive test cases are separated by an empty line.
Output
For each of the test cases output four numbers  the coordinates of the two points that correspond to the lower left and the upper right corner of the MBR, in the following order: first the xcoordinate of the lower left corner, then the ycoordinate of the lower left corner, the xcoordinate of the upper right corner and the ycoordinate of upper right corner.
You can assume that all object parameters are integers and that 1000 1000 1000 1000 is a bounding rectangle for all of them.
Example
Input: 3 1 p 3 3 2 c 10 10 20 c 20 20 10 1 l 0 0 100 20 Output: 3 3 3 3 10 10 30 30 0 0 100 20
Test case description
test 1: points only (2 pts) test 2: circles only (2 pts) test 3: lines only (2 pts) test 4: mixed (2 pts) test 5: mixed (2 pts)
hide comments
shivama5tronot:
20190516 08:44:59
can some one please explain this problem to me i am not able to understand it what we have to do 

baobao1702:
20190401 10:58:41
after many error compilations i got 100pts LOL 

aquib_ansari:
20180626 15:18:54
how do i take the input for p, c, l;


gbrl97:
20180118 17:45:41
Every time i get different score: 20, 40, 60. Something is wrong with tests because i tested my code with mixed objects and seems correct. Last edit: 20180118 17:46:19 

BartĀ³omiej W:
20171106 15:24:52
Maximum number of points for this problem is 100  tests are divided into 5 categories, as is stated in problem description, but for each category you get 20, not 2, points, so e.g. if you get 40 points then program successfully ran through first two categories, but has problem calculating MBR for lines.


ano302:
20170917 07:39:05
I have 20 points and I don't know why. In all my examples it looks okay... Just walking on.


kejriwal_pk:
20170725 18:53:30
i got 40. what is the maximum points ?


adrian_kurzeja:
20170630 15:53:40
lol I got 100... so its even better than 10 :D? 

gabe3491:
20170609 20:32:35
it shows 0 in result and 0 in mem and time also ,that too in black background and in the menu it shows that i have solved the problem correctly.what does it mean..??anyone 

shivam_mnnit:
20170505 08:56:21
how to do this with c?

Added by:  kuszi 
Date:  20120909 
Time limit:  0.200s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 NODEJS PY_NBC 
Resource:  High School Programming League 