1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
| #include <bits/stdc++.h>
typedef long long LL;
struct node {
int key;
int siz;
int val;
int add;
LL sum;
node* lson;
node* rson;
int cmp(int x) {
int cnt = lson->siz + 1;
if( x == cnt ) return -1;
return x < cnt? 0: 1;
}
void pushdown() {
if( !add ) return;
lson->update(add);
rson->update(add);
add = 0;
}
void update(int add) {
if( this->lson == NULL ) return;
this->add += add;
this->val += add;
this->sum += (LL) add * this->siz;
}
void maintain() {
siz = lson->siz + 1 + rson->siz;
sum = lson->sum + val + rson->sum;
}
};
typedef node* root;
typedef std:: pair<node*, node*> droot;
const int MAX_NODES = 200000+10;
node* null;
node* nodetop;
node nodepool[MAX_NODES];
inline root newnode(int key=0, int val=0) {
nodetop->key = key;
nodetop->siz = 1;
nodetop->val = val;
nodetop->add = 0;
nodetop->sum = val;
nodetop->lson = null;
nodetop->rson = null;
return nodetop++;
}
inline void zag(root& o) {
root k = o->rson;
o->rson = k->lson;
k->lson = o;
o = k;
}
inline void zig(root& o) {
root k = o->lson;
o->lson = k->rson;
k->rson = o;
o = k;
}
inline void rotate(root& o, int d) {
d? zig(o): zag(o);
d? o->rson->maintain(): o->lson->maintain();
o->maintain();
}
inline void splay(root& o, int k) {
o->pushdown();
int d = o->cmp(k);
if( d == 1 ) k -= o->lson->siz+1;
if( d != -1 ) {
root& p = d? o->rson: o->lson;
p->pushdown();
int d2 = p->cmp(k);
if( d2 == 1 ) k -= p->lson->siz+1;
if( d2 != -1 ) {
splay((d2? p->rson: p->lson), k);
if( d == d2 ) rotate(o, d^1);
else rotate(p, d);
}
rotate(o, d^1);
}
}
inline void split(root o, int k, root& left, root& right) {
splay(o, k);
left = o;
right = o->rson;
o->rson = null;
o->maintain();
}
inline root merge(root left, root right) {
splay(left, left->siz);
left->rson = right;
left->maintain();
return left;
}
inline int rank(root o, int key) {
if( o == null ) return 0;
if( key == o->key ) return o->lson->siz;
if( key < o->key ) return rank(o->lson, key);
return o->lson->siz+1 + rank(o->rson, key);
}
inline void insert(root& o, int id, int val) {
int k = rank(o, id);
root left, right;
root middle = newnode(id, val);
split(o, k, left, right);
o = merge(merge(left, middle), right);
}
inline void remove(root& o, int id1, int id2) {
int k1 = rank(o, id1);
int k2 = rank(o, id2+1);
if( k1 >= k2 ) return;
root left, middle, right;
split(o, k1, left, right);
split(right, k2-k1, middle, right);
o = merge(left, right);
}
inline void update(root& o, int id1, int id2, int add) {
int k1 = rank(o, id1);
int k2 = rank(o, id2+1);
if( k1 >= k2 ) return;
splay(o, k1);
splay(o->rson, k2-k1+1);
o->rson->lson->update(add);
o->rson->maintain();
o->maintain();
}
inline LL query(root& o, int id1, int id2) {
int k1 = rank(o, id1);
int k2 = rank(o, id2+1);
if( k1 >= k2 ) return 0;
splay(o, k1);
splay(o->rson, k2-k1+1);
return o->rson->lson->sum;
}
root rt;
void Init() {
null = new node();
null->key = 0;
null->siz = 0;
null->val = 0;
null->add = 0;
null->sum = 0;
null->lson = NULL;
null->rson = NULL;
nodetop = nodepool;
rt = newnode(0, 0);
rt->rson = newnode(1000000001, 0);
}
int N, arg1, arg2, arg3;
char cmd[20];
inline int read() {
bool positive = true;
char c = getchar();
int s = 0;
for(; c < '0' || c > '9'; c=getchar())
if( c == '-' ) positive = false;
for(; c >= '0' && c <= '9'; c=getchar())
s = s*10 + c-'0';
return positive? s: -s;
}
int main()
{
Init();
N = read();
for(int i=1; i <= N; ++i) {
scanf("%s", cmd);
arg1 = std:: min(std:: max(read(), 1), 100000000);
arg2 = std:: min(std:: max(read(), 1), 100000000);
if( cmd[0] == 'M' ) arg3 = read();
switch( cmd[0] ) {
case 'I': insert(rt, arg1, arg2); break;
case 'Q': printf("%lld\n", query(rt, arg1, arg2)); break;
case 'M': update(rt, arg1, arg2, arg3); break;
case 'D': remove(rt, arg1, arg2); break;
}
}
return 0;
}
|
