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
|
#include <bits/stdc++.h>
using namespace std;
#define dbg(x...) do { cout << #x << " -> "; err(x); } while (0)
void err() { cout << endl; }
template<class T, class... Ts>
void err(const T &arg, const Ts &... args) {
cout << arg << ' ';
err(args...);
}
#define endl "\n"
using pii = pair<int, int>;
using ll = long long;
using db = double;
const int N = 1e5 + 10;
const int p = 10007;
int n, q;
struct SEG {
struct node {
int l, r;
int sum[3], lazy[3];
node() {
sum[0] = sum[1] = sum[2] = 0;
lazy[0] = lazy[2] = 0;
lazy[1] = 1;
}
node(int _l, int _r) {
l = _l;
r = _r;
sum[0] = sum[1] = sum[2] = 0;
lazy[0] = lazy[2] = 0;
lazy[1] = 1;
}
} t[N << 2];
void add(int id, int v) {
int len = t[id].r - t[id].l + 1;
t[id].sum[2] = (t[id].sum[2] + (len * v % p * v % p * v % p) + (3 * v % p * v % p * t[id].sum[0] % p) +
(3 * v % p * t[id].sum[1] % p)) % p;
t[id].sum[1] = (t[id].sum[1] + (2 * v % p * t[id].sum[0] % p) + (len * v % p * v % p)) % p;
t[id].sum[0] = (t[id].sum[0] + len * v % p) % p;
t[id].lazy[0] = (t[id].lazy[0] + v) % p;
}
void mul(int id, int v) {
t[id].sum[0] = (t[id].sum[0] * v) % p;
t[id].sum[1] = (t[id].sum[1] * v % p * v) % p;
t[id].sum[2] = (t[id].sum[2] * v % p * v % p * v) % p;
t[id].lazy[0] = t[id].lazy[0] * v % p;
t[id].lazy[1] = t[id].lazy[1] * v % p;
}
void equ(int id, int v) {
int len = t[id].r - t[id].l + 1;
t[id].sum[0] = len * v % p;
t[id].sum[1] = t[id].sum[0] * v % p;
t[id].sum[2] = t[id].sum[1] * v % p;
t[id].lazy[0] = 0;
t[id].lazy[1] = 1;
t[id].lazy[2] = v;
}
void build(int id, int l, int r) {
t[id] = node(l, r);
if (l == r) {
return;
}
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
}
void down(int id) {
if (t[id].l >= t[id].r) return;
if (t[id].lazy[2]) {
equ(id << 1, t[id].lazy[2]);
equ(id << 1 | 1, t[id].lazy[2]);
t[id].lazy[2] = 0;
}
if (t[id].lazy[1] != 1) {
mul(id << 1, t[id].lazy[1]);
mul(id << 1 | 1, t[id].lazy[1]);
t[id].lazy[1] = 1;
}
if (t[id].lazy[0]) {
add(id << 1, t[id].lazy[0]);
add(id << 1 | 1, t[id].lazy[0]);
t[id].lazy[0] = 0;
}
}
void up(int id) {
int lson = id << 1;
int rson = id << 1 | 1;
t[id].sum[0] = (t[lson].sum[0] + t[rson].sum[0]) % p;
t[id].sum[1] = (t[lson].sum[1] + t[rson].sum[1]) % p;
t[id].sum[2] = (t[lson].sum[2] + t[rson].sum[2]) % p;
}
void update(int id, int ql, int qr, int op, int v) {
if (t[id].l >= ql && t[id].r <= qr) {
if (op == 0) {
add(id, v);
} else if (op == 1) {
mul(id, v);
} else if (op == 2) {
equ(id, v);
}
return;
}
down(id);
int mid = (t[id].l + t[id].r) >> 1;
if (ql <= mid) update(id << 1, ql, qr, op, v);
if (qr > mid) update(id << 1 | 1, ql, qr, op, v);
up(id);
}
int query(int id, int ql, int qr, int idx) {
if (t[id].l >= ql && t[id].r <= qr) {
return t[id].sum[idx];
}
down(id);
int mid = (t[id].l + t[id].r) >> 1;
int res = 0;
if (ql <= mid) res = (res + query(id << 1, ql, qr, idx)) % p;
if (qr > mid) res = (res + query(id << 1 | 1, ql, qr, idx)) % p;
return res;
}
} seg;
void RUN() {
while (scanf("%d %d", &n, &q) != EOF) {
if (n == 0 && q == 0) break;
seg.build(1, 1, n);
while (q--) {
int op, a, b, c;
scanf("%d %d %d %d", &op, &a, &b, &c);
if (op <= 3) {
seg.update(1, a, b, op - 1, c);
} else {
printf("%d\n", seg.query(1, a, b, c - 1));
}
}
}
}
int main() {
#ifdef LOCAL_JUDGE
freopen("input.txt", "r", stdin);
#endif
RUN();
#ifdef LOCAL_JUDGE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|