Johny the farmer

Problem code: E3

All submissions for this problem are available.

Johny the Farmer has decided to plant potatoes. He quickly realized that he must build a net fence to keep animals from eating his precious plantation. But he only has 3 sticks which can act as vertical poles supporting fence; on the other hand, his supply of net is unlimited. Moreover, since the ground is extremely rocky, the poles can only be positioned in some special places on the field. So, he has decided that the fence must be triangular in shape, with vertices in the distinguished points. Quite naturally, he would also like to maximize the area of the field inside fence -- please help him achieve this goal!

Task

Write a program which:

  • reads from the input the coordinates of the points which can hold the poles,
  • calculates the maximal possible area of the potato plantation.

Input

First, an integer t, representing the number of test cases.

Each test case starts with an integer n (n 106). In each of the next n lines there is pair of integers separated by spaces, xi, yi, which are the coordinates for i-th point where a pole can potentially be located (0 xi,yi 10000).

Output

For each test case output a single integer - the area of the field surrounded by the fence, multiplied by 2.

Example

Input
1
5
0 0
1 0 
0 1
1 2
1 1

Output
2
Date: 2009-06-05
Time limit: 1s
Source limit: 50000
Languages: C C99 strict C++ PAS gpc PAS fpc JAVA NICE JAR C# C#2 NEM ST ASM D FORT ADA BASH PERL PYTH RUBY LUA ICON PIKE PHP SCM guile SCM qobi LISP sbcl LISP clisp HASK CAML CLPS PRLG WSPC BF ICK TEXT


Comments

saurshaz @ 18 Jul 2009 12:08 AM

It works at my end .. but says LTE over here... have tried optimizing ... also.. :(

saurshaz @ 18 Jul 2009 12:09 AM

srry it was TLE not LTE

saurshaz @ 18 Jul 2009 12:10 AM

what is the time limt and for how many test cases ?

admin 2 @ 18 Jul 2009 12:11 AM

The test cases have been uploaded on the blog. Please check it out for further information. http://blog.codechef.com

ye to kisi se nahi hone wala

qrohit @ 8 Oct 2009 03:57 PM

ye to kisi se nahi hone wala

Are aise kaise nahi

Krazzy Koder @ 26 Feb 2010 07:31 PM

Are aise kaise nahi hoga??

Just give me a single night and i will b der with the code.....

@admin : Is d following

AnoopNarang @ 30 May 2010 05:00 AM

@admin : Is d following question totally Updated??

sorry d above question??

AnoopNarang @ 30 May 2010 06:51 PM

sorry d above question??

sorry d above question??

AnoopNarang @ 30 May 2010 06:52 PM

sorry d above question??

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

HELP

Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

 

  • Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
  • Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
  • Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
  • Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
  • Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

    • If you are still having problems, see a sample solution here.

CodeChef is a global programming communityCodeChef hosts online programming competitions