HDU 4578 - Transformation
题意:
给你一个数组,初始值为零,有四种操作
1)“1 x y c”,代表 把区间 [x,y] 上的值全部加c
2)“2 x y c”,代表 把区间 [x,y] 上的值全部乘以c
3)“3 x y c”, 代表 把区间 [x,y]上的值全部赋值为c
4)“4 x y p”,代表 求区间 [x,y] 上值的p次方和1<=p<=3
思路:
注意到p最多只有3
因此我们可以在每个节点中维护好这个节点区间所有数和的1,2,3次方
而对于操作1,2,3我们设计三个懒标记(其优先级从上到下依次递减)
alt 区间赋值懒标记
mul 区间乘法懒标记
add 区间加法懒标记
当三个值同时存在时,add和mul一定是后来到的,因为alt会把add和mul清空,所以我们先传递的是same。对于后两个懒标记,先传递mul,最后add。因为当把一个区间标记上mul时,如果发现这个区间的add不为0,那么我会把add更新为add*mult
#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {//Parameter pack
auto tmp = { (cout << args << ' ', 0)... };
cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 10007;
struct node{
int l, r;
ll sum1, sum2, sum3;
ll add;
ll mul;
ll alt;
int len() { return r - l + 1; }
void update_alt(ll x) {
x %= MOD;
sum1 = len() * x % MOD;
sum2 = len() * x % MOD * x % MOD;
sum3 = len() * x % MOD * x % MOD * x % MOD;
alt = x;
add = 0;
mul = 1;
}
void update_mul(ll x) {
x %= MOD;
sum1 = sum1 % MOD * x % MOD;
sum2 = sum2 % MOD * x % MOD * x % MOD;
sum3 = sum3 % MOD * x % MOD * x % MOD * x % MOD;
mul = mul % MOD * x % MOD;
add = add % MOD * x % MOD;//在这里把add赋值为add*mul从而保证优先级正确
}
void update_add(ll x) {
x %= MOD;
sum3 = (sum3 % MOD + 3 * x % MOD * sum2 % MOD + 3 * x % MOD * x % MOD * sum1 % MOD + len() * x % MOD * x % MOD * x % MOD) % MOD;
sum2 = (sum2 % MOD + 2 * x % MOD * sum1 % MOD + len() % MOD * x % MOD * x % MOD) % MOD;
sum1 = (sum1 % MOD + len() % MOD * x % MOD) % MOD;
add = (add % MOD + x) % MOD;
}
};
struct Segtree {
node tree[N << 2];
void push_up(int root) {
tree[root].sum1 = (tree[root << 1].sum1 + tree[root << 1 | 1].sum1) % MOD;
tree[root].sum2 = (tree[root << 1].sum2 + tree[root << 1 | 1].sum2) % MOD;
tree[root].sum3 = (tree[root << 1].sum3 + tree[root << 1 | 1].sum3) % MOD;
}
void build(int root,int l,int r) {
if (l == r) tree[root] = { l,r,0,0,0,0,1,0 };
else {
tree[root] = { l,r,0,0,0,0,1,0 };
int mid = l + r >> 1;
build(root << 1, l, mid);
build(root << 1 | 1, mid + 1, r);
push_up(root);
}
}
void push_down(int root) {
if (tree[root].alt != 0) {
tree[root << 1].update_alt(tree[root].alt);
tree[root << 1 | 1].update_alt(tree[root].alt);
tree[root].alt = 0;
}
if (tree[root].mul != 1) {
tree[root << 1].update_mul(tree[root].mul);
tree[root << 1 | 1].update_mul(tree[root].mul);
tree[root].mul = 1;
}
if (tree[root].add != 0) {
tree[root << 1].update_add(tree[root].add);
tree[root << 1 | 1].update_add(tree[root].add);
tree[root].add = 0;
}
}
void modify(int root, int l, int r, int val, int op) {
if (l <= tree[root].l && tree[root].r <= r) {
if (op == 1)tree[root].update_add(val);
if (op == 2)tree[root].update_mul(val);
if (op == 3)tree[root].update_alt(val);
}
else {
push_down(root);
int mid = tree[root].l + tree[root].r >> 1;
if (l <= mid)modify(root << 1, l, r, val, op);
if (r > mid)modify(root << 1 | 1, l, r, val, op);
push_up(root);
}
}
ll query(int root, int l, int r,int p) {
if (l <= tree[root].l && tree[root].r <= r) {
if (p == 1)return tree[root].sum1;
if (p == 2)return tree[root].sum2;
if (p == 3)return tree[root].sum3;
}
else {
push_down(root);
int mid = tree[root].l + tree[root].r >> 1;
ll t1 = 0, t2 = 0;
if (l <= mid)t1 = query(root << 1, l, r, p);
if (r > mid)t2 = query(root << 1 | 1, l, r, p);
push_up(root);
return (t1 + t2) % MOD;
}
}
}seg;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, m;
while (cin >> n >> m) {
if (n == m && m == 0)break;
seg.build(1, 1, n);
int op, l, r, val;
for (int i = 0; i < m; i++) {
cin >> op >> l >> r >> val;
if (op < 4)seg.modify(1, l, r, val, op);
else cout << seg.query(1, l, r, val) << "\n";
}
}
return 0;
}