POJ2007 Scrambled Polygon 凸多边形顶点输出
2016-07-27 20:14
549 查看
Description
A closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a closed polygon and traverses each bounding line segment exactly
once, one comes back to the starting vertex.
A closed polygon is called convex if the line segment joining any two points of the polygon lies in the polygon. Figure 1 shows a closed polygon which is convex and one which is not convex. (Informally, a closed polygon is convex if its border doesn't have
any "dents".)
![](http://poj.org/images/2007_1.jpg)
The subject of this problem is a closed convex polygon in the coordinate plane, one of whose vertices is the origin (x = 0, y = 0). Figure 2 shows an example. Such a polygon will have two properties significant for this problem.
The first property is that the vertices of the polygon will be confined to three or fewer of the four quadrants of the coordinate plane. In the example shown in Figure 2, none of the vertices are in the second quadrant (where x < 0, y > 0).
To describe the second property, suppose you "take a trip" around the polygon: start at (0, 0), visit all other vertices exactly once, and arrive at (0, 0). As you visit each vertex (other than (0, 0)), draw the diagonal that connects the current vertex with
(0, 0), and calculate the slope of this diagonal. Then, within each quadrant, the slopes of these diagonals will form a decreasing or increasing sequence of numbers, i.e., they will be sorted. Figure 3 illustrates this point.
![](http://poj.org/images/2007_2.jpg)
![](http://poj.org/images/2007_3.jpg)
Input
The input lists the vertices of a closed convex polygon in the plane. The number of lines in the input will be at least three but no more than 50. Each line contains the x and y coordinates of one vertex. Each x and y coordinate is an integer in the range -999..999.
The vertex on the first line of the input file will be the origin, i.e., x = 0 and y = 0. Otherwise, the vertices may be in a scrambled order. Except for the origin, no vertex will be on the x-axis or the y-axis. No three vertices are colinear.
Output
The output lists the vertices of the given polygon, one vertex per line. Each vertex from the input appears exactly once in the output. The origin (0,0) is the vertex on the first line of the output. The order of vertices in the output will determine a trip
taken along the polygon's border, in the counterclockwise direction. The output format for each vertex is (x,y) as shown below.
Sample Input
Sample Output
Source
Rocky Mountain 2004
用叉积排序即可。
#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long LL;
struct CVector{
int x,y;
CVector(int xx,int yy):x(xx),y(yy){}
CVector(){}
int operator ^ (const CVector &p) const{
return p.y*x-p.x*y;
}
}point[60];
CVector operator - (CVector p,CVector q)
{
return CVector(p.x-q.x,p.y-q.y);
}
bool operator < (const CVector &p, const CVector &q)
{
return (CVector(q-CVector(0,0))^CVector(p-CVector(0,0)))>0;
}
int main()
{
int n=0;
while (~scanf("%d%d",&point
.x,&point
.y)){
n++;
}
sort(point+1,point+n);
printf("(0,0)\n");
for(int i=n-1;i>0;i--){
printf("(%d,%d)\n",point[i].x,point[i].y);
}
return 0;
}
A closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a closed polygon and traverses each bounding line segment exactly
once, one comes back to the starting vertex.
A closed polygon is called convex if the line segment joining any two points of the polygon lies in the polygon. Figure 1 shows a closed polygon which is convex and one which is not convex. (Informally, a closed polygon is convex if its border doesn't have
any "dents".)
![](http://poj.org/images/2007_1.jpg)
The subject of this problem is a closed convex polygon in the coordinate plane, one of whose vertices is the origin (x = 0, y = 0). Figure 2 shows an example. Such a polygon will have two properties significant for this problem.
The first property is that the vertices of the polygon will be confined to three or fewer of the four quadrants of the coordinate plane. In the example shown in Figure 2, none of the vertices are in the second quadrant (where x < 0, y > 0).
To describe the second property, suppose you "take a trip" around the polygon: start at (0, 0), visit all other vertices exactly once, and arrive at (0, 0). As you visit each vertex (other than (0, 0)), draw the diagonal that connects the current vertex with
(0, 0), and calculate the slope of this diagonal. Then, within each quadrant, the slopes of these diagonals will form a decreasing or increasing sequence of numbers, i.e., they will be sorted. Figure 3 illustrates this point.
![](http://poj.org/images/2007_2.jpg)
![](http://poj.org/images/2007_3.jpg)
Input
The input lists the vertices of a closed convex polygon in the plane. The number of lines in the input will be at least three but no more than 50. Each line contains the x and y coordinates of one vertex. Each x and y coordinate is an integer in the range -999..999.
The vertex on the first line of the input file will be the origin, i.e., x = 0 and y = 0. Otherwise, the vertices may be in a scrambled order. Except for the origin, no vertex will be on the x-axis or the y-axis. No three vertices are colinear.
Output
The output lists the vertices of the given polygon, one vertex per line. Each vertex from the input appears exactly once in the output. The origin (0,0) is the vertex on the first line of the output. The order of vertices in the output will determine a trip
taken along the polygon's border, in the counterclockwise direction. The output format for each vertex is (x,y) as shown below.
Sample Input
0 0 70 -50 60 30 -30 -50 80 20 50 -60 90 -20 -30 -40 -10 -60 90 10
Sample Output
(0,0) (-30,-40) (-30,-50) (-10,-60) (50,-60) (70,-50) (90,-20) (90,10) (80,20) (60,30)
Source
Rocky Mountain 2004
用叉积排序即可。
#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long LL;
struct CVector{
int x,y;
CVector(int xx,int yy):x(xx),y(yy){}
CVector(){}
int operator ^ (const CVector &p) const{
return p.y*x-p.x*y;
}
}point[60];
CVector operator - (CVector p,CVector q)
{
return CVector(p.x-q.x,p.y-q.y);
}
bool operator < (const CVector &p, const CVector &q)
{
return (CVector(q-CVector(0,0))^CVector(p-CVector(0,0)))>0;
}
int main()
{
int n=0;
while (~scanf("%d%d",&point
.x,&point
.y)){
n++;
}
sort(point+1,point+n);
printf("(0,0)\n");
for(int i=n-1;i>0;i--){
printf("(%d,%d)\n",point[i].x,point[i].y);
}
return 0;
}
相关文章推荐
- history.back(-1)和history.go(-1)的区别
- 使用Google ZXing实现二维码的扫描和生成相关功能体系
- 第2课 Go类型、变量、常量、运算符
- 如何使用Leangoo自动生成燃尽图
- go语言json操作指南
- django--静态文件(九)
- Google推荐的图片加载库Glide介绍
- 【Django】git建仓上传时遇到的小问题
- Google官方下拉刷新组件SwipeRefreshLayout
- Django实际站点项目开发经验谈
- Go语言接口定义与用法示例
- hdu-1533 Going Home(最小费用最大流)
- POJ - 3622/USACO - Dec07 Gold Gourmet Grazers 挑剔的美食家 重庆一中高2018级竞赛班第五次测试 2016.7.26 Problem 4
- 灰度世界算法(Gray World Algorithm)
- django 快速实现完整登录系统(cookie)
- Go语言基础学习教程
- Django中templates使用的补充
- Go语言函数学习教程
- Go语言eclipse环境搭建图文教程
- ubuntu下安装sogou输入法和consolas字体