hdoj 4578 Transformation 【线段树 区间加、乘、修改、幂次求和】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (500000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 10007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
struct Tree
{
int l, r, len;
int sum1, sum2, sum3;
int lazy1, lazy2, lazy3;
};
Tree tree[MAXN<<2];
void PushUp(int o)
{
tree[o].sum1 = (tree[ll].sum1 + tree[rr].sum1) % MOD;
tree[o].sum2 = (tree[ll].sum2 + tree[rr].sum2) % MOD;
tree[o].sum3 = (tree[ll].sum3 + tree[rr].sum3) % MOD;
}
void Node(int o, int op, int c)
{
if(op == 1)
{
tree[o].lazy1 = (tree[o].lazy1 + c) % MOD;
int s1 = tree[o].sum1; int s2 = tree[o].sum2;
tree[o].sum1 = (tree[o].sum1 + tree[o].len*c%MOD)%MOD;
tree[o].sum2 = (tree[o].sum2 + (2*s1%MOD*c%MOD + c*c%MOD*tree[o].len%MOD)%MOD)%MOD;
tree[o].sum3 = (tree[o].sum3 + (3*c%MOD*s2%MOD + 3*c%MOD*c%MOD*s1%MOD + c*c%MOD*c%MOD*tree[o].len%MOD)%MOD)%MOD;
}
else if(op == 2)
{
tree[o].lazy1 = tree[o].lazy1 * c % MOD;
tree[o].lazy2 = tree[o].lazy2 * c % MOD;
tree[o].sum1 = tree[o].sum1 * c % MOD;
tree[o].sum2 = tree[o].sum2 * c % MOD * c % MOD;
tree[o].sum3 = tree[o].sum3 * c % MOD * c % MOD * c % MOD;
}
else if(op == 3)
{
tree[o].lazy1 = 0; tree[o].lazy2 = 1;
tree[o].lazy3 = c;
tree[o].sum1 = c * tree[o].len % MOD;
tree[o].sum2 = tree[o].sum1 * c % MOD;
tree[o].sum3 = tree[o].sum2 * c % MOD;
}
}
void Count(int o, int l1, int l2)
{
int s1 = tree[o].sum1; int s2 = tree[o].sum2; int s3 = tree[o].sum3;
tree[o].sum1 = (s1*l2%MOD + tree[o].len*l1%MOD)%MOD;
tree[o].sum2 = (s2*l2%MOD*l2%MOD + 2*s1%MOD*l2%MOD*l1%MOD + tree[o].len*l1%MOD*l1%MOD)%MOD;
tree[o].sum3 = (s3*l2%MOD*l2%MOD*l2%MOD + 3*s2%MOD*l2%MOD*l2%MOD*l1%MOD + 3*s1%MOD*l2%MOD*l1%MOD*l1%MOD + tree[o].len*l1%MOD*l1%MOD*l1%MOD)%MOD;
}
void PushDown(int o)
{
if(tree[o].lazy3 != -1)
{
Node(ll, 3, tree[o].lazy3); Node(rr, 3, tree[o].lazy3);
tree[o].lazy3 = -1;
}
if(tree[o].lazy1 || tree[o].lazy2 != 1)
{
tree[ll].lazy1 = (tree[o].lazy1 + tree[ll].lazy1 * tree[o].lazy2 % MOD) % MOD;
tree[ll].lazy2 = tree[ll].lazy2 * tree[o].lazy2 % MOD;
tree[rr].lazy1 = (tree[o].lazy1 + tree[rr].lazy1 * tree[o].lazy2 % MOD) % MOD;
tree[rr].lazy2 = tree[rr].lazy2 * tree[o].lazy2 % MOD;
Count(ll, tree[o].lazy1, tree[o].lazy2); Count(rr, tree[o].lazy1, tree[o].lazy2);
tree[o].lazy1 = 0; tree[o].lazy2 = 1;
}
}
void Build(int o, int l, int r)
{
tree[o].l = l; tree[o].r = r;
tree[o].len = r-l+1;
tree[o].lazy1 = 0;
tree[o].lazy2 = 1;
tree[o].lazy3 = -1;
tree[o].sum1 = tree[o].sum2 = tree[o].sum3 = 0;
if(l == r)
return ;
int mid = (tree[o].l + tree[o].r) >> 1;
Build(lson); Build(rson);
}
void Update(int o, int L, int R, int kind, int c)
{
if(tree[o].l >= L && tree[o].r <= R)
{
Node(o, kind, c);
return ;
}
PushDown(o);
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
Update(ll, L, R, kind, c);
else if(L > mid)
Update(rr, L, R, kind, c);
else
{
Update(ll, L, mid, kind, c);
Update(rr, mid+1, R, kind, c);
}
PushUp(o);
}
int Query(int o, int L, int R, int p)
{
if(tree[o].l >= L && tree[o].r <= R)
{
if(p == 1)
return tree[o].sum1;
else if(p == 2)
return tree[o].sum2;
else
return tree[o].sum3;
}
PushDown(o);
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
return Query(ll, L, R, p);
else if(L > mid)
return Query(rr, L, R, p);
else
return (Query(ll, L, mid, p) + Query(rr, mid+1, R, p)) % MOD;
}
int main()
{
int N, Q;
while(scanf("%d%d", &N, &Q), N||Q)
{
Build(1, 1, N);
W(Q)
{
int op, x, y, z;
Ri(op); Ri(x); Ri(y); Ri(z);
if(op == 4)
Pi(Query(1, x, y, z)%MOD);
else
Update(1, x, y, op, z);
}
}
return 0;
}