Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden on 2015-09-08 19:39:23 by kuszi

GARDENHU - Garden Hull

no tags 

We have a garden with trees in it. For each tree is represented by x and y coordinates. Your goal is to find the least amount of net needed to surround all the trees so that all trees are inside the net. In other words you need to find the the length of the convex hull around those points.


On the first line a lonely integer N (3 <= N <= 10000) representing the number of trees in the garden. On each of the following N lines you will find two integers - the coordinates of the next tree.


A single integer - the length of the convex hull. Round it up to an integer.


0 0
5 0 
1 1
0 5


hide comments
gautams: 2015-08-19 17:12:43

Question unclear... what to do with area if actual area comes to 17.55(for example)??

arunpatala: 2015-08-01 10:13:12

so if rounding up, isnt the answer 18

Haidar Abboud: 2014-03-13 04:03:53


VilimL: 2012-06-21 11:57:51

"to round up" means "to get it rounded"

~!(*(@*!@^&: 2009-03-19 05:15:18

Thanks for a nice problem. It is very good for newbie.

You misunderstood the question : It ask "Round it up to an integer" not "Round it to the nearest integer".

Last edit: 2009-04-08 01:44:54

Added by:Nikola P Borisov
Time limit:0.270s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Fall Bulgarian National Contest 2003