CodeForces - 596A Wilbur and Swimming Pool (模拟)
来源:互联网 发布:手机qq网络连接不可用 编辑:程序博客网 时间:2024/05/21 06:18
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
20 01 1
1
11 1
-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.
Source
#include<stdio.h>#include<string.h>#include<algorithm>#define INF 0x3f3f3f3f#define ll long long#define N 10010#define M 1000000007#define PI acos(-1.0)using namespace std;struct zz{int x;int y;}p[5];int cmp(zz a,zz b){if(a.x==b.x)return a.y<b.y;return a.x<b.x;}int main(){int i,j,k;int n,m;while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++)scanf("%d%d",&p[i].x,&p[i].y);sort(p,p+n,cmp);if(n==1)printf("-1\n");else if(n==2){int y=abs(p[1].y-p[0].y);int x=abs(p[1].x-p[0].x);if(x==0||y==0)printf("-1\n");elseprintf("%d\n",x*y);}else if(n==3){int x=p[2].x-p[0].x;int y=max(abs(p[2].y-p[0].y),abs(p[1].y-p[0].y));if(x==0||y==0)printf("-1\n");elseprintf("%d\n",x*y);}else{int x=abs(p[3].x-p[0].x);int y=abs(p[3].y-p[0].y);if(x==0||y==0)printf("-1\n");elseprintf("%d\n",x*y);}}return 0;}
- CodeForces - 596A Wilbur and Swimming Pool (模拟)
- CodeForces 596A--Wilbur and Swimming Pool
- CodeForces 596A-Wilbur and Swimming Pool
- Codeforces 596A Wilbur and Swimming Pool 【水题】
- Codeforces--596A--Wilbur and Swimming Pool(数学)
- CodeForces 596 A Wilbur and Swimming Pool【数学】
- CodeForces 596A:Wilbur and Swimming Pool【水】
- 596A Wilbur and Swimming Pool
- A. Wilbur and Swimming Pool
- Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool
- Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool
- CF 596A. Wilbur and Swimming Pool 【计算矩形面积】
- CF--A. Wilbur and Swimming Pool
- cf A. Wilbur and Swimming Pool
- Wilbur and Swimming Pool
- Codeforces Round #331 (Div. 2)-Wilbur and Swimming Pool(模拟)
- Codeforces Round #331 (Div. 2)A. Wilbur and Swimming Pool(简单计算)
- Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool (判断组成最大矩形)
- 关于中断上下文为什么不能睡眠?
- shell命令-文件系统的空间信息->df du
- Codeforces--597A--Divisibility(数学)
- Django使用第三方接口(一)
- 初识Java正则表达式
- CodeForces - 596A Wilbur and Swimming Pool (模拟)
- shell命令-awk
- ExtJS学习(四)EditorGrid可编辑表格
- Intent和IntentFilter详解
- 第一次上机实验-2
- 取整函数和夹逼准则_20160310
- 再思linux内核在中断路径内不能睡眠/调度的原因(2010)
- 牛顿迭代法求方根
- 欢迎使用CSDN-markdown编辑器