POJ 2007:Scrambled Polygon (极角排序)
来源:互联网 发布:网络教育大专学费 编辑:程序博客网 时间:2024/05/18 03:45
Scrambled Polygon
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8457 Accepted: 4019
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".)
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.
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".)
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.
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 070 -5060 30-30 -5080 2050 -6090 -20-30 -40-10 -6090 10
Sample Output
(0,0)(-30,-40)(-30,-50)(-10,-60)(50,-60)(70,-50)(90,-20)(90,10)(80,20)(60,30)
题意:给出一些点,将这些点进行极角排序后输出
AC代码:
#include <iostream>#include<stdio.h>#include<algorithm>using namespace std;struct point{ int x; int y;} p[10010];bool camp(point a,point b){ if((a.x*b.y-a.y*b.x)>0) return true; return false;}int main(){ int n=0,i; while(~scanf("%d %d",&p[n].x,&p[n].y)) { n++; } sort(p+1,p+n,camp); for(i=0; i<n; i++) printf("(%d,%d)\n",p[i].x,p[i].y); return 0;}
1 0
- poj 2007 Scrambled Polygon 极角排序
- POJ 2007 Scrambled Polygon(极角排序)
- POJ 2007 Scrambled Polygon 极角排序
- poj 2007 Scrambled Polygon [极角排序]
- POJ 2007 Scrambled Polygon 极角排序
- poj 2007 Scrambled Polygon 【极角排序】
- POJ 2007 Scrambled Polygon(极角排序)
- POJ 2007 Scrambled Polygon (极角排序)
- poj 2007 Scrambled Polygon(极角排序)
- POJ 2007 Scrambled Polygon(简单极角排序)
- POJ 2007:Scrambled Polygon (极角排序)
- POJ 2007 Scrambled Polygon(点的极角排序)
- POJ 2007 Scrambled Polygon (极角排序+叉乘)
- HDU-2007 Scrambled Polygon 极角排序
- PKU 2007 Scrambled Polygon 极角排序
- Scrambled Polygon (极角排序)
- poj2007-Scrambled Polygon (极角排序)
- poj Scrambled Polygon 2007 (凸包基础点排序)
- HDU 5895 Mathematician QSC(矩阵乘法+循环节降幂+除法取模小技巧+快速幂)——2016 ACM/ICPC Asia Regional Shenyang Online
- Ubuntu下误删或者误改mysql的root用户信息,解决方法
- 使用openlayers3自带的功能,使用WFS对geoserver服务器进行空间查询
- Spring IOC
- n从1开始,每一个可以选择对n加1或者对n加倍,若想获得整数2013,最少需要多少个操作
- POJ 2007:Scrambled Polygon (极角排序)
- 欢迎使用CSDN-markdown编辑器
- thinkphp实现发送邮件密码找回功能实例
- 如何面试前端工程师:GitHub 很重要
- 几种简单的随机数算法
- spring4+springmvc+hibernate5的maven整合
- 赛码解题报告(三)
- 漫步线性代数二十五——特征值和特征向量
- Android OkHttp框架解析