poj 1474 Video Surveillance (半平面交)

原创 2017年01月03日 09:11:49

Video Surveillance
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 3990   Accepted: 1781


A friend of yours has taken the job of security officer at the Star-Buy Company, a famous depart- ment store. One of his tasks is to install a video surveillance system to guarantee the security of the customers (and the security of the merchandise of course) on all of the store's countless floors. As the company has only a limited budget, there will be only one camera on every floor. But these cameras may turn around to look in every direction. 

The first problem is to choose where to install the camera for every floor. The only requirement is that every part of the room must be visible from there. In the following figure the left floor can be completely surveyed from the position indicated by a dot, while for the right floor, there is no such position, the given position failing to see the lower left part of the floor. 

Before trying to install the cameras, your friend first wants to know whether there is indeed a suitable position for them. He therefore asks you to write a program that, given a ground plan, de- termines whether there is a position from which the whole floor is visible. All floor ground plans form rectangular polygons, whose edges do not intersect each other and touch each other only at the corners. 


The input contains several floor descriptions. Every description starts with the number n of vertices that bound the floor (4 <= n <= 100). The next n lines contain two integers each, the x and y coordinates for the n vertices, given in clockwise order. All vertices will be distinct and at corners of the polygon. Thus the edges alternate between horizontal and vertical. 

A zero value for n indicates the end of the input.


For every test case first output a line with the number of the floor, as shown in the sample output. Then print a line stating "Surveillance is possible." if there exists a position from which the entire floor can be observed, or print "Surveillance is impossible." if there is no such position. 

Print a blank line after each test case.

Sample Input

0 0
0 1
1 1
1 0
0 0
0 2
1 2
1 1
2 1
2 2
3 2
3 0

Sample Output

Floor #1
Surveillance is possible.

Floor #2
Surveillance is impossible.


[Submit]   [Go Back]   [Status]   [Discuss]



#define N 203
#define eps 1e-8
#define inf 1000000000
using namespace std;
struct vector {
	double x,y;
	vector (double X=0,double Y=0){
int n,m;
typedef vector point;
vector operator -(vector a,vector b){
	return vector (a.x-b.x,a.y-b.y);
vector operator +(vector a,vector b){
	return vector (a.x+b.x,a.y+b.y);
vector operator *(vector a,double t){
	return vector (a.x*t,a.y*t);
void init()
double cross(vector a,vector b)
	return a.x*b.y-a.y*b.x;
point glt(point a,point a1,point b,point b1)
	vector v=a1-a; vector w=b1-b;
	vector u=a-b;
	double t=cross(w,u)/cross(v,w);
	return a+v*t;
void cut(point a,point b)
	int cnt=0;
	point tmp[N];
	for (int i=0;i<m;i++){
		double c=cross(b-a,p[i]-a);
		double d=cross(b-a,p[(i+1)%m]-a);
		if (c>=0) tmp[cnt++]=p[i];
		if (c*d<0)
	for (int i=0;i<cnt;i++) p[i]=tmp[i];
int main()
	int t=0;
	while (true){
		if (!n) break;
		for (int i=1;i<=n;i++) scanf("%lf%lf",&a[i].x,&a[i].y);
		for (int i=2;i<=n+1;i++){
			if (!m) break;
		printf("Floor #%d\n",t);
		if (m) printf("Surveillance is possible.\n");
		else printf("Surveillance is impossible.\n");

版权声明:本文为博主原创文章,未经博主允许不得转载。 http://blog.csdn.net/clover_hxy/article/details/53991330

POJ 1474 Video Surveillance(半平面交)

和POJ3335几乎一样。。 //poj1474 #include #include #include #include #include #include #include #inc...
  • u013112097
  • u013112097
  • 2014年06月23日 18:20
  • 251

POJ 1474 || Video Surveillance(半平面交

拿上一题代码改一下直接就过了,躶题233 我连题目都没看 看着题目的配图感觉都是那个意思,随便一交就AC了。66666.。。。 #include #include #include #incl...
  • 2015年05月09日 20:45
  • 358

poj 1474 半平面交求多边形的核

【题意】 是否能在房间中找到一个位置来安装摄像头,使摄像头能监控到房间的每个角落。在平面图上,房间的墙只有横和竖的,没有斜的。 【题解】 判断多边形是否存在核。用半平面交判断。 【代码】 ...
  • ascii991
  • ascii991
  • 2012年05月03日 13:55
  • 1085

poj 1474 Video Surveillance(半平面交)

基本和poj 3335一样。。。 #include #include #include #include #include #include #include #include #include ...
  • crazy852456
  • crazy852456
  • 2013年09月02日 19:19
  • 536

poj 1474 Video Surveillance 半平面交

Video Surveillance Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3963...
  • yskyskyer123
  • yskyskyer123
  • 2016年11月10日 22:37
  • 213

POJ 1474 Video Surveillance

POJ 1474 Video Surveillance 半平面交模板。。。 就是拿来测试的。。。。 #include #include #include #include #includ...
  • utoppia
  • utoppia
  • 2013年08月22日 11:30
  • 552

POJ 1474 Video Surveillance (半平面交判断)

Video Surveillance Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3612...
  • helloiamclh
  • helloiamclh
  • 2015年12月14日 22:19
  • 207

POJ 1474 Video Surveillance -

题目地址:http://poj.org/problem?id=1474 半平面交的典型题目,模板直接上,但要注意题目中点的方向是顺时针给出的,要变为逆时针 #include #include #inc...
  • qq_34446253
  • qq_34446253
  • 2016年08月04日 11:48
  • 125

Video Surveillance POJ - 1474

A friend of yours has taken the job of security officer at the Star-Buy Company, a famous depart- me...
  • yyxiangyu
  • yyxiangyu
  • 2017年09月27日 20:01
  • 58

POJ 1474 Video Surveillance 笔记

  • woniupengpeng
  • woniupengpeng
  • 2017年06月20日 09:54
  • 45
您举报文章:poj 1474 Video Surveillance (半平面交)