POJ1279Art Gallery
来源:互联网 发布:安徽网络作家协会申请 编辑:程序博客网 时间:2024/05/21 23:35
题意:依旧是裸半平面交题,用叉积求一下面就可以了
写法还是借鉴kuangbin大神http://www.cnblogs.com/kuangbin/p/3266097.html O(nlogn)的写法
注意点在精度上%lf硬是WA WA WA WA哇。。。。%f才A的
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>using namespace std;const double eps = 1e-8;const double PI = acos(-1.0);int sgn(double x){ if(fabs(x) < eps) return 0; if(x < 0) return -1; else return 1;}struct Point{ double x,y; Point(){} Point(double _x,double _y) { x = _x; y = _y; } Point operator -(const Point &b)const { return Point(x - b.x, y - b.y); } double operator ^(const Point &b)const { return x*b.y - y*b.x; } double operator *(const Point &b)const { return x*b.x + y*b.y; }};struct Line{ Point s,e; double k; Line(){} Line(Point _s,Point _e) { s = _s; e = _e; k = atan2((e.y - s.y),(e.x - s.x)); } Point operator &(const Line &b)const { Point res = s; double t = ((s - b.s)^(b.s - b.e))/((s - e)^(b.s - b.e)); res.x += (e.x - s.x)*t; res.y += (e.y - s.y)*t; return res; }};//半平面交,直线的左边代表有效区域bool HPIcmp(Line a,Line b){ if(fabs(a.k - b.k) > eps)return a.k < b.k; return ((a.s - b.s)^(b.e - b.s)) < 0;}Line Q[1505];void HPI(Line line[], int n, Point res[], int &resn){ int tot = n; sort(line,line+n,HPIcmp); tot = 1; for(int i = 1;i < n;i++) if(fabs(line[i].k - line[i-1].k) > eps) line[tot++] = line[i]; int head = 0, tail = 1; Q[0] = line[0]; Q[1] = line[1]; resn = 0; for(int i = 2; i < tot; i++) { if(fabs((Q[tail].e-Q[tail].s)^(Q[tail-1].e-Q[tail-1].s)) < eps || fabs((Q[head].e-Q[head].s)^(Q[head+1].e-Q[head+1].s)) < eps) return; while(head < tail && (((Q[tail]&Q[tail-1]) - line[i].s)^(line[i].e-line[i].s)) > eps) tail--; while(head < tail && (((Q[head]&Q[head+1]) - line[i].s)^(line[i].e-line[i].s)) > eps) head++; Q[++tail] = line[i]; } while(head < tail && (((Q[tail]&Q[tail-1]) - Q[head].s)^(Q[head].e-Q[head].s)) > eps) tail--; while(head < tail && (((Q[head]&Q[head-1]) - Q[tail].s)^(Q[tail].e-Q[tail].e)) > eps) head++; if(tail <= head + 1)return; for(int i = head; i < tail; i++) res[resn++] = Q[i]&Q[i+1]; if(head < tail - 1) res[resn++] = Q[head]&Q[tail];}Point p[1505];Line line[1505];double xmult(Point p0,Point p1,Point p2){/*p0p1 X p0p2*/ return (p1-p0)^(p2-p0);}int main(){ int n; int t; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i = 0;i < n;i++) scanf("%lf%lf",&p[i].x,&p[i].y); reverse(p,p+n); for(int i = 0;i < n;i++) { line[i] = Line(p[i],p[(i+1)%n]); } int resn; double area=0.0; HPI(line,n,p,resn); for(int i=1;i<resn;i++) area+=xmult(p[0],p[i],p[(i+1)%resn]); if(resn<3) area=0; if(area<0) area=-area; printf("%.2f\n",area/2.0); } return 0;}
阅读全文
1 0
- poj1279Art Gallery
- POJ1279Art Gallery
- poj1279Art Gallery【半平面交求内核面积】
- Gallery
- Gallery
- Gallery
- gallery
- gallery
- Gallery
- gallery
- Gallery
- Gallery
- Gallery
- Gallery
- Gallery
- Gallery
- gallery
- gallery
- 数位dp汇总
- 体验升级,阿里云过保迁移不变公网IP
- 用SpringMVC开发RESTful风格API接口
- Android调整屏幕亮度和改变屏幕亮度调整模式的代码
- stm32 SPI-FLASH W25Q64
- POJ1279Art Gallery
- css中样式属性的获取
- c#调试
- c# asp.net NPOI 使用本地模板导出excel
- 新旧版本spring
- effective C++条款二十三解读
- 程序员面试金典(8):翻转子串(python)
- Neither BindingResult nor plain target object for bean name 'command' available as request attribut
- VS2015中#if DEBUG的使用(C#)