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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
|
#include <bits/stdc++.h>
#include <cfloat>
#include <vector>
#define all(vec) vec.begin(),vec.end()
#define pb push_back
#define EB emplace_back
#define EM emplace
#define FI first
#define SE second
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define SZ(a) ((long long) a.size())
#define FOR(i, a, b) for (long long i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (long long i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define cend cerr<<"\n-----------\n"
#define lson(var) (var<<1)
#define rson(var) (var<<1|1)
#define fsp(x) fixed<<setprecision(x)
using namespace std;
#ifdef LOCAL
template<typename T> void _print(T x) { cerr << x; }
template<typename T> void _print(vector<T> v) { cerr << "[ "; for (T i : v) _print(i), cerr << " "; cerr << "]"; }
template<typename T> void _print(set<T> s) { cerr << "{ "; for (T i : s) _print(i), cerr << " "; cerr << "}"; }
template<typename T, typename U> void _print(pair<T, U> p) { cerr << "{"; _print(p.first); cerr << ", "; _print(p.second); cerr << "}"; }
template<typename T, typename U> void _print(map<T, U> m) { cerr << "{ "; for (auto &p : m) _print(p), cerr << " "; cerr << "}"; }
#endif
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using i128 = __int128;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;using vb=vector<bool>;
using tll = tuple<ll,ll,ll>;using vii=vector<int>;
using vpll = vector<pll>;using vtll = vector<tll>;
using vdb = vector<DB>;using vc=vector<char>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
using CD=complex<double>;
static constexpr ll MAXN=(ll)1e6+10,INF=(ll)1e17+3;
static constexpr ll mod=(ll)1e9+7;
static constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,T,lT;
inline void __();
template <typename T,typename value_type> struct base_segtree{
int n,sz;
vector<value_type> tr;
static int bit_ceil(int x){int res=1;while(res<x){res<<=1;} return res;};
base_segtree(int n):n(n),sz(bit_ceil(n)),tr((sz<<1),T::identity){}
T *derived() { return static_cast<T*>(this); }
value_type val(int o){
return tr[o];
}
void pushup(int o){
tr[o]=T::op(val(o<<1),val(o<<1|1));
}
int dis(int o){return __lg(sz)-__lg(o);}
int len(int o){return 1<<dis(o);}
int le(int o){return (o<<dis(o))-sz; }
int rr(int o){return (o+1<<dis(o))-sz;}
void call_pushdown(int i){
int o=i+sz;
for(int k=__lg(o);k>=__builtin_ctz(o) + 1;--k){
derived()->pushdown(o>>k);
}
}
void call_pushup(int i){
int o=i+sz;
for(int k=__builtin_ctz(o) + 1;k<=__lg(o);++k){
derived()->pushup(o>>k);
}
}
void build(){
for(int o=sz-1;o>=1;--o){
derived()->pushup(o);
}
}
template<typename D>
void update(int l,int r,D x){
call_pushdown(l),call_pushdown(r);
int l0=l,r0=r;l+=sz,r+=sz;
for(;l<r;l>>=1,r>>=1){
if(l&1) derived()->settag(l++,x);
if(r&1) derived()->settag(--r,x);
}
call_pushup(l0);call_pushup(r0);
}
value_type query(int l, int r){
call_pushdown(l);call_pushdown(r);
l+=sz;r+=sz;
value_type resl=T::identity,resr=T::identity;
for(;l<r;l>>=1,r>>=1){
#ifdef LOCAL
debug(l);debug(r);
#endif
if(l&1) resl=T::op(resl,val(l++));
if(r&1) resr=T::op(val(--r),resr);
}
return T::op(resl,resr);
}
value_type& operator[](int i) {
return tr[i + sz];
}
};
struct segtree:base_segtree<segtree, DB>{
static constexpr DB identity = 0;
static DB op(const DB &a,const DB &b){
return a+b;
}
vdb tag;
segtree(int n):base_segtree(n),tag(sz,identity){}
void settag(int o,DB x){
ll ln=len(o);
tr[o]+=x*ln;
if(o<sz) tag[o]+=x;
}
void pushdown(int o){
if(o>=sz) return;
if(abs(tag[o])<eps) return;
settag(o<<1,tag[o]);
settag(o<<1|1, tag[o]);
tag[o]=0;
}
};
struct sqsegtree:base_segtree<sqsegtree, DB>{
static constexpr DB identity = 0;
static DB op(const DB &a,const DB &b){
return a+b;
}
segtree& yici;
vdb tag;
sqsegtree(int n,segtree & yici):base_segtree(n),yici(yici),tag(sz,identity){}
void settag(int o,DB x){
DB cursum=yici.query(le(o),rr(o));
ll ln=len(o);
tr[o]+=(2*cursum*x+ln*x*x);
if(o<sz) tag[o]+=x;
}
void pushdown(int o){
if(o>=sz) return;
if(abs(tag[o])<eps) return;
settag(o<<1,tag[o]);
settag(o<<1|1, tag[o]);
tag[o]=0;
}
};
constexpr DB segtree::identity;
constexpr DB sqsegtree::identity;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
__();
return 0;
}
inline void __(){
cin>>N>>Q;
segtree yici(N);
sqsegtree square(N,yici);
FOR(i,0,N-1){
DB a;
cin>>a;
square[i]=a*a;
yici[i]=a;
}
square.build();yici.build();
FOR(i,1,Q){
ll op,l,r;
cin>>op>>l>>r;
DB len=r-l+1;
if(op==1){
DB x;cin>>x;
square.update(l-1, r, x);
yici.update(l-1, r, x);
}else if(op==2){
DB res=yici.query(l-1, r)/len;
cout<<fsp(4)<<res<<"\n";
}else{
DB sum=yici.query(l-1, r),sumsq=square.query(l-1, r);
DB aver=sum/len;
DB res=sumsq/len-aver*aver;
cout<<fsp(4)<<res<<"\n";
}
#ifdef LOCAL
FOR(j,1,N){
cerr<<square.query(j-1,j)<<" ";
}
cerr<<"\n";
#endif
}
}
|
