A. Wilbur and Swimming Pool
来源:互联网 发布:欧元区通胀数据 编辑:程序博客网 时间:2024/05/29 18:16
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.
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.
Print the area of the initial rectangle if it could be uniquely determined by the points remaining. Otherwise, print - 1.
20 01 1
1
11 1
-1
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<cstdio>#include <cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>using namespace std;int main(){ int n,i,j,a[2003],b[2003],l,ba,area; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d %d",&a[i],&b[i]); } if(n==1) {printf("-1\n");return 0; } for(i=0;i<n;i++) {for(j=i+1;j<n;j++){if((a[i] != a[j]) && (b[i] != b[j])){l=abs(a[i]-a[j]);ba=abs(b[i]-b[j]);area=l*ba;printf("%d\n",area);return 0;}} } printf("-1\n"); return 0;}
- A. Wilbur and Swimming Pool
- CF--A. Wilbur and Swimming Pool
- cf A. Wilbur and Swimming Pool
- 596A Wilbur and Swimming Pool
- CodeForces 596A--Wilbur and Swimming Pool
- CodeForces 596A-Wilbur and Swimming Pool
- Wilbur and Swimming Pool
- Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool
- Codeforces 596A Wilbur and Swimming Pool 【水题】
- Codeforces Round #331 (Div. 2) A. 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【水】
- CF 596A. Wilbur and Swimming Pool 【计算矩形面积】
- Wilbur and Swimming Pool(矩形求面积)
- Codeforces Round #331 (Div. 2)A. Wilbur and Swimming Pool(简单计算)
- Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool (判断组成最大矩形)
- 史上最全的CSS hack方式一览
- Cordova android框架详解
- appStore上传苹果应用程序软件发布流程
- PAT乙级——1006 部分A+B (C/C++)
- 支持ECSHOP 2.73手机客户端
- A. Wilbur and Swimming Pool
- fread
- E-R模型简介
- UVA 10763 - Foreign Exchange【排序】
- fb --- ioctl()赏析
- Word 2013 题注的默认格式
- 棋盘覆盖问题、半数集问题算法解析-C语言
- 一二三
- PAT乙级——1007 A除以B (C/C++)