This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ningenMe/compro-library
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G" #include <vector> #include <iostream> #include <cassert> #include <queue> using namespace std; #include "../../lib/99-operator/monoid-lazy/MonoidRangeFoldSumRangeOperateAdd.cpp" #include "../../lib/12-binary-search-tree/LazyRandomizedBinarySearchTreeSequence.cpp" int main(void){ int N,Q; scanf("%d %d",&N,&Q); LazyRandomizedBinarySearchTreeSequence<MonoidRangeFoldSumRangeOperateAdd<long long,long long>> A; for(int i=0;i<N;++i) { A.insert(i,0); } while(Q--) { int q; scanf("%d",&q); if(q==0) { int l,r,x; scanf("%d %d %d",&l,&r,&x); l--; A.operate(l,r,x); } else { int l,r; scanf("%d %d",&l,&r); l--; printf("%lld\n",A.fold(l,r)); } } return 0; }
#line 1 "test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-rsqraq.test.cpp" #define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G" #include <vector> #include <iostream> #include <cassert> #include <queue> using namespace std; #line 1 "lib/99-operator/monoid-lazy/MonoidRangeFoldSumRangeOperateAdd.cpp" /* * @title MonoidRangeSumRangeAdd - fold:区間和, opearate:区間加算 * @docs md/operator/monoid-lazy/MonoidRangeSumRangeAdd.md */ template<class T, class U> struct MonoidRangeFoldSumRangeOperateAdd { using TypeNode = T; using TypeLazy = U; inline static constexpr TypeNode unit_node = 0; inline static constexpr TypeLazy unit_lazy = 0; inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return l+r;} inline static constexpr TypeLazy func_lazy(TypeLazy old_lazy,TypeLazy new_lazy){return old_lazy+new_lazy;} inline static constexpr TypeNode func_operate(TypeNode node,TypeLazy lazy,int l, int r){return node+lazy*(r-l);} inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var <= nodeVal;} }; #line 1 "lib/12-binary-search-tree/LazyRandomizedBinarySearchTreeSequence.cpp" /* * @title LazyRandomizedBinarySearchTreeSequence - 遅延評価ランダム平衡二分探索木列 * @docs md/binary-search-tree/LazyRandomizedBinarySearchTreeSequence.md */ template<class Monoid> class LazyRandomizedBinarySearchTreeSequence { using TypeNode = typename Monoid::TypeNode; using TypeLazy = typename Monoid::TypeLazy; unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123; unsigned int xor_shift() { unsigned int t = (x ^ (x << 11)); x = y; y = z; z = w; return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8))); } struct Node { private: void build() {left = right = nullptr;size = 1; rev=0; range_lazy = Monoid::unit_lazy;} public: Node *left, *right; TypeNode value, range_value; TypeLazy range_lazy; int size,rev; Node() : value(Monoid::unit_node), range_value(Monoid::unit_node) {build();} Node(TypeNode v) : value(v), range_value(v) {build();} friend ostream &operator<<(ostream &os, const Node* node) {return os << "{" << node->value << ", " << node->range_value << ", " << node->range_lazy << ", " << node->size << "}";} }; Node* root; inline int size(Node *node) {return node==nullptr ? 0 : node->size;} inline TypeNode range_value(Node *node) {return node==nullptr ? Monoid::unit_node : node->range_value;} inline TypeNode get(Node *node, size_t k) { if (node==nullptr) return Monoid::unit_node; propagate(node); if (k == size(node->left)) return node->value; if (k < size(node->left)) return get(node->left, k); else return get(node->right, k-1 - size(node->left)); } inline Node* update(Node *node) { node->size = size(node->left) + size(node->right) + 1; node->range_value = Monoid::func_fold(Monoid::func_fold(range_value(node->left),node->value),range_value(node->right)); return node; } inline void propagate(Node *node) { if(node==nullptr || (node->range_lazy == Monoid::unit_lazy && node->rev == 0)) return; node->range_value = Monoid::func_operate(node->range_value,node->range_lazy,0,node->size); node->value = Monoid::func_operate(node->value,node->range_lazy,0,1); if(node->left !=nullptr) node->left->range_lazy = Monoid::func_lazy(node->left->range_lazy,node->range_lazy), node->left->rev ^= node->rev; if(node->right!=nullptr) node->right->range_lazy = Monoid::func_lazy(node->right->range_lazy,node->range_lazy), node->right->rev ^= node->rev; if(node->rev) swap(node->left,node->right), node->rev = 0; node->range_lazy = Monoid::unit_lazy; } inline Node* merge_impl(Node *left, Node *right) { propagate(left); propagate(right); if (left==nullptr) return right; if (right==nullptr) return left; if (xor_shift() % (left->size + right->size) < left->size) { left->right = merge_impl(left->right, right); return update(left); } else { right->left = merge_impl(left, right->left); return update(right); } } inline pair<Node*, Node*> split_impl(Node* node, int k) { if (node==nullptr) return make_pair(nullptr, nullptr); propagate(node); if (k <= size(node->left)) { propagate(node->right); pair<Node*, Node*> sub = split_impl(node->left, k); node->left = sub.second; return make_pair(sub.first, update(node)); } else { propagate(node->left); pair<Node*, Node*> sub = split_impl(node->right, k - 1 - size(node->left)); node->right = sub.first; return make_pair(update(node), sub.second); } } inline TypeNode fold_impl(Node *node, int l, int r) { if (l < 0 || size(node) <= l || r<=0 || r-l <= 0) return Monoid::unit_node; propagate(node); if (l == 0 && r == size(node)) return range_value(node); TypeNode value = Monoid::unit_node; int sl = size(node->left); if(sl > l) value = Monoid::func_fold(value,fold_impl(node->left,l,min(sl,r))); l = max(l-sl,0), r -= sl; if(l == 0 && r > 0) value = Monoid::func_fold(value,node->value); l = max(l-1,0), r -= 1; if(l >= 0 && r > l) value = Monoid::func_fold(value,fold_impl(node->right,l,r)); return value; } inline void operate_impl(Node *node, int l, int r, TypeLazy lazy) { if(l < 0 || size(node) <= l || r <= 0 || r-l <= 0) return; if (l == 0 && r == size(node)) { node->range_lazy = Monoid::func_lazy(node->range_lazy,lazy); propagate(node); return; } int sl = size(node->left); propagate(node->left); propagate(node->right); if(sl > l) operate_impl(node->left,l,min(sl,r),lazy); l = max(l-sl,0), r -= sl; if(l == 0 && r > 0) node->value = Monoid::func_operate(node->value,lazy,0,1); l = max(l-1,0), r -= 1; if(l >= 0 && r > l) operate_impl(node->right,l,r,lazy); update(node); } inline void reverse_impl(int l, int r) { if(l < 0 || size(root) <= l || r <= 0 || r-l <= 0) return; pair<Node*,Node*> tmp1 = split_impl(this->root,l); pair<Node*,Node*> tmp2 = split_impl(tmp1.second,r-l); Node* nl = tmp1.first; Node* nc = tmp2.first; Node* nr = tmp2.second; nc->rev ^= 1; this->root = merge_impl(merge_impl(nl,nc),nr); } inline void insert_impl(const size_t k, const TypeNode value) { pair<Node*, Node*> sub = split_impl(this->root, k); this->root = this->merge_impl(this->merge_impl(sub.first, new Node(value)), sub.second); } inline void erase_impl(const size_t k) { if(size(this->root) <= k) return; auto sub = split_impl(this->root,k); this->root = merge_impl(sub.first, split_impl(sub.second, 1).second); } public: LazyRandomizedBinarySearchTreeSequence() : root(nullptr) {} inline int size() {return size(this->root);} inline int empty(void) {return bool(size()==0);} inline Node* merge(Node *left, Node *right) {return merge_impl(left,right);} inline pair<Node*, Node*> split(int k) {return split_impl(this->root,k);} inline void insert(const size_t k, const TypeNode value) {insert_impl(k,value);} inline void erase(const size_t k) {erase_impl(k);} inline TypeNode get(size_t k) {return get(this->root, k);} inline void operate(const int l, const int r, const TypeLazy lazy) {propagate(this->root); operate_impl(this->root,l,r,lazy);} inline TypeNode fold(int l, int r) {return fold_impl(this->root,l,r);} inline void reverse(int l, int r) {reverse_impl(l,r);} void print() {int m = size(this->root); for(int i=0;i<m;++i) cout << get(i) << " \n"[i==m-1];} }; #line 10 "test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-rsqraq.test.cpp" int main(void){ int N,Q; scanf("%d %d",&N,&Q); LazyRandomizedBinarySearchTreeSequence<MonoidRangeFoldSumRangeOperateAdd<long long,long long>> A; for(int i=0;i<N;++i) { A.insert(i,0); } while(Q--) { int q; scanf("%d",&q); if(q==0) { int l,r,x; scanf("%d %d %d",&l,&r,&x); l--; A.operate(l,r,x); } else { int l,r; scanf("%d %d",&l,&r); l--; printf("%lld\n",A.fold(l,r)); } } return 0; }