hdoj1255_覆盖的面积（线段树）

线段树求交面积

// hdoj1255_覆盖的面积.cpp : Defines the entry point for the console application.
//

#include<iostream>
#include<vector>
#include<iomanip>
#include<cstdio>
#include<algorithm>

using namespace std;

struct seg{
    int f;
    double l, r, h;
};

struct node{
    int l, r, cov;
    double clen;
};

bool cmpseg(seg s1, seg s2)
{
    return s1.h > s2.h;
}

vector<double> pos;
vector<seg> segs;
node nodes[50000];

void init(int i, int l, int r)
{
    nodes[i].l = l;
    nodes[i].r = r;
    nodes[i].cov = 0;
    nodes[i].clen = 0;
    if (l + 1 == r)
        return;
    else
    {
        int mid = (l + r) / 2;
        init(i * 2, l, mid);
        init(i * 2 + 1, mid, r);
    }
}

void getclen(int i)
{
    if (nodes[i].cov >= 2)
        nodes[i].clen = (pos[nodes[i].r] - pos[nodes[i].l]);
    else if (nodes[i].l + 1 == nodes[i].r)
        nodes[i].clen = 0;
    else
        nodes[i].clen = nodes[i * 2].clen + nodes[i * 2 + 1].clen;
}

void update(seg s, int i)
{
    if (s.l <= pos[nodes[i].l] && pos[nodes[i].r] <= s.r)
    {
        nodes[i].cov += s.f;
        if (nodes[i].l + 1 != nodes[i].r)
        {
            update(s, i * 2);
            update(s, i * 2 + 1);
        }
    }
    else
    {
        int mid = (nodes[i].l + nodes[i].r) / 2;
        if (s.r <= pos[mid])
            update(s, i * 2);
        else if (s.l >= pos[mid])
            update(s, i * 2 + 1);
        else
        {
            update(s, i * 2);
            update(s, i * 2 + 1);
        }
    }
    getclen(i);
}

int main(int argc, char* argv[])
{
    int t;
    scanf("%d", &t);
    for (int i = 0; i < t; i++)
    {
        int n;
        scanf("%d",&n);
        segs.clear();
        pos.clear();
        for (int j = 0; j < n; j++)
        {
            double x1, y1, x2, y2;
            scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
            pos.push_back(x1);
            pos.push_back(x2);
            segs.push_back(seg{ 1, x1, x2, y2 });
            segs.push_back(seg{ -1, x1, x2, y1 });
        }
        sort(pos.begin(), pos.end());
        vector<double>::iterator k = unique(pos.begin(), pos.end());
        pos.erase(k, pos.end());
        sort(segs.begin(), segs.end(), cmpseg);
        init(1, 0, pos.size() - 1);
        double ans = 0;
        for (int j = 0; j < segs.size(); j++)
        {
            if (j>0)
                ans += (segs[j - 1].h - segs[j].h)*nodes[1].clen;
            update(segs[j], 1);
        }
        printf("%.2lf\n", ans);
    }
    return 0;
}