HS12MBR - Minimum Bounding Rectangle
Compute the Minimum Bounding Rectangle (MBR) that surrounds the given set of 2D objects, i.e., the axis-aligned rectangle, which contains all of the specified objects and is the one with minimum area among all rectangles with this property.
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 x1 y1 x2 y2, where xi, yi are the coordinates of the endpoints of the line.
Successive test cases are separated by an empty line.
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 x-coordinate of the lower left corner, then the y-coordinate of the lower left corner, the x-coordinate of the upper right corner and the y-coordinate of upper right corner.
You can assume that all object parameters are integers and that -1000 -1000 1000 1000 is a bounding rectangle for of all of them.
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)
can some one please explain this problem to me i am not able to understand it what we have to do
after many error compilations i got 100pts LOL
how do i take the input for p, c, l;
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: 2018-01-18 17:46:19
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.
I have 20 points and I don't know why. In all my examples it looks okay... Just walking on.
i got 40. what is the maximum points ?
lol I got 100... so its even better than 10 :D?
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
how to do this with c?