Bittilista

#include <iostream>
using namespace std;
struct node {
	node* left;
	node* right;
	int pr, size;
	unsigned long val, diff, sum;
	bool flip;
	node(unsigned long v) {
		left = nullptr;
		right = nullptr;
		size = 1;
		pr = rand();
		val = v;
		diff = 0;
		flip = 0;
		sum = 0;
	}
};
 
int size(node* s) {
	if (s == nullptr) return 0;
	return s->size;
}
 
unsigned long sum(node* s) {
	if (s == nullptr) return 0;
	return s->sum;
}
 
void lazy_pull(node* s) {
	if (s == nullptr) return;
	s->size = size(s->left) + size(s->right) + 1;
	s->sum = s->val + sum(s->left) + sum(s->right);
}
 
void lazy_push(node* s) {
	if (s == nullptr) return;
	if (s->flip) {
		swap(s->left, s->right);
		if (s->left != nullptr) s->left->flip = !s->left->flip;
		if (s->right != nullptr) s->right->flip = !s->right->flip;
		s->flip = false;
	}
	if (s->left != nullptr) s->left->diff += s->diff;
	if (s->right != nullptr) s->right->diff += s->diff;
	s->val += s->diff;
	s->diff = 0;
}
 
void join(node*& s, node* left, node* right) {
	lazy_push(left);
	lazy_push(right);
	if (left == nullptr) s = right;
	else if (right == nullptr) s = left;
	else {
		if (left->pr > right->pr) {
			join(left->right, left->right, right);
			s = left;
		} else {
			join(right->left, left, right->left);
			s = right;
		}
	}
	lazy_pull(s);
}
 
void split(node* s, node*& left, node*& right, int k) {
	if (s == nullptr) {
		left = nullptr;
		right = nullptr;
		return;
	}
	lazy_push(s);
	if (size(s->left) >= k) {
		split(s->left, left, s->left, k);
		right = s;
	} else {
		split(s->right, s->right, right, k - size(s->left) - 1);
		left = s;
	}
	lazy_pull(s);
}
 
void getindex(node* s, node*& result, int i) {
	lazy_push(s);
	if (size(s->left) == i) {
		result = s;
	} else if (size(s->left) > i) {
		getindex(s->left, result, i);
	} else {
		getindex(s->right, result, i-size(s->left)-1);
	}
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	node *tree = nullptr;
	for (int i = 0; i < n; ++i) {
		join(tree, tree, new node(0));
	}
	for (int qi = 0; qi < q; ++qi) {
		char c;
		int a, b;
		cin >> c >> a >> b;
		node *left, *middle, *right;
		split(tree, left, middle, a-1);
		split(middle, middle, right, b-a+1);
		if (c == 'S') {
			cout << sum(middle) << '\n';
		} else if (c == 'R') {
			middle->flip = !middle->flip;
		} else {
			unsigned long d;
			cin >> d;
			middle->diff += d;
		}
		join(tree, left, middle);
		join(tree, tree, right);
	}
}

Test 1

Group: 1

Verdict: RUNTIME ERROR

Test 2

Group: 1

Verdict: RUNTIME ERROR

Test 3

Group: 1

Verdict: RUNTIME ERROR

Test 4

Group: 1

Verdict: RUNTIME ERROR

Test 5

Group: 1

Verdict: RUNTIME ERROR

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 2

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR