#853669 (C++17) No.879 Range Mod 2 Query

提出ソース
結果

問題	No.879 Range Mod 2 Query
コンテスト
ユーザー	minato
提出日時	2023-03-28 18:41:38
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	120 ms / 3,000 ms
コード長	19,773 bytes
コンパイル時間	1,558 ms
コンパイル使用メモリ	149,004 KB
最終ジャッジ日時	2025-02-11 18:52:46
ジャッジサーバーID （参考情報）	judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 1
other	AC * 21
権限があれば一括ダウンロードができます
ソースコード

raw source code
#line 1 "library-cpp/other/template.hpp"
// clang-format off
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using maxheap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato)
#define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++)
#define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define OVERLOAD_RREP(_1, _2, _3, name, ...) name
#define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--)
#define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--)
#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define all(x) begin(x), end(x)
template <class Container> int SZ(const Container& v) { return int(v.size()); }
template <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); }
template <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); }
template <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); }
template <class T> T ABS(T x) { return max(x, -x); }
template <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
int popcount(ull x) { return __builtin_popcountll(x); }
int kthbit(ull x, int k) { return (x >> k) & 1; }
constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
template <typename S> void rearrange(const vector<S>& id) { (void)id; }
template <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); }
template <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); }
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template <class T> vector<T> &operator++(vector<T>& v) { for (auto& e : v) { e++; } return v;} 
template <class T> vector<T> operator++(vector<T>& v, int) { auto res = v; for (auto& e : v) { e++; } return res; }
template <class T> vector<T> &operator--(vector<T>& v) { for (auto& e : v) { e--; } return v; }
template <class T> vector<T> operator--(vector<T>& v, int) { auto res = v; for (auto& e : v) { e--; } return res; }
template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x) { return pair<T1, T2>(-x.first, -x.second); }
template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first - y.first, x.second - y.second); }
template <class T1, class T2> pair<T1, T2> operator+(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first + y.first, x.second + y.second); }
template <class T1, class T2> pair<T1, T2> operator+=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l + r; }
template <class T1, class T2> pair<T1, T2> operator-=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l - r; }
constexpr char ln = '\n';
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
void YES(bool t = true) { cout << YESNO[t] << "\n"; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
void No(bool t = 1) { Yes(!t); }
template <class T> void drop(T x) { cout << x << "\n"; exit(0); }
#define INT(...)     \
    int __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LL(...)     \
    ll __VA_ARGS__; \
    IN(__VA_ARGS__)
#define STR(...)        \
    string __VA_ARGS__; \
    IN(__VA_ARGS__)
#define CHR(...)      \
    char __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LDB(...)             \
    long double __VA_ARGS__; \
    IN(__VA_ARGS__)
#define VEC(type, name, size) \
    vector<type> name(size);  \
    IN(name)
#define VEC2(type, name1, name2, size)     \
    vector<type> name1(size), name2(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i])
#define VEC3(type, name1, name2, name3, size)           \
    vector<type> name1(size), name2(size), name3(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])
#define VEC4(type, name1, name2, name3, name4, size)                 \
    vector<type> name1(size), name2(size), name3(size), name4(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);
#define VV(type, name, N, M)                       \
    vector<vector<type>> name(N, vector<type>(M)); \
    IN(name)
template <class T> void scan(T& a) { cin >> a; }
template <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); }
void IN() {}
template <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); }
void print() { cout << "\n"; }
template <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// clang-format on
#line 1 "library-cpp/segmenttree/LazySegmentTree.hpp"
template <class T, class U, class F, class G, class H> struct LazySegmentTree {
  private:
    F op;
    G mapping;
    H composition;
    T e;
    U id;
    int _n, size, log;
    vector<T> node;
    vector<U> lazy;

  public:
    LazySegmentTree() {
    }
    LazySegmentTree(const F& op,
                    const G& mapping,
                    const H& composition,
                    T e,
                    U id,
                    int n)
        : LazySegmentTree(op, mapping, composition, e, id, vector<T>(n, e)) {
    }
    LazySegmentTree(const F& op,
                    const G& mapping,
                    const H& composition,
                    T e,
                    U id,
                    const vector<T>& v)
        : op(op),
          mapping(mapping),
          composition(composition),
          e(e),
          id(id),
          _n(int(v.size())),
          log(0) {
        while ((1 << log) < _n) log++;
        size = 1 << log;
        node = vector<T>(2 * size, e);
        lazy = vector<U>(size, id);
        for (int i = 0; i < _n; i++) node[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, T x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        node[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    // [l, r) (0-indexed)
    T get(int l, int r) {
        if (l >= r) return e;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push(r >> i);
        }

        T sml = e, smr = e;
        while (l < r) {
            if (l & 1) sml = op(sml, node[l++]);
            if (r & 1) smr = op(node[--r], smr);
            l >>= 1;
            r >>= 1;
        }

        return op(sml, smr);
    }

    T all_get() const {
        return node[1];
    }

    void apply(int p, U val) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        node[p] = val == id ? node[p] : mapping(node[p], val);
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    void apply(int l, int r, U val) {
        if (l >= r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, val);
                if (r & 1) all_apply(--r, val);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    template <typename C> int max_right(int l, const C& check) {
        assert(0 <= l && l <= _n);
        assert(check(e));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        T sm = e;
        do {
            while (~l & 1) l >>= 1;
            if (!check(op(sm, node[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (check(op(sm, node[l]))) {
                        sm = op(sm, node[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, node[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <typename C> int min_left(int r, const C& check) {
        assert(0 <= r && r <= _n);
        assert(check(e));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        T sm = e;
        do {
            r--;
            while (r > 1 && (r & 1)) r >>= 1;
            if (!check(op(node[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (check(op(node[r], sm))) {
                        sm = op(node[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(node[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

    T operator[](int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return node[p];
    }
#ifdef MINATO_LOCAL
    friend ostream& operator<<(ostream& os, LazySegmentTree r) {
        vector<T> v(r._n);
        for (int i = 0; i < r._n; i++) {
            v[i] = r[i];
        }
        os << v;
        return os;
    }
#endif

  private:
    void update(int k) {
        node[k] = op(node[2 * k], node[2 * k + 1]);
    }

    void all_apply(int k, U val) {
        node[k] = val == id ? node[k] : mapping(node[k], val);
        if (k < size) lazy[k] = composition(lazy[k], val);
    }

    void push(int k) {
        if (lazy[k] == id) return;
        all_apply(2 * k, lazy[k]);
        all_apply(2 * k + 1, lazy[k]);
        lazy[k] = id;
    }
};

/**
 * 区間更新区間最小値
 */
template <typename T, T INF> auto buildRangeSetRangeMin(const vector<T>& v) {
    auto f = [](T a, T b) { return min(a, b); };
    auto g = [](T a, T b) {
        (void)a;
        return b;
    };
    auto h = [](T a, T b) {
        (void)a;
        return b;
    };
    LazySegmentTree seg(f, g, h, INF, INF, v);
    return seg;
}

template <typename T, T INF> auto buildRangeSetRangeMin(int n) {
    return buildRangeSetRangeMin<T, INF>(vector<T>(n, INF));
}

/**
 * 区間更新区間最大値
 */
template <typename T, T INF> auto buildRangeSetRangeMax(const vector<T>& v) {
    auto f = [](T a, T b) { return max(a, b); };
    auto g = [](T a, T b) {
        (void)a;
        return b;
    };
    auto h = [](T a, T b) {
        (void)a;
        return b;
    };
    LazySegmentTree seg(f, g, h, -INF, -INF, v);
    return seg;
}

template <typename T, T INF> auto buildRangeSetRangeMax(int n) {
    return buildRangeSetRangeMax<T, INF>(vector<T>(n, -INF));
}

/**
 * 区間加算区間最小値
 */
template <typename T, T INF> auto buildRangeAddRangeMin(const vector<T>& v) {
    auto f = [](T a, T b) { return min(a, b); };
    auto g = [](T a, T b) { return a + b; };
    auto h = [](T a, T b) { return a + b; };
    LazySegmentTree seg(f, g, h, INF, T(0), v);
    return seg;
}

template <typename T, T INF> auto buildRangeAddRangeMin(int n) {
    return buildRangeAddRangeMin<T, INF>(vector<T>(n));
}

/**
 * 区間加算区間最大値
 */
template <typename T, T INF> auto buildRangeAddRangeMax(const vector<T>& v) {
    auto f = [](T a, T b) { return max(a, b); };
    auto g = [](T a, T b) { return a + b; };
    auto h = [](T a, T b) { return a + b; };
    LazySegmentTree seg(f, g, h, -INF, T(0), v);
    return seg;
}

template <typename T, T INF> auto buildRangeAddRangeMax(int n) {
    return buildRangeAddRangeMax<T, INF>(vector<T>(n));
}

/**
 * 区間更新区間和
 * @note pair.first: 区間和, pair.second: 区間の長さ
 */
template <typename T> auto buildRangeSetRangeSum(const vector<T>& v, T id) {
    using P = pair<T, int>;
    auto f = [](P a, P b) { return P(a.first + b.first, a.second + b.second); };
    auto g = [](P a, T b) { return P(b * a.second, a.second); };
    auto h = [](T a, T b) {
        (void)a;
        return b;
    };
    vector<P> w(v.size());
    for (size_t i = 0; i < v.size(); i++) {
        w[i] = P(v[i], 1);
    }
    LazySegmentTree seg(f, g, h, P(0, 0), id, w);
    return seg;
}

template <typename T> auto buildRangeSetRangeSum(int n, T id) {
    return buildRangeSetRangeSum<T>(vector<T>(n), id);
}
#line 3 "A.cpp"
void solve() {
    struct S {
        ll sum;
        int even;
        int odd;
    };
    struct F {
        ll add = 0;
        ll update = -1;

        bool operator==(const F& r) const {
            return add == r.add && update == r.update;
        }
    };
    auto f = [](S a, S b) {
        return S{a.sum + b.sum, a.even + b.even, a.odd + b.odd};
    };
    auto g = [](S a, F val) {
        if (val.add > 0) {
            if (val.add & 1) {
                a.sum += (val.add) * (a.even + a.odd) + a.odd - a.even;
                swap(a.even, a.odd);
            } else {
                a.sum += val.add * (a.even + a.odd);
            }
        }
        if (val.update >= 0) {
            if (val.update & 1) {
                a.sum = val.update * (a.even + a.odd) + a.odd - a.even;
                swap(a.odd, a.even);
            } else {
                a.sum = val.update * (a.even + a.odd);
            }
        }
        return a;
    };
    auto h = [](F a, F b) {
        if (b.update >= 0) {
            int x = a.add & 1;
            if (a.update >= 0) {
                x ^= a.update & 1;
            }
            x ^= b.add & 1;
            return F{x, b.update};
        }
        if (a.update >= 0) {
            int x = a.add & 1;
            return F{x, a.update + b.add};
        }
        return F{a.add + b.add, -1};
    };
    const S e = {0, 0, 0};
    const F id = {0, -1};

    INT(N, Q);
    VEC(ll, A, N);
    vec<S> v(N);
    rep(i, N) {
        v[i] = S{A[i] - A[i] % 2, A[i] % 2 == 0, A[i] % 2 == 1};
    }
    LazySegmentTree seg(f, g, h, e, id, v);

    rep(Q) {
        INT(t);
        if (t == 1) {
            INT(l, r);
            l--;
            seg.apply(l, r, F{0, 0});
        } else if (t == 2) {
            INT(l, r, x);
            l--;
            seg.apply(l, r, F{x, -1});
        } else {
            INT(l, r);
            l--;
            auto s = seg.get(l, r);
            print(s.sum + s.odd);
        }
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(7);

    int T = 1;
    // cin >> T;
    for (int test_case = 1; test_case <= T; test_case++) {
        // debug(test_case);
        solve();
    }
}
yukicoder

結果

ソースコード
