Codeforce#331 (Div. 2) A. Wilbur and Swimming Pool(谨以此题来纪念我的愚蠢)
2015-11-20 15:36
387 查看
C
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
output
input
output
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.
题意:输入若干个点判断能否确定一个矩形的面积,矩形平行于坐标轴
开始正常写,提交WA,然后改,始终没能找到错误。最后才发现自己思维太不严谨了
View Code
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.
题意:输入若干个点判断能否确定一个矩形的面积,矩形平行于坐标轴
开始正常写,提交WA,然后改,始终没能找到错误。最后才发现自己思维太不严谨了
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <cmath> using namespace std; int flag,n; struct node { int x,y; }; node a[4]; int main() { while(scanf("%d", &n) != EOF) { flag = 0; int s; for(int i = 0; i < n; i++) scanf("%d%d", &a[i].x, &a[i].y); if(n < 2) flag = 1; else { if(n == 2) { if(a[0].x == a[1].x || a[0].y == a[1].y) { flag = 1; } else { s = abs(a[1].x - a[0].x) * abs(a[1].y - a[0].y); } } else { if ((a[0].x == a[1].x || a[0].y == a[1].y) && (a[0].x == a[2].x || a[0].y == a[2].y) ) //就是落了这个判断条件。。。。。。 s = abs(a[1].x - a[2].x) * abs(a[1].y - a[2].y); else for(int i = 1; i < n; i++) { if(a[0].x == a[i].x || a[0].y == a[i].y) continue; else s = abs(a[0].x - a[i].x) * abs(a[0].y - a[i].y); } } } if(flag) printf("-1\n"); else printf("%d\n",s); } return 0; }
View Code
相关文章推荐
- mongodb 在Linux下的增删改查和用nodejs连接mongodb
- 【转】JMeter基础之——一个简单的性能测试
- Spring、Struts2+Spring+Hibernate整合步骤
- 《需求分析与系统设计》读书笔记之二
- android studio 使用 SVN
- Tomcat中server.xml文件详细配置介绍
- jquery 操作select
- javax.comm初步探索
- smokeping 安装流程
- osg中的矩阵计算
- cookie存取
- GWT+CodeTemplate+TableCreate快速开发
- java 每日习题(七)统计字符串中字母、空格、数字和其它字符的个数
- APP存放路径及log信息
- shader着色器
- Nginx配置https访问
- java学习资源大集锦
- Placement new的用法及用途
- IOS中图形图像处理第一部分:位图图像原图修改
- 24个希腊字母的英文写法