HDU_4578 Transformation

这是一道明显的线段树问题,题目要求的操作比较多,主要是用Lazy标记就好了!

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
#define INF 0x3f3f3f3f
#define N 100005
const int MOD =  10007;
struct node
{
    int left;
    int right;
    int value;
    int flag;
};
node tree[N * 6];
int n, m;
int solve;
int mypow(int x, int n)
{
    if(x==0)
        return 0;
    int sum = 1;
    for (int i = 0; i < n; i++)
        sum = (sum * x) % MOD;
    return sum%MOD;
}
void build_tree(int l, int r, int p)
{
    int mid = (l + r) / 2;
    tree[p].left = l;
    tree[p].right = r;
    tree[p].value = 0;
    tree[p].flag = 1;
    if (l == r)
        return ;
    build_tree(l, mid, p * 2);
    build_tree(mid + 1, r, p * 2 + 1);
}

void update_add(int l, int r, int p, int value)
{
    if (tree[p].left == l && tree[p].right == r && tree[p].flag)
    {
        tree[p].value = (tree[p].value + value) % MOD;
        tree[p * 2].value = tree[p].value ;
        tree[p * 2 + 1].value = tree[p].value;
        tree[p * 2].flag = tree[p * 2 + 1].flag = 1;
        return ;
    }
    if (tree[p].flag)
    {
        tree[p].flag = 0;
        tree[p*2].flag = 1;
        tree[p*2+1].flag = 1;
        tree[p*2].value = tree[p].value;
        tree[p*2+1].value = tree[p].value;
    }
    int mid = (tree[p].left + tree[p].right) / 2;
    if (mid >= r)
        update_add(l, r, p * 2, value);
    else if (mid + 1 <= l)
        update_add(l, r, p * 2 + 1, value);
    else
    {
        update_add(l, mid, p * 2, value);
        update_add(mid + 1, r, p * 2 + 1, value);
    }
}

void update_multiply(int l, int r, int p, int value)
{
    if (tree[p].left == l && tree[p].right == r && tree[p].flag)
    {
        tree[p].value = (tree[p].value * value) % MOD;
        tree[p * 2].value = tree[p].value ;
        tree[p * 2 + 1].value = tree[p].value ;
        tree[p * 2].flag = tree[p * 2 + 1].flag = 1;
        return ;
    }
    if (tree[p].flag)
    {
        tree[p].flag = 0;
        tree[p*2].flag = 1;
        tree[p*2+1].flag = 1;
        tree[p*2].value = tree[p].value;
        tree[p*2+1].value = tree[p].value;
    }
    int mid = (tree[p].left + tree[p].right) / 2;
    if (mid >= r)
        update_multiply(l, r, p * 2, value);
    else if (mid + 1 <= l)
        update_multiply(l, r, p * 2 + 1, value);
    else
    {
        update_multiply(l, mid, p * 2, value);
        update_multiply(mid + 1, r, p * 2 + 1, value);
    }
}
void update_change(int l, int r, int p, int value)
{
    if (tree[p].left == l && tree[p].right == r)
    {
        tree[p].value = value % MOD;
        tree[p * 2].value = value % MOD;
        tree[p * 2 + 1].value = value % MOD;
        tree[p].flag = tree[p * 2].flag = tree[p * 2 + 1].flag = 1;
        return ;
    }
    if (tree[p].flag)
    {
        tree[p].flag = 0;
        tree[p*2].flag = 1;
        tree[p*2+1].flag = 1;
        tree[p*2].value = tree[p].value;
        tree[p*2+1].value = tree[p].value;
    }
    int mid = (tree[p].left + tree[p].right) / 2;
    if (mid >= r)
        update_change(l, r, p * 2, value);
    else if (mid + 1 <= l)
        update_change(l, r, p * 2 + 1, value);
    else
    {
        update_change(l, mid, p * 2, value);
        update_change(mid + 1, r, p * 2 + 1, value);
    }
}
void query(int l, int r, int t, int p)
{
    int mid = (tree[t].left + tree[t].right) / 2;
    if ((tree[t].left == l && tree[t].right == r && tree[t].flag))
    {
        int tmp = ((tree[t].right - tree[t].left + 1) * mypow(tree[t].value, p))%MOD;
        solve = (solve + tmp) % MOD;
        return ;
    }
    if(tree[t].flag)
    {
        tree[t*2].flag = 1;
        tree[t*2+1].flag = 1;
        tree[t*2].value = tree[t].value;
        tree[t*2+1].value = tree[t].value;
    }
    if (mid >= r)
        query(l, r, t * 2, p);
    else if (mid + 1 <= l)
        query(l, r, t * 2 + 1, p);
    else
    {
        query(l, mid, t * 2, p);
        query(mid + 1, r, t * 2 + 1, p);
    }
}
int main()
{
    int n, m, l, r, value, type;
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    while (~scanf("%d%d", &n, &m))
    {
        if(n==0 && m==0)
            break;
        build_tree(1, n, 1);
        for (int i = 0; i < m; i++)
        {
            scanf("%d%d%d%d", &type, &l, &r, &value);
            if (type == 1)
                update_add(l, r, 1, value);
            else if (type == 2)
                update_multiply(l, r, 1, value);
            else if (type == 3)
                update_change(l, r, 1, value);
            else
            {
                solve = 0;
                query(l, r, 1, value);
                printf("%d\n", solve);
            }
        }
    }
    return  0;
}