ZOJ1041 Transmitters

原创 2015年07月09日 18:58:06

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 <bits/stdc++.h>
using namespace std;
const int N = 205;

int x, y;
double r;
int n;

int ax[N],ay[N];

int num1,num2;

void fun(int i,int j)
{
    int tmp=(ax[i]-x)*(ay[j]-y)-(ax[j]-x)*(ay[i]-y);
     //两个向量的叉积,a=(x1,y1) b=(x2,y2)
     //c=a X b=x1*y2-x2*y1
     //如果c>0,表示向量a逆时针到向量b小于PI
     //如果c<0,表示向量a顺时针到向量b小于PI
    if(tmp==0)
    {
        num1++;
        num2++;
    }
    else if(tmp>0)
    num1++;
    else
    num2++;
}

int main()
{
    while(~scanf("%d%d%lf",&x,&y,&r))
    {
        if(r<0) break;

        scanf("%d",&n);
        int cnt=0;
        int a,b;

        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&a,&b);
            if((a-x)*(a-x)+(b-y)*(b-y)>r*r) continue;
            ax[cnt]=a;ay[cnt++]=b;
        }

        int ans=0;

        for(int i=0;i<cnt;i++)
        {
            num1=0;
            num2=0;

            for(int j=0;j<cnt;j++)
            {
                fun(i,j);
            }
             ans=max(ans,num1);
                ans=max(ans,num2);
        }

        printf("%d\n",ans);

    }

    return 0;
}


















版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

[ZOJ1041] Transmitters

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

zoj 1041 Transmitters

ZOJ Problem Set - 1041 Transmitters Time Limit: 2 Seconds      Memory Limit: 65536 KB In a...

ZOJ 1041Transmitters

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

ZOJ 1041 Transmitters

In a wireless network with multiple transmitters sending on the same frequencies, it is often a requ...

ZOJ Problem Set - 1041

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

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

Language: Default Transmitters Time Limit: 1000MS   Memory Limit: 10000K Total S...

J - Transmitters解题报告

J - Transmitters Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & ...

POJ 1106 Transmitters (几何覆盖问题)

Transmitters Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4606   A...

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

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

编程练习:Transmitters

为何保持编程的兴趣,还是找一些代码来写 看了 http://poj.org/problem?id=1106, 分析思路如下: 1)把坐标系原点定位为圆心,把其他点转化为极坐标 2)从第一个点开始,...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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