Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool

A. Wilbur and Swimming Pool

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

After making bad dives into swimming pools, Wilbur wants to build a swimming pool in the shape of a rectangle in his backyard. He has set up coordinate axes, and he wants the sides of the rectangle to be parallel to them. Of course, the area of the rectangle must be positive. Wilbur had all four vertices of the planned pool written on a paper, until his friend came along and erased some of the vertices.

Now Wilbur is wondering, if the remaining n vertices of the initial rectangle give enough information to restore the area of the planned swimming pool.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 4) — the number of vertices that were not erased by Wilbur's friend.

Each of the following n lines contains two integers xi and yi ( - 1000 ≤ xi, yi ≤ 1000) —the coordinates of the i-th vertex that remains. Vertices are given in an arbitrary order.

It's guaranteed that these points are distinct vertices of some rectangle, that has positive area and which sides are parallel to the coordinate axes.

Output

Print the area of the initial rectangle if it could be uniquely determined by the points remaining. Otherwise, print  - 1.

Sample test(s)

input

2
0 0
1 1

output

1

input

1
1 1

output

-1

Note

In the first sample, two opposite corners of the initial rectangle are given, and that gives enough information to say that the rectangle is actually a unit square.

In the second sample there is only one vertex left and this is definitely not enough to uniquely define the area.

题意：有一个矩形，矩形的边和坐标轴平行，已知n个点求矩形的面积，如果求不出输出-1

题目简单，要仔细看懂题目的意思，才开始做。

直接判断是否存在对角线上的两点，如果存在面积才可以算出，否者不能算。

#include
          
          
           
           
#include
           
           
            
            
#include
            
            
             
             
#include
             
             
              
              
using namespace std;

struct node
{
    int x;
    int y;
}a[10];

int abs(int x)
{
    if(x > 0) return x;
    return -x;
}

int main(void)
{
    int i, j;
    int n;
    scanf("%d", &n);
    int ans = -1;
    for(i = 0; i < n; i++)
    {
        scanf("%d%d", &a[i].x, &a[i].y);
    }
    for(i = 0; i < n; i++)
    {
        for(j = i+1; j < n; j++)
        {
            if(a[i].x != a[j].x && a[i].y != a[j].y)
            {
                ans = abs(a[i].x - a[j].x)*abs(a[i].y - a[j].y);
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}