UVa221 - Urban Elevations

最新推荐文章于 2024-07-22 19:30:03 发布

BEconfidence

最新推荐文章于 2024-07-22 19:30:03 发布

阅读量910

点赞数

分类专栏： UVA

本文链接：https://blog.csdn.net/a197p/article/details/44038695

版权

UVA 专栏收录该内容

232 篇文章 2 订阅

订阅专栏

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100 + 5;
struct Building{
    int id;
    double x,y,w,d,h;
    bool operator < (const Building& rhs) const {
        return x < rhs.x || ( x == rhs.x && y < rhs.y );
    }
}b[maxn];

int n;
double x[maxn*2];

bool cover(int i, double mx){
    return b[i].x <= mx && b[i].x + b[i].w >= mx;
}

bool visible(int i, double mx){
    if(!cover(i,mx)) return false;
    for(int k=0;k<n;k++){
        if(b[k].y<b[i].y && b[k].h>=b[i].h && cover(k, mx)) return false;
    }
    return true;
}

int main()
{
    int kase = 0;
    while(scanf("%d", &n)==1&&n){
        for(int i=0;i<n;i++){
            scanf("%lf%lf%lf%lf%lf",&b[i].x,&b[i].y,&b[i].w,&b[i].d,&b[i].h);
            x[i*2] = b[i].x; x[i*2+1]=b[i].x+b[i].w;
            b[i].id = i+1;
        }
        sort(b,b+n);
        sort(x,x+n*2);
        int m=unique(x,x+n*2)-x;

        if(kase++) printf("\n");
        printf("For map #%d, the visible buildings are numbered as follows:\n%d",kase,b[0].id);
        for(int i=1;i<n;i++){
            bool vis=false;
            for(int j=0;j<m-1;j++)
                if(visible(i,(x[j]+x[j+1])/2)) { vis=true; break; }
            if(vis) printf(" %d",b[i].id);
        }
        printf("\n");
    }
    return 0;
}