zoukankan      html  css  js  c++  java
  • BZOJ 1645: [Usaco2007 Open]City Horizon 城市地平线 扫描线 + 线段树 + 离散化

    Description

    Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and observe the beautiful silhouettes formed by the rectangular buildings. The entire horizon is represented by a number line with N (1 <= N <= 40,000) buildings. Building i's silhouette has a base that spans locations A_i through B_i along the horizon (1 <= A_i < B_i <= 1,000,000,000) and has height H_i (1 <= H_i <= 1,000,000,000). Determine the area, in square units, of the aggregate silhouette formed by all N buildings.

    N个矩形块,交求面积并.

    Input

    * Line 1: A single integer: N

    * Lines 2..N+1: Input line i+1 describes building i with three space-separated integers: A_i, B_i, and H_i

    Output

    * Line 1: The total area, in square units, of the silhouettes formed by all N buildings

    #include<cstdio>
    #include<algorithm>
    #include<string>    
    #define maxn 1030000 
    #define inf 300000 
    #define ll long long 
    using namespace std;
    void setIO(string s)
    {
        string in=s+".in"; 
        freopen(in.c_str(),"r",stdin); 
    }
    ll Arr[maxn];     
    namespace tr
    {
        #define mid ((l+r)>>1)
        #define lson t[x].l
        #define rson t[x].r  
        struct Node
        {
            int l,r,sum;
            ll len; 
        }t[maxn<<2];  
        int tot; 
        int newnode(){ return ++tot; }
        void pushup(int x,int l,int r)
        {
            if(t[x].sum)
            {
                t[x].len=Arr[r]-Arr[l-1];                   
            }
            else 
            {
                t[x].len=t[lson].len+t[rson].len; 
            }
        }
        // 应为 > L (左面是开的)                  
        void Update(int &x,int l,int r,int L,int R,int v)
        {
            if(!x) x = newnode(); 
            if(l>=L&&r<=R)
            {
                t[x].sum+=v;   
                pushup(x,l,r); 
                return; 
            }
            if(L<=mid) Update(lson,l,mid,L,R,v); 
            if(R>mid) Update(rson,mid+1,r,L,R,v); 
            pushup(x,l,r); 
        }
        void re()
        {
            for(int i=0;i<=tot;++i) t[tot].l=t[tot].r=t[tot].sum=t[tot].len=0; 
            tot=0; 
        }
    }; 
    struct Edge
    {
        ll l,r,h;   
        int L,R;                   
        int flag; 
    }edges[maxn]; 
    bool cmp(Edge a,Edge b)
    {
        return a.h==b.h?a.flag>b.flag:a.h<b.h;         
    }
    int i,j,n,root,ed,cc,dd; 
    ll ans=0,a,b,c,d;   
    int main()
    {
        // setIO("input");  
        scanf("%d",&n);  
        ed=root=cc=0;       
        ans=0;                  
        for(i=1;i<=n;++i)
        {
            scanf("%lld%lld%lld",&a,&c,&d), b = 0;        
            edges[++ed].l=a,edges[ed].r=c,edges[ed].h=b,edges[ed].flag=1; 
            edges[++ed].l=a,edges[ed].r=c,edges[ed].h=d,edges[ed].flag=-1;                 
            Arr[++cc]=a, Arr[++cc]=c;      
        } 
        sort(edges+1,edges+1+ed,cmp);   
        sort(Arr+1,Arr+1+cc);    
        dd=unique(Arr+1,Arr+cc+1)-(Arr+1); 
        for(i=1;i<=ed;++i)
        {
            edges[i].L=lower_bound(Arr+1,Arr+1+dd,edges[i].l)-Arr; 
            edges[i].R=lower_bound(Arr+1,Arr+1+dd,edges[i].r)-Arr; 
        }
        for(i=1;i<ed;++i)
        {  
            tr::Update(root,0,inf,edges[i].L+1,edges[i].R,edges[i].flag);          
            ans+=(ll)(tr::t[root].len)*(edges[i+1].h-edges[i].h);           
        }
        printf("%lld
    ",ans); 
        tr::re();
        return 0; 
    }
    

      

  • 相关阅读:
    python 中classmethod修饰符、staticmethod和装饰器有什么区别
    zabbix4.0 监控 mysql5.7
    centos7 zabbix 自启动 设定
    生产环境 编译安装 zabbix 服务
    docker 环境 部署 centos7镜像 并配置免秘登陆
    dd 命令 磁盘写性能测试
    hdparm命令 硬盘读取速度压力测试
    zabbix 动态实时日志监控
    已经创建 且运行一段时间的docker容器 添加新的映射端口
    hive 锁表解决方案(unlock不掉的情况下)
  • 原文地址:https://www.cnblogs.com/guangheli/p/11050685.html
Copyright © 2011-2022 走看看