提出 #71339036

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second

#ifdef reimufumo
#define owo(x) cerr << x
#else
#define owo(x) (void(0))
#endif

struct SegmentTree {
    struct Node {
        ll val = 1;
        set<ll> ind;
        ll ls = -1;
        ll rs = -1;
        ll lazy = -1;
        set<array<ll, 2>> lazyind;
    };
    vector<Node> d;
    ll idx = 0;
    
    const ll n;
    vector<ll> a;

    void pushup(ll p) {
        d[p].val = d[d[p].ls].val + d[d[p].rs].val;
    }
    
    void pushdown(ll s, ll t, ll p) {
        if (d[p].ls == -1) {
            d[p].ls = ++idx;
            d.push_back(Node());
        }
        if (d[p].rs == -1) {
            d[p].rs = ++idx;
            d.push_back(Node());
        }

        d[d[p].ls].val += d[p].lazy;
        for (auto [x, o] : d[p].lazyind) {
            if (o) {
                d[d[p].ls].ind.insert(x);
            } else {
                d[d[p].ls].ind.erase(x);
            }
            d[d[p].ls].lazyind.insert({x, o});
        }
        d[d[p].ls].lazy += d[p].lazy;
        d[d[p].rs].val += d[p].lazy;
        d[d[p].rs].ind = d[p].ind;
        d[d[p].rs].lazy += d[p].lazy;
        for (auto [x, o] : d[p].lazyind) {
            if (o) {
                d[d[p].rs].ind.insert(x);
            } else {
                d[d[p].rs].ind.erase(x);
            }
            d[d[p].rs].lazyind.insert({x, o});
        }
        d[p].lazy = 0;
    }
    
    void build(ll s, ll t, ll p) {
        if (s == t) {
            d[p].val = a[s];
            d[p].lazy = 0;
            return;
        }
        ll mid = s + (t - s) / 2ll;
        pushdown(s, t, p);
        build(s, mid, d[p].ls);
        build(mid + 1, t, d[p].rs);
        pushup(p);
    }
    
    void update(ll l, ll r, ll c, ll ind, ll s, ll t, ll p) {
        if (l <= s && t <= r) {
            d[p].val += c;
            if (c == 1) d[p].ind.insert(ind);
            else d[p].ind.erase(ind);
            d[p].lazy += c;
            if (c == 1) d[p].lazyind.insert({ind, 1});
            else d[p].lazyind.insert({ind, -1});
            return;
        }
        ll mid = s + (t - s) / 2ll;
        pushdown(s, t, p);
        if (l <= mid) update(l, r, c, ind, s, mid, d[p].ls);
        if (r > mid) update(l, r, c, ind, mid + 1, t, d[p].rs);
        pushup(p);
    }
    
    pair<ll, set<ll>> getsum(ll l, ll r, ll s, ll t, ll p) {
        if (l <= s && t <= r) return {d[p].val, d[p].ind};
        ll mid = s + (t - s) / 2ll;
        pair<ll, set<ll>> ret; ret.fi = 0;
        pushdown(s, t, p);
        if (l <= mid) {
            pair<ll, set<ll>> now = getsum(l, r, s, mid, d[p].ls);
            ret.fi += now.fi; ret.se = now.se;
        }
        if (r > mid) {
            pair<ll, set<ll>> now = getsum(l, r, mid + 1, t, d[p].rs);
            ret.fi += now.fi, ret.se = now.se;
        }
        pushup(p);
        return ret;
    }
    
    SegmentTree(ll _n, vector<ll> _a) : n(_n), a(_a) {
        d.push_back(Node());
        build(1, n, 0);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n; cin >> n;
    array<ll, 4> clouds[n + 1];
    priority_queue<array<ll, 2>> rowin, rowout;
    for (int i = 1; i <= n; i++) {
        ll u, d, l, r;
        cin >> u >> d >> l >> r;
        clouds[i] = {u, d, l, r};
        rowin.push({-u, i});
        rowout.push({-d, i});
    }

    SegmentTree segtree(2000, vector<ll>(2001));
    
    ll covered = 0, cnt[n + 1];
    memset(cnt, 0, sizeof(cnt));
    for (int row = 1; row <= 7; row++) {
        while (!rowin.empty() && row == -rowin.top()[0]) {
            ll ind = rowin.top()[1]; rowin.pop();
            segtree.update(clouds[ind][2], clouds[ind][3], 1, ind, 1, 2000, 0);

            #ifdef reimufumo
            cerr << clouds[ind][2] << ' ' << clouds[ind][3] << '\n';
            #endif
        }

        #ifdef reimufumo
        cerr << row << "; " << -rowin.top()[0] << ' ' << -rowout.top()[0] << ": ";
        //for (auto [u, ind]: cur) cerr << u << ", " << ind << "; ";
        cerr << '\n';
        #endif

        for (int col = 1; col <= 7; col++) {
            auto [num, ind] = segtree.getsum(col, col, 1, 2000, 0);
            if (num == 1) cnt[*ind.begin()]++;
            if (num >= 1) covered++;

            #ifdef reimufumo
            cerr << row << ' ' << col << ' ' << num << ' ' << *ind.begin() << '\n';
            #endif
        }

        while (!rowout.empty() && row == -rowout.top()[0]) {
            ll ind = rowout.top()[1]; rowout.pop();
            segtree.update(clouds[ind][2], clouds[ind][3], -1, ind, 1, 2000, 0);
        }
    }


    for (int i = 1; i <= n; i++) {
        cout << 2000 * 2000 - covered + cnt[i] << '\n';
    }
}

提出情報

コンパイルエラー

./Main.cpp: In member function 'void SegmentTree::pushdown(ll, ll, ll)':
./Main.cpp:34:22: warning: unused parameter 's' [-Wunused-parameter]
   34 |     void pushdown(ll s, ll t, ll p) {
      |                   ~~~^
./Main.cpp:34:28: warning: unused parameter 't' [-Wunused-parameter]
   34 |     void pushdown(ll s, ll t, ll p) {
      |                         ~~~^

ジャッジ結果