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
| #include <cstdio>
#include <climits>
#define MAXN 500005
#define MOD 1000000007
typedef long long ll;
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
inline ll read()
{
char c = getchar();
ll ret = 0;
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 + c - '0', c = getchar();
return ret;
}
inline ll sqr(ll x)
{
return ((x % MOD) * (x % MOD)) % MOD;
}
template <typename T>
void swap(T& a, T& b)
{
T t = a;
a = b, b = t;
}
int N, M;
ll begin[MAXN];
struct nod
{
ll sum, mx, mn, squ;
double dsum;
nod (ll isum, ll imx, ll imn, ll isqu, double idsum)
{
sum = isum, mx = imx, mn = imn,
squ = isqu, dsum = idsum;
}
};
struct sgt
{
ll sum, mx, mn, squ, add, cov, mul;
double dsum;
int l, r, mid, siz;
sgt *lson, *rson;
sgt (int le, int ri)
{
l = le, r = ri, mid = (l + r) >> 1, siz = r - l + 1;
lson = rson = NULL, sum = mx = mn = squ = 0,
add = 0, mul = 1, cov = -1, dsum = 0;
}
void push_up()
{
sum = (lson->sum + rson->sum) % MOD;
mx = max(lson->mx, rson->mx);
mn = min(lson->mn, rson->mn);
squ = (lson->squ + rson->squ) % MOD;
dsum = lson->dsum + rson->dsum;
}
void plus(ll K)
{
squ = (squ + (((2 * (K % MOD)) % MOD) * sum) % MOD
+ (sqr(K) * siz) % MOD) % MOD;
sum = (sum + ((K % MOD) * siz) % MOD) % MOD;
mx += K, mn += K, dsum += K * siz;
add = add + K;
}
void multiply(ll K)
{
squ = (squ * sqr(K)) % MOD, sum
= (sum * (K % MOD)) % MOD, dsum *= K;
mx *= K, mn *= K;
if (K < 0) swap(mx, mn);
mul = mul * K, add = add * K;
}
void cover(ll K)
{
squ = (sqr(K) * siz) % MOD, sum = ((K % MOD) * siz) % MOD;
mx = mn = K, dsum = K * siz;
cov = K, mul = 1, add = 0;
}
void push_down()
{
if (cov != -1) lson->cover(cov), rson->cover(cov), cov = -1;
if (mul != 1) lson->multiply(mul), rson->multiply(mul), mul = 1;
if (add) lson->plus(add), rson->plus(add), add = 0;
}
void build()
{
if (l >= r) sum = begin[l] % MOD, squ = sqr(begin[l]),
mx = begin[l], mn = begin[l], dsum = begin[l];
else lson = new sgt(l, mid), rson = new sgt(mid + 1, r),
lson->build(), rson->build(), push_up();
}
void modify(int L, int R, ll K, char t)
{
if (l == L && r == R)
{
if (t == 'p') plus(K);
else if (t == 'm') multiply(K);
else if (t == 'c') cover(K);
}
else
{
push_down();
if (R <= mid) lson->modify(L, R, K, t);
else if (L > mid) rson->modify(L, R, K, t);
else lson->modify(L, mid, K, t), rson->modify(mid + 1, R, K, t);
push_up();
}
}
nod query(int L, int R)
{
if (l == L && r == R) return nod(sum, mx, mn, squ, dsum);
else
{
push_down();
if (R <= mid) return lson->query(L, R);
else if (L > mid) return rson->query(L, R);
else
{
nod ls = lson->query(L, mid), rs = rson->query(mid + 1, R);
return nod((ls.sum + rs.sum) % MOD, max(ls.mx, rs.mx),
min(ls.mn, rs.mn), (ls.squ + rs.squ) % MOD, ls.dsum + rs.dsum);
}
}
}
}*hed;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
N = read(), M = read();
int i;
for (i = 1; i <= N; ++i) begin[i] = read();
hed = new sgt(1, N), hed->build();
ll opt, p1, p2, p3, t;
for (i = 1; i <= M; ++i)
{
opt = read(), p1 = read(), p2 = read();
if (opt == 1) printf("%lld\n", (hed->query(p1, p2).sum % MOD + MOD) % MOD);
else if (opt == 2) printf("%lld\n", hed->query(p1, p2).mx);
else if (opt == 3) printf("%lld\n", hed->query(p1, p2).mn);
else if (opt == 4) hed->modify(p1, p2, read(), 'p');
else if (opt == 5) t = hed->query(p1, p1).mx, t = t ^ p2, hed->modify(p1, p1, t, 'c');
else if (opt == 6) printf("%.2lf\n", hed->query(p1, p2).dsum / (double)(p2 - p1 + 1));
else if (opt == 7) hed->modify(p1, p2, -1, 'm');
else if (opt == 8) hed->modify(p1, p2, read(), 'c');
else if (opt == 9) printf("%lld\n", (hed->query(p1, p2).squ % MOD + MOD) % MOD);
}
return 0;
}
|
