結果

問題 No.1000 Point Add and Array Add
コンテスト
ユーザー 東前頭十一枚目
提出日時 2020-02-29 00:32:15
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 503 ms / 2,000 ms
コード長 8,937 bytes
コンパイル時間 1,721 ms
コンパイル使用メモリ 174,568 KB
実行使用メモリ 59,136 KB
最終ジャッジ日時 2024-10-13 19:36:37
合計ジャッジ時間 7,081 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct SegmentTreeBeats {
    static const int_fast64_t INF = 1LL << 60;
    struct Node {
        Node *left, *right;
        int_fast64_t max_v, smax_v, max_c;
        int_fast64_t min_v, smin_v, min_c;
        int_fast64_t sum;
        int_fast64_t len, ladd, lval;

        Node() : left(0), right(0), ladd(0), lval(INF) {}

        void init(int_fast64_t x) {
            max_v = min_v = sum = x;
            smax_v = -INF; smin_v = INF;
            max_c = min_c = 1;
        }

        void init_empty() {
            max_v = smax_v = -INF;
            min_v = smin_v = INF;
            max_c = min_c = 0;
        }

        void update_max(int_fast64_t x) {
            sum += (x - max_v) * max_c;
            /* */if (max_v ==  min_v) max_v =  min_v = x;
            else if (max_v == smin_v) max_v = smin_v = x;
            else                      max_v = x;
            if (lval != INF and x < lval) lval = x;
        }

        void update_min(int_fast64_t x) {
            sum += (x - min_v) * min_c;
            /* */if (max_v ==  min_v) max_v =  min_v = x;
            else if (max_v == smin_v) min_v = smax_v = x;
            else                      min_v = x;
            if (lval != INF and lval < x) lval = x;
        }

        void addall(int_fast64_t x) {
            max_v += x;
            if (smax_v != -INF) smax_v += x;
            min_v += x;
            if (smin_v != INF) smin_v += x;
            sum += len * x;
            if (lval != INF) lval += x;
            else             ladd += x;
        }

        void updateall(int_fast64_t x) {
            max_v = min_v = x;
            smax_v = -INF; smin_v = INF;
            max_c = min_c = len;
            sum = len * x;
            lval = x; ladd = 0;
        }

        void push() {
            if (lval != INF) {
                 left -> updateall(lval);
                right -> updateall(lval);
                lval = INF;
                return;
            }
            if (ladd != 0) {
                 left -> addall(ladd);
                right -> addall(ladd);
                ladd = 0;
            }
            if (max_v < left -> max_v)   left -> update_max(max_v);
            if (left -> min_v < min_v)   left -> update_min(min_v);
            if (max_v < right -> max_v) right -> update_max(max_v);
            if (right -> min_v < min_v) right -> update_min(min_v);
        }

        void update() {
            sum = left -> sum + right -> sum;
            if (left -> max_v < right -> max_v) {
                max_v = right -> max_v;
                max_c = right -> max_c;
                smax_v = max(left -> max_v, right -> smax_v);
            } else if (left -> max_v > right -> max_v) {
                max_v = left -> max_v;
                max_c = left -> max_c;
                smax_v = max(left -> smax_v, right -> max_v);
            } else {
                max_v = left -> max_v;
                max_c = left -> max_c + right -> max_c;
                smax_v = max(left -> smax_v, right -> smax_v);
            }
            if (left -> min_v < right -> min_v) {
                min_v = left -> min_v;
                min_c = left -> min_c;
                smin_v = min(left -> smin_v, right -> min_v);
            } else if (left -> min_v > right -> min_v) {
                min_v = right -> min_v;
                min_c = right -> min_c;
                smin_v = min(left -> min_v, right -> smin_v);
            } else {
                min_v = left -> min_v;
                min_c = left -> min_c + right -> min_c;
                smin_v = min(left -> smin_v, right -> smin_v);
            }
        }
    };

    int n, n0;
    Node *root;

    void _update_min(int_fast64_t x, int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a || nd -> max_v <= x) return;
        if (a <= l && r <= b && nd -> smax_v < x) {
            nd -> update_max(x);
            return;
        }
        nd -> push();
        _update_min(x, a, b, nd ->  left, l, (l + r) >> 1);
        _update_min(x, a, b, nd -> right, (l + r) >> 1, r);
        nd -> update();
    }

    void _update_max(int_fast64_t x, int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a || x <= nd -> min_v) return;
        if (a <= l && r <= b && x < nd -> smin_v) {
            nd -> update_min(x);
            return;
        }
        nd -> push();
        _update_max(x, a, b, nd ->  left, l, (l + r) >> 1);
        _update_max(x, a, b, nd -> right, (l + r) >> 1, r);
        nd -> update();
    }

    void _add_val(int_fast64_t x, int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a) return;
        if (a <= l && r <= b) {
            nd -> addall(x);
            return;
        }
        nd -> push();
        _add_val(x, a, b, nd ->  left, l, (l + r) >> 1);
        _add_val(x, a, b, nd -> right, (l + r) >> 1, r);
        nd -> update();
    }

    void _update_val(int_fast64_t x, int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a) return;
        if (a <= l && r <= b) {
            nd -> updateall(x);
            return;
        }
        nd -> push();
        _update_val(x, a, b, nd ->  left, l, (l + r) >> 1);
        _update_val(x, a, b, nd -> right, (l + r) >> 1, r);
        nd -> update();
    }

    int_fast64_t _query_max(int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a) return -INF;
        if (a <= l && r <= b) return nd -> max_v;
        nd -> push();
        int_fast64_t lv = _query_max(a, b, nd ->  left, l, (l + r) >> 1);
        int_fast64_t rv = _query_max(a, b, nd -> right, (l + r) >> 1, r);
        return max(lv, rv);
    }

    int_fast64_t _query_min(int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a) return INF;
        if (a <= l && r <= b) return nd -> min_v;
        nd -> push();
        int_fast64_t lv = _query_min(a, b, nd ->  left, l, (l + r) >> 1);
        int_fast64_t rv = _query_min(a, b, nd -> right, (l + r) >> 1, r);
        return min(lv, rv);
    }

    int_fast64_t _query_sum(int a, int b, Node *nd, int l, int r) {
        if (b <= l || r <= a) return 0;
        if (a <= l && r <= b) return nd -> sum;
        nd -> push();
        int_fast64_t lv = _query_sum(a, b, nd ->  left, l, (l + r) >> 1);
        int_fast64_t rv = _query_sum(a, b, nd -> right, (l + r) >> 1, r);
        return lv + rv;
    }

    SegmentTreeBeats(int n, int_fast64_t val = 0) : n(n) {
        n0 = 1; while (n0 < n) n0 <<= 1;
        Node *nds = new Node[2 * n0];
        root = nds;
        nds[0].len = n0;
        for (int i = 0; i < n0 - 1; ++i) {
            nds[i].left = &nds[2 * i + 1];
            nds[i].right = &nds[2 * i + 2];
            nds[2 * i + 1].len = nds[2 * i + 2].len = nds[i].len >> 1;
        }
        for (int i = 0; i <  n; ++i) nds[n0 - 1 + i].init(val);
        for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();
        for (int i = n0 - 2; i >= 0; i--) nds[i].update();
    }
    
    SegmentTreeBeats(int n, vector<int_fast64_t> a) : n(n) {
        n0 = 1; while (n0 < n) n0 <<= 1;
        Node *nds = new Node[2 * n0];
        root = nds;
        nds[0].len = n0;
        for (int i = 0; i < n0 - 1; ++i) {
            nds[i].left = &nds[2 * i + 1];
            nds[i].right = &nds[2 * i + 2];
            nds[2 * i + 1].len = nds[2 * i + 2].len = nds[i].len >> 1;
        }
        assert(n == (int)a.size());
        for (int i = 0; i <  n; ++i) nds[n0 - 1 + i].init(a[i]);
        for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();
        for (int i = n0 - 2; i >= 0; i--) nds[i].update();
    }

    void update_min(int a, int b, int_fast64_t x) { _update_min(x, a, b, root, 0, n0); }
    void update_max(int a, int b, int_fast64_t x) { _update_max(x, a, b, root, 0, n0); }
    void    add_val(int a, int b, int_fast64_t x) {    _add_val(x, a, b, root, 0, n0); }
    void update_val(int a, int b, int_fast64_t x) { _update_val(x, a, b, root, 0, n0); }
    int_fast64_t query_max(int a, int b) { return _query_max(a, b, root, 0, n0); }
    int_fast64_t query_min(int a, int b) { return _query_min(a, b, root, 0, n0); }
    int_fast64_t query_sum(int a, int b) { return _query_sum(a, b, root, 0, n0); }
};


int main() {
	int n, q; cin >> n >> q;
	int64_t a[n]; for(int i = 0; i < n; ++i) cin >> a[i];
	int64_t b[n] = {};
	char c[q];
	int x[q], y[q];
	int64_t opb[n + 1] = {};
	for(int i = 0; i < q; ++i) {
		cin >> c[i] >> x[i] >> y[i];
		--x[i];
		if(c[i] == 'B') {
			++opb[x[i]];
			--opb[y[i]];
		}
	}
	for(int i = 1; i < n; ++i) {
		opb[i] += opb[i - 1];
	}
	for(int i = 0; i < n; ++i) {
		b[i] = opb[i] * a[i];
	}
	SegmentTreeBeats seg(n);
	for(int i = q - 1; i >= 0; --i) {
		if(c[i] == 'A') {
			b[x[i]] += y[i] * seg.query_sum(x[i], x[i] + 1);
		}
		if(c[i] == 'B') {
			seg.add_val(x[i], y[i], 1);
		}
	}
	for(int i = 0; i < n; ++i) {
		cout << b[i] << (i == n - 1 ? "\n" : " ");
	}
	return 0;
}
0