Wilbur and Swimming Pool

Wilbur and Swimming Pool
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

CodeForces 596A
Appoint description:
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

根据题意，矩形的边一定平行于坐标轴，所以不需要想太多：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
	int x,y;
}zhi[10];
int main()
{
	int n,area;
	int maxx=-1010,maxy=-1010,minx=1010,miny=1010;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d%d",&zhi[i].x,&zhi[i].y);
		maxx=max(maxx,zhi[i].x);
		maxy=max(maxy,zhi[i].y);
		minx=min(minx,zhi[i].x);
		miny=min(miny,zhi[i].y);
	}
	area=(maxx-minx)*(maxy-miny);
	if(area)
	printf("%d\n",area);
	else
	printf("-1\n");
	return 0;
}