Problem hidden on 2014-11-05 11:54:59 by Francky
ACMNSIT3 - Problem 3
Given N points on the cartesian plane, find the perimeter and area of the convex hull.
Input
The first line contains a single integer N. Next N lines contains the x and y coordinates of the points one per line.
Output
Print two integers - perimeter and area of convex hull. Round up both to the nearest integer.
Example
Input: 4
2 3
6 9
5 5
2 3 Output: 14 10
Contraints:
3 <= N <= 106
0 <= x, y <= 104
hide comments
|
Min_25:
2014-11-05 10:07:17
@Nikunj Jain
|
Added by: | Nikunj Jain |
Date: | 2013-03-13 |
Time limit: | 1s-2s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | ASM32-GCC MAWK BC C-CLANG C NCSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JAVA JS-MONKEY JULIA KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |
Resource: | Vaibhav Mittal |