結果
| 問題 | No.879 Range Mod 2 Query |
| ユーザー |
 hitonanode
|
| 提出日時 | 2019-10-26 12:25:08 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 281 ms / 3,000 ms |
| コード長 | 8,488 bytes |
| コンパイル時間 | 1,991 ms |
| コンパイル使用メモリ | 181,904 KB |
| 実行使用メモリ | 13,288 KB |
| 最終ジャッジ日時 | 2024-09-14 05:14:43 |
| 合計ジャッジ時間 | 6,104 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 3 ms
6,940 KB |
| testcase_02 | AC | 3 ms
6,944 KB |
| testcase_03 | AC | 3 ms
6,944 KB |
| testcase_04 | AC | 3 ms
6,940 KB |
| testcase_05 | AC | 3 ms
6,940 KB |
| testcase_06 | AC | 2 ms
6,944 KB |
| testcase_07 | AC | 3 ms
6,944 KB |
| testcase_08 | AC | 3 ms
6,940 KB |
| testcase_09 | AC | 3 ms
6,944 KB |
| testcase_10 | AC | 3 ms
6,944 KB |
| testcase_11 | AC | 265 ms
12,964 KB |
| testcase_12 | AC | 154 ms
12,956 KB |
| testcase_13 | AC | 201 ms
12,916 KB |
| testcase_14 | AC | 180 ms
13,180 KB |
| testcase_15 | AC | 181 ms
8,576 KB |
| testcase_16 | AC | 257 ms
13,236 KB |
| testcase_17 | AC | 266 ms
13,172 KB |
| testcase_18 | AC | 281 ms
13,228 KB |
| testcase_19 | AC | 256 ms
13,264 KB |
| testcase_20 | AC | 257 ms
13,288 KB |
| testcase_21 | AC | 278 ms
13,256 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/
template <typename VAL, typename DVAL>
struct LazySegTree
{
int N;
int head;
vector<VAL> val;
vector<DVAL> dval;
VAL I_val;
DVAL I_dval;
using vv2v = function<VAL(const VAL&, const VAL&)>;
using d2d = function<void(DVAL&, const DVAL&)>;
using d2v = function<void(VAL&, const DVAL&)>;
vv2v merge_val;
d2d add_dval;
d2v refl_dval;
LazySegTree(vector<VAL> &val_init, VAL val_default, DVAL dval_default,
vv2v f, d2d dadd, d2v dreflect)
: N(val_init.size()), I_val(val_default), I_dval(dval_default),
merge_val(f),
add_dval(dadd),
refl_dval(dreflect)
{
int N_tmp = 1;
while (N_tmp < N) N_tmp <<= 1;
val = vector<VAL>(N_tmp*2, I_val);
dval = vector<DVAL>(N_tmp*2, I_dval);
head = N_tmp - 1;
for (int i=0; i<N; i++) val[head+i] = val_init[i];
for (int pos=head-1; pos>=0; pos--) val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
}
void resolve_dval(int pos, int l, int r) { // posで遅延を解消して子孫に押し付ける
refl_dval(val[pos], dval[pos]);
if (pos < head)
{
add_dval(dval[pos*2+1], dval[pos]);
add_dval(dval[pos*2+2], dval[pos]);
}
dval[pos] = I_dval;
}
void update(int begin, int end, DVAL dval_q) { update(begin, end, dval_q, 0, 0, head+1); }
void update(int begin, int end, DVAL dval_q, int pos, int l, int r)
{
// 後でリファクタリング
if (begin <= l && r <= end) { // 担当区間全部使う
add_dval(dval[pos], dval_q);
resolve_dval(pos, l, r);
}
else if (begin < r && l < end) { // 少なくともどこかで交差
resolve_dval(pos, l, r);
update(begin, end, dval_q, pos*2+1, l, (l+r)/2);
update(begin, end, dval_q, pos*2+2, (l+r)/2, r);
val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
}
else resolve_dval(pos, l, r);
}
VAL getvalue(int begin, int end) { return getvalue(begin, end, 0, 0, head+1); }
VAL getvalue(int begin, int end, int pos, int l, int r)
{
resolve_dval(pos, l, r);
if (begin <= l && r <= end) return val[pos];
else if (begin<r && l<end) {
VAL vl = getvalue(begin, end, pos*2+1, l, (l+r)/2);
VAL vr = getvalue(begin, end, pos*2+2, (l+r)/2, r);
val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
return merge_val(vl, vr);
}
else return I_val;
}
};
int N, Q;
int main()
{
cin >> N >> Q;
vector<int> A(N);
cin >> A;
struct Node
{
int n_even, n_odd;
lint total;
Node(int ne=0, int no=0, lint tot=0) : n_even(ne), n_odd(no), total(tot) {}
};
struct Delay
{
lint v_add;
bool parity;
bool reset;
Delay(lint v_add=0, bool parity=false, bool reset=false) : v_add(v_add), parity(parity), reset(reset) {}
};
vector<Node> v(N);
REP(i, N) v[i] = Node(!(A[i] % 2), (A[i] % 2), A[i]);
LazySegTree<Node, Delay> s(v, Node(), Delay(),
[](const Node &l, const Node &r) {
return Node(l.n_even + r.n_even, l.n_odd + r.n_odd, l.total + r.total);
},
[](Delay &x, const Delay &y) {
if (y.reset)
{
x.parity = x.parity ^ (x.v_add % 2) ^ y.parity;
x.reset = true;
x.v_add = y.v_add;
}
else
{
x.v_add += y.v_add;
}
},
[](Node &n, Delay x) {
if (x.reset)
{
if (x.parity)
{
swap(n.n_even, n.n_odd);
}
n.total = n.n_odd;
}
n.total += (n.n_even + n.n_odd) * x.v_add;
if (x.v_add % 2) swap(n.n_even, n.n_odd);
});
REP(_, Q)
{
int q, l, r;
cin >> q >> l >> r;
l--;
if (q == 1)
{
s.update(l, r, Delay(0, 0, 1));
}
else if (q == 2)
{
lint x;
cin >> x;
s.update(l, r, Delay(x, 0, 0));
}
else
{
cout << s.getvalue(l, r).total << endl;
}
}
}