#559517 (C++14) No.879 Range Mod 2 Query

• 問題: No.879 Range Mod 2 Query
• ユーザー: 👑 Nachia
• 提出日時: 2020-09-27 15:37:02
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 348 ms / 3,000 ms
• コード長: 3,498 bytes
• コンパイル時間: 1,797 ms
• コンパイル使用メモリ: 176,192 KB
• 実行使用メモリ: 21,624 KB
• 最終ジャッジ日時: 2024-06-30 12:38:26
• 合計ジャッジ時間: 6,603 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	3 ms; 6,944 KB
testcase_02	AC	3 ms; 6,944 KB
testcase_03	AC	3 ms; 6,940 KB
testcase_04	AC	4 ms; 6,944 KB
testcase_05	AC	3 ms; 6,948 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	4 ms; 6,940 KB
testcase_08	AC	4 ms; 6,944 KB
testcase_09	AC	3 ms; 6,944 KB
testcase_10	AC	3 ms; 6,940 KB
testcase_11	AC	336 ms; 20,284 KB
testcase_12	AC	204 ms; 20,396 KB
testcase_13	AC	257 ms; 20,164 KB
testcase_14	AC	233 ms; 21,236 KB
testcase_15	AC	231 ms; 13,344 KB
testcase_16	AC	324 ms; 21,396 KB
testcase_17	AC	339 ms; 21,616 KB
testcase_18	AC	345 ms; 21,296 KB
testcase_19	AC	328 ms; 21,372 KB
testcase_20	AC	329 ms; 21,624 KB
testcase_21	AC	348 ms; 21,472 KB

ソースコード

#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)


template<
    class S,
    S(*op)(S a, S b),
    S(*e)(),
    class F,
    S(*mapping)(F a, S b),
    F(*composition)(F a, F b),
    F(*id)()
>
struct lazy_segtree {
private:
    struct Node { S v; F r; };
    int N;
    vector<Node> V;

    void spread(int i) {
        V[i].v = mapping(V[i].r, V[i].v);
        if (i < N) {
            V[i * 2].r = composition(V[i].r, V[i * 2].r);
            V[i * 2 + 1].r = composition(V[i].r, V[i * 2 + 1].r);
        }
        V[i].r = id();
    }
public:

    lazy_segtree(int n) {
        N = 1; while (N < n) N *= 2;
        V.assign(N * 2, { e(),id() });
    }
    lazy_segtree(vector<S> A) {
        N = 1; while (N < A.size()) N *= 2;
        V.assign(N * 2, { e(),id() });
        rep(i, A.size()) V[N + i].v = A[i];
        for (int i = N - 1; i >= 1; i--)
            V[i].v = op(V[i * 2].v, V[i * 2 + 1].v);
    }

    void set(int p, S v) {
        p += N;
        for (int d = N; d >= 1; d /= 2) spread(p / d);
        V[p].v = v;
        int z = 1;
        while (p != 1) {
            p /= 2; z *= 2;
            spread(p * 2); spread(p * 2 + 1);
            V[p].v = op(V[p * 2].v, V[p * 2 + 1].v);
        }
    }
    S get(int p) {
        p += N;
        for (int d = N; d >= 1; d /= 2) spread(p / d);
        return V[p].v;
    }

    void apply(int l, int r, F v, int a = 0, int b = 0, int i = -1) {
        if (i == -1) { a = 0; b = N; i = 1; }
        if (r <= a || b <= l) { spread(i); return; }
        else if (l <= a && b <= r) { V[i].r = composition(v, V[i].r); spread(i); return; }
        spread(i);
        apply(l, r, v, a, (a + b) / 2, i * 2);
        apply(l, r, v, (a + b) / 2, b, i * 2 + 1);
        V[i].v = op(V[i * 2].v, V[i * 2 + 1].v);
    }

    S prod(int l, int r, int a = 0, int b = 0, int i = -1) {
        if (i == -1) { a = 0; b = N; i = 1; }
        if (r <= a || b <= l) return e();
        spread(i);
        if (l <= a && b <= r) return V[i].v;
        S q1 = prod(l, r, a, (a + b) / 2, i * 2);
        S q2 = prod(l, r, (a + b) / 2, b, i * 2 + 1);
        q1 = op(q1, q2);
        return q1;
    }
};

struct S { LL x, c0, c1, z; };
S op(S a, S b) { return { a.x + b.x,a.c0 + b.c0,a.c1 + b.c1, a.z + b.z }; }
S e() { return { 0,0,0,0 }; }
struct F { LL bi, x; };
S mapping(F a, S b) {
    if (a.bi == 1) swap(b.c0, b.c1);
    if (a.bi != 0) b.x = b.c1;
    b.x += a.x * b.z;
    if (a.x % 2 == 1) swap(b.c0, b.c1);
    return b;
}
F composition(F a, F b) {
    if (a.bi != 0) {
        if (b.bi == 0) b.bi = 2;
        if (a.bi == 1) b.bi = 3 - b.bi;
        if (b.x % 2 == 1) b.bi = 3 - b.bi;
        b.x = 0;
    }
    b.x += a.x;
    return b;
}
F id() { return { 0,0 }; }

using RQ = lazy_segtree<S, op, e, F, mapping, composition, id>;


int main() {
    int N, Q; cin >> N >> Q;
    vector<S> A(N, e());
    rep(i, N) {
        int a; cin >> a;
        A[i].x = a; A[i].z = 1;
        ((a % 2 == 0) ? A[i].c0 : A[i].c1) = 1;
    }
    RQ G(A);

    while (Q--) {
        int c; cin >> c;
        if (c == 1) {
            int l, r; cin >> l >> r; l--;
            G.apply(l, r, { 2,0 });
        }
        if (c == 2) {
            int l, r, x; cin >> l >> r >> x; l--;
            G.apply(l, r, { 0,x });
        }
        if (c == 3) {
            int l, r; cin >> l >> r; l--;
            cout << G.prod(l, r).x << endl;
        }
    }

    return 0;
}