# 【CodeForces 596A】E - 特别水的题5-Wilbur and Swimming Pool

Description

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 Input

Input

2 0 0 1 1

Output

1

Input

1 1 1

Output

-1

Hint

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.

```#include<stdio.h>
#include<algorithm>
using namespace std;
long long n,area,xmin=1001,ymin=1001,xmax=-1001,ymax=-1001;
struct Node
{
long long x,y;
} node[5];
int main()
{
scanf("%lld",&n);
for(int i=0; i<n; i++)
{
scanf("%lld%lld",&node[i].x,&node[i].y);
xmax=max(xmax,node[i].x);
xmin=min(xmin,node[i].x);
ymax=max(ymax,node[i].y);
ymin=min(ymin,node[i].y);
}
area=(ymax-ymin)*(xmax-xmin);
if(area)printf("%lld\n",area);
else printf("-1\n");
return 0;
}```

0 条评论

• ### 【CodeForces 602C】H - Approximating a Constant Range（dijk）

In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional rai...

• ### 【Gym 100733D】Little thief Shi（取数，DP）

Shi realized that he was almost out of money, even renting Shitalian lands. Shi ...

• ### 【CodeForces 605A】BUPT 2015 newbie practice #2 div2-E - Sorting Railway Cars

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=102419#problem/E

• ### 周练19.11.03/10

它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。

• ### IOS5开发-控件位置适应屏幕旋转代码

- (void)willRotateToInterfaceOrientation:(UIInterfaceOrientation)toOrientation  ...

• ### 【CodeForces 602C】H - Approximating a Constant Range（dijk）

In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional rai...

• ### Ceph用户邮件列表Vol45-Issue3

https://git.kernel.org/cgit/linux/kernel/git/torvalds/linux.git/commit/?id=af5e5...

• ### Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)(A.暴力，B.优先队列，C．dp乱搞)

A. Carrot Cakes time limit per test：1 second memory limit per test：256 megabytes...

• ### 阅读理解中的常识证据生成与注入（CS AI)

人类的阅读理解不仅基于特定的语境本身，而且往往依赖于超出语境的常识。为了使机器具有常识推理能力，本文提出了一个阅读理解中的常识证据生成与注入框架CEGI。该框架...