poj 3335(半平面交)
链接:http://poj.org/problem?id=3335 //大牛们常说的测模板题
----------------------------------------------------------------
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 5158 | Accepted: 2061 |
Description
This year, ACM/ICPC World finals will be held in a hall in form of a simple polygon. The coaches and spectators are seated along the edges of the polygon. We want to place a rotating scoreboard somewhere in the hall such that a spectator sitting anywhere on the boundary of the hall can view the scoreboard (i.e., his line of sight is not blocked by a wall). Note that if the line of sight of a spectator is tangent to the polygon boundary (either in a vertex or in an edge), he can still view the scoreboard. You may view spectator's seats as points along the boundary of the simple polygon, and consider the scoreboard as a point as well. Your program is given the corners of the hall (the vertices of the polygon), and must check if there is a location for the scoreboard (a point inside the polygon) such that the scoreboard can be viewed from any point on the edges of the polygon.
Input
The first number in the input line, T is the number of test cases. Each test case is specified on a single line of input in the form n x1 y1 x2 y2 ... xn yn where n (3 ≤ n ≤ 100) is the number of vertices in the polygon, and the pair of integers xi yi sequence specify the vertices of the polygon sorted in order.
Output
The output contains T lines, each corresponding to an input test case in that order. The output line contains either YES or NO depending on whether the scoreboard can be placed inside the hall conforming to the problem conditions.
Sample Input
2
4 0 0 0 1 1 1 1 0
8 0 0 0 2 1 2 1 1 2 1 2 2 3 2 3 0
Sample Output
YES
NO
Source
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <math.h> using namespace std; #define eps 1e-8
#define MAXX 105
typedef struct
{
double x;
double y;
}point; point p[MAXX],s[MAXX]; bool dy(double x,double y) {return x>y+eps; }
bool xy(double x,double y) {return x<y-eps; }
bool dyd(double x,double y){return x>y-eps; }
bool xyd(double x,double y){return x<y+eps; }
bool dd(double x,double y) {return fabs(x-y)<eps; } double crossProduct(point a,point b,point c)
{
return (c.x-a.x)*(b.y-a.y)-(c.y-a.y)*(b.x-a.x);
} point IntersectPoint(point u1,point u2,point v1,point v2)
{
point ans=u1;
double t=((u1.x-v1.x)*(v1.y-v2.y)-(u1.y-v1.y)*(v1.x-v2.x))/
((u1.x-u2.x)*(v1.y-v2.y)-(u1.y-u2.y)*(v1.x-v2.x));
ans.x += (u2.x-u1.x)*t;
ans.y += (u2.y-u1.y)*t;
return ans;
} void cut(point p[],point s[],int n,int &len)
{
point tp[MAXX];
p[n]=p[];
for(int i=; i<=n; i++)
{
tp[i]=p[i];
}
int cp=n,tc;
for(int i=; i<n; i++)
{
tc=;
for(int k=; k<cp; k++)
{
if(dyd(crossProduct(p[i],p[i+],tp[k]),0.0))
s[tc++]=tp[k];
if(xy(crossProduct(p[i],p[i+],tp[k])*
crossProduct(p[i],p[i+],tp[k+]),0.0))
s[tc++]=IntersectPoint(p[i],p[i+],tp[k],tp[k+]);
}
s[tc]=s[];
for(int k=; k<=tc; k++)
tp[k]=s[k];
cp=tc;
}
len=cp;
} int main()
{
int n,m,i,j;
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
for(i=; i<m; i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
int len;
cut(p,s,m,len);
if(len)printf("YES\n");
else printf("NO\n");
}
return ;
}
最新文章
- Spartan Exploit Kit分析
- ElasticSearch部署安装
- php获取网页内容方法总结
- Android:Android SDK Manager顺利下载
- codeforces #313 div1 C
- linux常用命令(4)rm命令
- 【USACO】玉米实验(单调队列)
- angularjs 服务详解
- Python开发【第十篇】:RabbitMQ队列
- 基于阿里云 DNS API 实现的 DDNS 工具
- VSCode typescript ctrl+shift+b can&#39;t be compiled error:TS5007
- Python快速学习02:基本数据类型 &; 序列
- java.lang.StackOverflowError 解决方法
- Bootstrap3基础 page-header 标题下加分割线
- 多臂机测试, AB测试
- Linux移植之配置过程分析
- rtsp实现的开源代码
- jmeter 基础功能详解
- CentOS普通用户没有sudo权限
- 2017-2018-1 20155233 《信息安全系统设计基础》实现mypwd