uva 10382 Watering Grass

最新推荐文章于 2021-03-26 00:01:47 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2021-03-26 00:01:47 发布

阅读量544

点赞数

分类专栏：贪心\模拟\STL\暴力文章标签： uva

本文链接：https://blog.csdn.net/tengfei461807914/article/details/50748794

版权

贪心\模拟\STL\暴力专栏收录该内容

132 篇文章 1 订阅

订阅专栏

原题：
n sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler
is installed at the horizontal center line of the strip. For each sprinkler we are given its position as the
distance from the left end of the center line and its radius of operation.
What is the minimum number of sprinklers to turn on in order to water the entire strip of grass?
这里写图片描述
Input
Input consists of a number of cases. The first line for each case contains integer numbers n, l and w
with n ≤ 10000. The next n lines contain two integers giving the position of a sprinkler and its radius
of operation. (The picture above illustrates the first case from the sample input.)
Output
For each test case output the minimum number of sprinklers needed to water the entire strip of grass.
If it is impossible to water the entire strip output ‘-1’.
Sample Input
8 20 2
5 3
4 1
1 2
7 2
10 2
13 3
16 2
19 4
3 10 1
3 5
9 3
6 1
3 10 1
5 3
1 1
9 1
Sample Output
6
2
-1
大意：
给你一个矩形，告诉你长宽，然后给你n个喷头。这些喷头都安装在矩形横向的中心线上。每个喷头给出到最左侧的距离和喷洒半径，现在问你最少用多少个喷头能把这个矩形完全覆盖。

#include <bits/stdc++.h>

using namespace std;

struct circle
{
    double st,en;
};
vector<circle> cir;
double len,wi;
int n;
double GetLen(double r)
{
    return sqrt((r*r)-(wi/2)*(wi/2));
}
int cmp(const circle &a,const circle &b)
{
    return a.st<b.st;
}
int main()
{
    ios::sync_with_stdio(false);
    int ans;
    while(cin>>n>>len>>wi)
    {
        ans=0;
        cir.clear();
        circle tmp;
        for(int i=1;i<=n;i++)
        {
            double p,r;
            cin>>p>>r;
            if(r<=wi/2)
                continue;
            tmp.st=p-GetLen(r);
            tmp.en=p+GetLen(r);
            cir.push_back(tmp);
        }
        sort(cir.begin(),cir.end(),cmp);
        double r=0;
        int j;
        for(int i=0;i<cir.size();)
        {
            if(cir[i].st>r)
                break;
            for(j=i+1;j<cir.size();j++)
            {
                if(cir[j].st>r)
                    break;
                if(cir[j].en>cir[i].en)
                    i=j;
            }
            ans++;
            r=cir[i].en;
            if(r>=len)
                break;
            i=j;
        }
        if(r>=len)
            cout<<ans<<endl;
        else
            cout<<-1<<endl;
    }
    return 0;
}