P5490 【模板】扫描线

题目描述

求 n 个矩形的面积并。

#include <bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e5 + 10;
int n, v[N << 1];
struct node {
    int x, s, xi, f;
    bool operator <(const node &a) const {
        return x < a.x;
    }
} no[N << 1];
struct segment_tree {
    int l, r, cnt;
    ll len;
} t[N << 4];
void build(int l, int r, int rt) {
    t[rt].l = v[l], t[rt].r = v[r];
    if(r - l <= 1)
        return;
    int m = (r + l) >> 1;
    build(l, m, rt << 1);
    build(m, r, rt << 1 | 1);
}
void pushup(int rt) {
    if(t[rt].cnt)
        t[rt].len = t[rt].r - t[rt].l;
    else
        t[rt].len = t[rt << 1].len + t[rt << 1 | 1].len;
}
void update(int f, int L, int R, int rt) {
    if(L <= t[rt].l && t[rt].r <= R) {
        t[rt].cnt += f;
        pushup(rt);
        return;
    }
    if(L < t[rt << 1].r)
        update(f, L, R, rt << 1);
    if(R > t[rt << 1 | 1].l)
        update(f, L, R, rt << 1 | 1);
    pushup(rt);
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.in", "r", stdin);
#endif
    scanf("%d", &n);
    for(int a, b, c, d, i = 1; i <= n; i++) {
        scanf("%d%d%d%d", &a, &b, &c, &d);
        v[i] = b, v[n + i] = d;
        no[i] = (node) {a, d, b, 1}, no[n + i] = (node) {
            c, d, b, -1
        };
    }
    sort(v + 1, v + (n << 1) + 1);
    sort(no + 1, no + (n << 1) + 1);
    build(1, (n << 1), 1);
    ll ans = 0;
    for(int i = 1; i <= (n << 1); i++) {
        ans += t[1].len * (no[i].x - no[i - 1].x);
        update(no[i].f, no[i].xi, no[i].s, 1);
    }
    printf("%lld\n", ans);
    return 0;
}