2021-03-18

c++海岸雷达解题是遇到的问题

题目

Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.

We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.
Input
The input consists of several test cases. The first line of each case contains two integers n (1<=n<=1000) and d, where n is the number of islands in the sea and d is the distance of coverage of the radar installation. This is followed by n lines each containing two integers representing the coordinate of the position of each island. Then a blank line follows to separate the cases.

The input is terminated by a line containing pair of zeros
Output
For each test case output one line consisting of the test case number followed by the minimal number of radar installations needed. “-1” installation means no solution for that case.
Sample Input
3 2
1 2
-3 1
2 1

1 2
0 2

0 0
Sample Output
Case 1: 2
Case 2: 1

这样解有问题吗？

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int n,d;
struct island
{
    double x,y;
}is[1001];
bool cmp(island &a,island &b)
{
    if(a.y==b.y)
        return a.x<b.x;
    return a.y<b.y;
}
void dis(island &a)
{
    double c=sqrt(d*d-a.y*a.y)+a.x;
    double s=sqrt(d*d-a.y*a.y)*-1+a.x;
    a.x=s;
    a.y=c;
}
int main()
{
    int time=0;
    while(cin>>n>>d)
    {
        if(n==0&&d==0)
            return 0;
        int i;
        for(i=0;i<n;i++)
        {
            cin>>is[i].x>>is[i].y;
            if(is[i].y>d||is[i].y<=0)
            {
                break;
            }
            dis(is[i]);
        }
        if(i<n-1)
        {
            cout <<"-1"<< endl;
            continue;
        }
        sort(is,is+n,cmp);
        int sum=1,un=0;
        for(int j=1;j<n;j++)
        {
            if(is[j].x<=is[un].y)
                continue;
            sum++;
            un=j;
        }
        time++;
        cout<<time<<" "<<sum<<endl;
    }
    return 0;
}