zoj 1041 Transmitters

原创 2012年03月24日 16:51:48
ZOJ Problem Set - 1041
Transmitters

Time Limit: 2 Seconds      Memory Limit: 65536 KB

In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don't overlap, or at least that they don't conflict. One way of accomplishing this is to restrict a transmitter's coverage area. This problem uses a shielded transmitter that only broadcasts in a semicircle.

A transmitter T is located somewhere on a 1,000 square meter grid. It broadcasts in a semicircular area of radius r. The transmitter may be rotated any amount, but not moved. Given N points anywhere on the grid, compute the maximum number of points that can be simultaneously reached by the transmitter's signal. Figure 1 shows the same data points with two different transmitter rotations.

All input coordinates are integers (0-1000). The radius is a positive real number greater than 0. Points on the boundary of a semicircle are considered within that semicircle. There are 1-150 unique points to examine per transmitter. No points are at the same location as the transmitter.

Input consists of information for one or more independent transmitter problems. Each problem begins with one line containing the (x,y) coordinates of the transmitter followed by the broadcast radius, r. The next line contains the number of points N on the grid, followed by N sets of (x,y) coordinates, one set per line. The end of the input is signalled by a line with a negative radius; the (x,y) values will be present but indeterminate. Figures 1 and 2 represent the data in the first two example data sets below, though they are on different scales. Figures 1a and 2 show transmitter rotations that result in maximal coverage.

For each transmitter, the output contains a single line with the maximum number of points that can be contained in some semicircle.

Example input:

25 25 3.5
7
25 28
23 27
27 27
24 23
26 23
24 29
26 29
350 200 2.0
5
350 202
350 199
350 198
348 200
352 200
995 995 10.0
4
1000 1000
999 998
990 992
1000 999
100 100 -2.5


Example output:

3
4
4

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

主要要有向量的思想,把小于半径的点存下,其余的都不要

//////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include<stdio.h>
struct point
{
	int x,y;
}p[200];
int dis(int x,int y,int x0,int y0)
{
	return (x-x0)*(x-x0)+(y-y0)*(y-y0);
}
int main()
{
	int x,y,x0,y0;
	double r;
	int i,j,k;
	int n,max,ans;
	while(scanf("%d%d%lf",&x,&y,&r)!=EOF)
	{
		if(r<=0)
			break;
		scanf("%d",&n);
		k=0;
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&x0,&y0);
			if(dis(x,y,x0,y0)<=r*r)
			{
				p[k].x=x0;
				p[k].y=y0;
				k++;
			}
		}
		if(k<=1)
		{
			printf("%d\n",k);
			continue;
		}
		max=0;
		for(i=0;i<k;i++)
		{
			ans=0;
			for(j=0;j<k;j++)
			{
				if((p[i].x-x)*(p[j].y-y)-(p[j].x-x)*(p[i].y-y)>=0)//向量叉积
					ans++;
			}
			if(max<ans)
				max=ans;
		}
		printf("%d\n",max);
	}
	return 0;
}


POJ,ZOJ题目分类(多篇整合版,分类很细致,全面)

水题: 3299,2159,2739,1083,2262,1503,3006,2255,3094 初级: 一、基本算法:        (1)枚举 (1753,2965)  ...
  • dg357442101
  • dg357442101
  • 2016年03月13日 14:24
  • 3470

浙大ZOJ 1009 Enigma问题解决及别人的解决方案

教训:在这题上浪费太多次机会了,因为以下几个原因: 1. 没考虑到m(m为轮子字母表的规模)为1的情况,从而导致出现“Floating Point Error”。通过将“if(i!=0&&i%(m-...
  • xiaogugood
  • xiaogugood
  • 2014年01月06日 17:16
  • 1645

2个经典 zoj2314 无源汇有上下界最大流 并输出可行流 ZOJ3229 有源汇上下界最大流

ZOJ Problem Set - 2314 Reactor Cooling Time Limit: 5 Seconds      Memory Limit: 32768 KB      Spe...
  • hnust_xiehonghao
  • hnust_xiehonghao
  • 2013年08月24日 11:36
  • 1663

[ZOJ1041] Transmitters

【题目大意】   发射器的发射范围是一个半圆,圆心半径给出,角度任意。在平面上给出N个点,问发射器最多可以覆盖多少个。 【解题思路】    算夹角,排序,统计。 【源代码】#include #incl...
  • program_shun
  • program_shun
  • 2011年06月15日 20:49
  • 280

ZOJ 1041Transmitters

虽然归属于search problems,但是用简单的方法就可以做了。所有的长度都是double,用int就错了。scanf读取double应该用%lf,用%f g++会读取错误。这种浮点数计算,尽量...
  • zillion217
  • zillion217
  • 2011年09月28日 10:30
  • 144

ZOJ 1041 Transmitters

In a wireless network with multiple transmitters sending on the same frequencies, it is often a requ...
  • zufejsjcy
  • zufejsjcy
  • 2015年04月05日 00:18
  • 125

ZOJ Problem Set - 1041

这个传说中的计算几何,让我搞的话真有点困难,因为神马叉乘判断神马的,以前只是知道名字,具体怎么用从来没有做过,嘿嘿!这算一次尝试吧,自己想了想,感觉应该直接暴力,怕超时,看了看别人的报告,发现居然可以...
  • surfacedust
  • surfacedust
  • 2011年04月05日 20:38
  • 526

POJ 1106 Transmitters(计算几何 极角排序啊)

POJ 1106 Transmitters(计算几何 极角排序啊)
  • u012860063
  • u012860063
  • 2015年05月20日 22:29
  • 794

poj1106Transmitters【求旋转半圆能覆盖的最多点数】

Language: Default Transmitters Time Limit: 1000MS   Memory Limit: 10000K Total S...
  • R1986799047
  • R1986799047
  • 2015年09月18日 23:34
  • 276

J - Transmitters解题报告

J - Transmitters Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Su...
  • princeyuaner
  • princeyuaner
  • 2012年04月22日 19:48
  • 332
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:zoj 1041 Transmitters
举报原因:
原因补充:

(最多只允许输入30个字)