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.
-
输入
-
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
输出
- 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. 样例输入
-
3 21 2-3 12 11 20 20 0
样例输出
-
Case 1: 2Case 2: 1
数轴上有n个闭区间[ai,bi]。取尽量少的点,使得每个区间内都至少有一个点(不同区间内含的点可以是同一个)。
贪心策略:
按照b1<=b2<=b3…(b相同时按a从大到小)的方式排序排序,从前向后遍历,当遇到没有加入集合的区间时,选取这个区间的右端点b。
证明:
为了方便起见,如果区间i内已经有一个点被取到,我们称区间i被满足。
1、首先考虑区间包含的情况,当小区间被满足时大区间一定被满足。所以我们应当优先选取小区间中的点,从而使大区间不用考虑。
按照上面的方式排序后,如果出现区间包含的情况,小区间一定在大区间前面。所以此情况下我们会优先选择小区间。
则此情况下,贪心策略是正确的。
2、排除情况1后,一定有a1<=a2<=a3……。
对于区间1来说,显然选择它的右端点是明智的。因为它比前面的点能覆盖更大的范围。
从而此情况下,贪心策略也是正确的。
根本思路,嗯,也算是模板吧,代码如下
#include <stdio.h>
#include <algorithm>
using namespace std;
struct Extent
{
int a,b;
bool operator < (const Extent& S)const
{
return b < S.b || b == S.b && a > S.a;
}
}A[10002];
int main()
{
int z,n,cnt,end;
scanf("%d",&z);
while(z--)
{
cnt = 0;
end = -1;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d%d",&A[i].a,&A[i].b);
sort(A,A+n);
for(int i=0;i<n;i++)
{
if(end < A[i].a)
{
end = A[i].b;
cnt++;
}
}
printf("%d\n",cnt);
}
return 0;
}
这个题的ac代码就是模仿这个来的
代码如下
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
struct weizhi
{
float l,r;
bool operator < (const weizhi & s)const
{
return r<s.r||r==s.r&&l>s.l;
}
}p[1000];
int main()
{
int n,d,i,x,y,sw,re,count=1;
double pre;
while(1)
{
cin>>n>>d;
if(n==0&&d==0)break;
sw=1;
for(i=0;i<n;i++)
{
cin>>x>>y;
if(d>=y&&sw==1)
{
p[i].l=x-sqrt((double)d*d-(double)y*y);
p[i].r=x+sqrt((double)d*d-(double)y*y);
}
else sw=0;
}
if(sw==0)
{cout<<"Case "<<count++<<": "<<-1<<endl;
continue;}
sort(p,p+n);
re=1;
pre=p[0].r;
for(i=1;i<n;++i)
{
if(p[i].l>pre)
{
re++;
pre=p[i].r;
}
else
{
if(p[i].r<pre)
pre=p[i].r;
}
}
cout<<"Case "<<count++<<": "<<re<<endl;
}
return 0;
}