test/yosupo_area_of_union_of_rectangles.test.cpp

• View this file on GitHub
• Last update: 2026-03-22 13:47:31+09:00
• Problem: https://judge.yosupo.jp/problem/area_of_union_of_rectangles

Depends on

• 長方形和集合面積(Area of Union of Rectangles) (geometry/area_of_union_of_rectangles.cpp)
• 高速入出力(Fast IO) (util/fastio.cpp)

Code

#define PROBLEM "https://judge.yosupo.jp/problem/area_of_union_of_rectangles"

#include <algorithm>
#include <vector>

#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>

#include "../util/fastio.cpp"
#include "../geometry/area_of_union_of_rectangles.cpp"

int main() {
    Scanner sc;
    Printer pr;
    int n;
    sc.read(n);

    AreaOfUnionOfRectangles<long long> solver;
    for (int i = 0; i < n; ++i) {
        long long l, d, r, u;
        sc.read(l, d, r, u);
        solver.add_rectangle(l, d, r, u);
    }
    pr.println(solver.solve());
    return 0;
}

#line 1 "test/yosupo_area_of_union_of_rectangles.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/area_of_union_of_rectangles"

#include <algorithm>
#include <vector>

#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>

#line 1 "util/fastio.cpp"
using namespace std;

extern "C" int fileno(FILE *);
extern "C" int isatty(int);

template<class T, class = void>
struct is_fastio_range : false_type {};

template<class T>
struct is_fastio_range<T, void_t<decltype(declval<T &>().begin()), decltype(declval<T &>().end())>> : true_type {};

template<class T, class = void>
struct has_fastio_value : false_type {};

template<class T>
struct has_fastio_value<T, void_t<decltype(declval<const T &>().value())>> : true_type {};

struct FastIoDigitTable {
    char num[40000];

    constexpr FastIoDigitTable() : num() {
        for (int i = 0; i < 10000; ++i) {
            int x = i;
            for (int j = 3; j >= 0; --j) {
                num[i * 4 + j] = char('0' + x % 10);
                x /= 10;
            }
        }
    }
};

struct Scanner {
    static constexpr int BUFSIZE = 1 << 17;
    static constexpr int OFFSET = 64;
    char buf[BUFSIZE + 1];
    int idx, size;
    bool interactive;

    Scanner() : idx(0), size(0), interactive(isatty(fileno(stdin))) {}

    inline void load() {
        int len = size - idx;
        memmove(buf, buf + idx, len);
        if (interactive) {
            if (fgets(buf + len, BUFSIZE + 1 - len, stdin)) size = len + (int)strlen(buf + len);
            else size = len;
        } else {
            size = len + (int)fread(buf + len, 1, BUFSIZE - len, stdin);
        }
        idx = 0;
        buf[size] = 0;
    }

    inline void ensure() {
        if (idx + OFFSET > size) load();
    }

    inline void ensure_interactive() {
        if (idx == size) load();
    }

    inline char skip() {
        if (interactive) {
            ensure_interactive();
            while (buf[idx] && buf[idx] <= ' ') {
                ++idx;
                ensure_interactive();
            }
            return buf[idx++];
        }
        ensure();
        while (buf[idx] && buf[idx] <= ' ') {
            ++idx;
            ensure();
        }
        return buf[idx++];
    }

    template<class T, typename enable_if<is_integral<T>::value, int>::type = 0>
    void read(T &x) {
        if (interactive) {
            char c = skip();
            bool neg = false;
            if constexpr (is_signed<T>::value) {
                if (c == '-') {
                    neg = true;
                    ensure_interactive();
                    c = buf[idx++];
                }
            }
            x = 0;
            while (c >= '0') {
                x = x * 10 + (c & 15);
                ensure_interactive();
                c = buf[idx++];
            }
            if constexpr (is_signed<T>::value) {
                if (neg) x = -x;
            }
            return;
        }
        char c = skip();
        bool neg = false;
        if constexpr (is_signed<T>::value) {
            if (c == '-') {
                neg = true;
                c = buf[idx++];
            }
        }
        x = 0;
        while (c >= '0') {
            x = x * 10 + (c & 15);
            c = buf[idx++];
        }
        if constexpr (is_signed<T>::value) {
            if (neg) x = -x;
        }
    }

    template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
    void read(T &x) {
        long long v;
        read(v);
        x = T(v);
    }

    template<class Head, class Next, class... Tail>
    void read(Head &head, Next &next, Tail &...tail) {
        read(head);
        read(next, tail...);
    }

    template<class T, class U>
    void read(pair<T, U> &p) {
        read(p.first, p.second);
    }

    template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
    void read(T &a) {
        for (auto &x : a) read(x);
    }

    void read(char &c) {
        c = skip();
    }

    void read(string &s) {
        s.clear();
        if (interactive) {
            ensure_interactive();
            while (buf[idx] && buf[idx] <= ' ') {
                ++idx;
                ensure_interactive();
            }
            while (true) {
                int start = idx;
                while (idx < size && buf[idx] > ' ') ++idx;
                s.append(buf + start, idx - start);
                if (idx < size) break;
                load();
                if (size == 0) break;
            }
            if (idx < size) ++idx;
            return;
        }
        ensure();
        while (buf[idx] && buf[idx] <= ' ') {
            ++idx;
            ensure();
        }
        while (true) {
            int start = idx;
            while (idx < size && buf[idx] > ' ') ++idx;
            s.append(buf + start, idx - start);
            if (idx < size) break;
            load();
        }
        if (idx < size) ++idx;
    }
};

struct Printer {
    static constexpr int BUFSIZE = 1 << 17;
    static constexpr int OFFSET = 64;
    char buf[BUFSIZE];
    int idx;
    bool interactive;
    inline static constexpr FastIoDigitTable table{};

    Printer() : idx(0), interactive(isatty(fileno(stdout))) {}
    ~Printer() { flush(); }

    inline void flush() {
        if (idx) {
            fwrite(buf, 1, idx, stdout);
            idx = 0;
        }
    }

    inline void pc(char c) {
        if (idx > BUFSIZE - OFFSET) flush();
        buf[idx++] = c;
        if (interactive && c == '\n') flush();
    }

    inline void print_range(const char *s, size_t n) {
        size_t pos = 0;
        while (pos < n) {
            if (idx == BUFSIZE) flush();
            size_t chunk = min(n - pos, (size_t)(BUFSIZE - idx));
            memcpy(buf + idx, s + pos, chunk);
            idx += (int)chunk;
            pos += chunk;
        }
    }

    void print(const char *s) {
        print_range(s, strlen(s));
    }

    void print(const string &s) {
        print_range(s.data(), s.size());
    }

    void print(char c) {
        pc(c);
    }

    void print(bool b) {
        pc(char('0' + (b ? 1 : 0)));
    }

    template<class T, typename enable_if<is_integral<T>::value && !is_same<T, bool>::value, int>::type = 0>
    void print(T x) {
        if (idx > BUFSIZE - 100) flush();
        using U = typename make_unsigned<T>::type;
        U y;
        if constexpr (is_signed<T>::value) {
            if (x < 0) {
                buf[idx++] = '-';
                y = U(0) - static_cast<U>(x);
            } else {
                y = static_cast<U>(x);
            }
        } else {
            y = x;
        }
        if (y == 0) {
            buf[idx++] = '0';
            return;
        }
        static constexpr int TMP_SIZE = sizeof(U) * 10 / 4;
        char tmp[TMP_SIZE];
        int pos = TMP_SIZE;
        while (y >= 10000) {
            pos -= 4;
            memcpy(tmp + pos, table.num + (y % 10000) * 4, 4);
            y /= 10000;
        }
        if (y >= 1000) {
            memcpy(buf + idx, table.num + (y << 2), 4);
            idx += 4;
        } else if (y >= 100) {
            memcpy(buf + idx, table.num + (y << 2) + 1, 3);
            idx += 3;
        } else if (y >= 10) {
            unsigned q = (unsigned(y) * 205) >> 11;
            buf[idx] = char('0' + q);
            buf[idx + 1] = char('0' + (unsigned(y) - q * 10));
            idx += 2;
        } else {
            buf[idx++] = char('0' + y);
        }
        memcpy(buf + idx, tmp + pos, TMP_SIZE - pos);
        idx += TMP_SIZE - pos;
    }

    template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
    void print(const T &x) {
        print(x.value());
    }

    template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
    void print(const T &a) {
        bool first = true;
        for (auto &&x : a) {
            if (!first) pc(' ');
            first = false;
            print(x);
        }
    }

    template<class T>
    void println(const T &x) {
        print(x);
        pc('\n');
    }

    template<class Head, class... Tail>
    void println(const Head &head, const Tail &...tail) {
        print(head);
        ((pc(' '), print(tail)), ...);
        pc('\n');
    }

    void println() {
        pc('\n');
    }
};

template<class T>
Scanner &operator>>(Scanner &in, T &x) {
    in.read(x);
    return in;
}

template<class T>
Printer &operator<<(Printer &out, const T &x) {
    out.print(x);
    return out;
}

/**
 * @brief 高速入出力(Fast IO)
 */
#line 1 "geometry/area_of_union_of_rectangles.cpp"
using namespace std;

template<class Coord = long long, class Area = long long>
struct AreaOfUnionOfRectangles {
    struct Rectangle {
        Coord l, d, r, u;
    };

    struct Event {
        Coord x;
        int yl, yr;
        int delta;

        bool operator<(const Event &other) const {
            return x < other.x;
        }
    };

    struct SegmentTree {
        int n, sz;
        vector<int> cnt;
        vector<Area> len;
        vector<Area> total;

        explicit SegmentTree(const vector<Coord> &ys) : n((int)ys.size() - 1), sz(1) {
            while (sz < n) sz <<= 1;
            cnt.assign(sz << 1, 0);
            len.assign(sz << 1, 0);
            total.assign(sz << 1, 0);
            for (int i = 0; i < n; ++i) {
                total[sz + i] = Area(ys[i + 1]) - Area(ys[i]);
            }
            for (int k = sz - 1; k > 0; --k) total[k] = total[k << 1] + total[k << 1 | 1];
        }

        void apply(int k, int x) {
            cnt[k] += x;
            pull(k);
        }

        void pull(int k) {
            if (cnt[k] > 0) {
                len[k] = total[k];
            } else if (k < sz) {
                len[k] = len[k << 1] + len[k << 1 | 1];
            } else {
                len[k] = 0;
            }
        }

        void update(int a, int b, int x) {
            if (a >= b) return;
            a += sz;
            b += sz;
            int left = a;
            int right = b - 1;
            for (; a < b; a >>= 1, b >>= 1) {
                if (a & 1) apply(a++, x);
                if (b & 1) apply(--b, x);
            }
            while (left >>= 1) pull(left);
            while (right >>= 1) pull(right);
        }

        Area covered_length() const {
            return len[1];
        }
    };

    vector<Rectangle> rects;
    vector<Coord> ys;

    void add_rectangle(Coord l, Coord d, Coord r, Coord u) {
        if (l >= r || d >= u) return;
        rects.push_back({l, d, r, u});
        ys.push_back(d);
        ys.push_back(u);
    }

    Area solve() const {
        if (rects.empty()) return 0;

        vector<Coord> ord_y = ys;
        sort(ord_y.begin(), ord_y.end());
        ord_y.erase(unique(ord_y.begin(), ord_y.end()), ord_y.end());
        if ((int)ord_y.size() <= 1) return 0;

        vector<Event> events;
        events.reserve(rects.size() * 2);
        for (auto &&rect : rects) {
            int d = (int)(lower_bound(ord_y.begin(), ord_y.end(), rect.d) - ord_y.begin());
            int u = (int)(lower_bound(ord_y.begin(), ord_y.end(), rect.u) - ord_y.begin());
            events.push_back({rect.l, d, u, 1});
            events.push_back({rect.r, d, u, -1});
        }
        sort(events.begin(), events.end());

        SegmentTree seg(ord_y);
        Area ans = 0;
        Coord prev_x = events[0].x;
        int i = 0;
        while (i < (int)events.size()) {
            Coord x = events[i].x;
            ans += seg.covered_length() * Area(x - prev_x);
            while (i < (int)events.size() && events[i].x == x) {
                seg.update(events[i].yl, events[i].yr, events[i].delta);
                ++i;
            }
            prev_x = x;
        }
        return ans;
    }
};

/**
 * @brief 長方形和集合面積(Area of Union of Rectangles)
 */
#line 13 "test/yosupo_area_of_union_of_rectangles.test.cpp"

int main() {
    Scanner sc;
    Printer pr;
    int n;
    sc.read(n);

    AreaOfUnionOfRectangles<long long> solver;
    for (int i = 0; i < n; ++i) {
        long long l, d, r, u;
        sc.read(l, d, r, u);
        solver.add_rectangle(l, d, r, u);
    }
    pr.println(solver.solve());
    return 0;
}

Back to top page