2018CCPC吉林 H题 Lovers 线段树

题目链接

Lovers

题意

现在有n个空字符串

$$s_1,s_2,\cdots ,s_n$$

和m次操作,操作分为以下两种

• wrap l r d, 对于任意$j\in [l,r]$,将$s_j$变成$d{s}_{j}d$,就是在两边各家一个数字d
• query l r, 求${\sum }_{i=l}^{r}val(s_i)$,$val(s)$表示字符串s对应的数字

$n,m\le 10^5$

思路

典型的线段树区间更新+区间求和
我们使用线段树维护区间内的真值和val1以及10的最高次幂的和val2,以及加到这个区间的数字d和长度len.
区间维护变成

$$val{1}^{\prime }=val1\ast 10+d+val2\ast 10\ast d$$$$val{2}^{\prime }=val2\ast 100$$

当lazy标记下推时更新儿子节点

$$val1[son{]}^{\prime }=val1[son]\ast 10^{len[fa]}+lazy1[fa]\ast (r-l+1)+val2[fa]\ast lazy2[fa]\ast 10^{len[fa]}$$

其中lazy1加在字符串右边的数,lazy2表示加在字符串左边的数,并且有.

$$lazy{1}^{\prime }=lazy1\ast 10^{len}+d$$$$lazy{2}^{\prime }=d\ast 10^{len}+lazy2$$

最终答案就是区间的val1

代码

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define inf 0x3f3f3f3f
#define cases(t) for (int cas = 1; cas <= (int)t; ++cas)
using namespace std;

const int N = 2e5 + 10;
const long long mod = 1e9 + 7;
long long lz1[N << 2], lz2[N << 2], val1[N << 2], val2[N << 2], len[N << 2];

long long ksm(long long a, long long k) {
    long long res = 1;
    while (k) {
        if (k & 1) res = res * a % mod;
        a = a * a % mod;
        k >>= 1;
    }
    return res;
}

void pushUp(int k) {
    val1[k] = (val1[k << 1] + val1[k << 1 | 1]) % mod;
    val2[k] = (val2[k << 1] + val2[k << 1 | 1]) % mod;
}

void pushDown(int k, int l, int r) {
    if (len[k] == 0) return;

    int mid = (l + r) >> 1;

    lz1[k << 1] = (ksm(10, len[k]) * lz1[k << 1] % mod + lz1[k]) % mod;
    lz2[k << 1] = (ksm(10, len[k << 1]) * lz2[k] % mod + lz2[k << 1]) % mod;
    len[k << 1] += len[k];

    lz1[k << 1 | 1] = (ksm(10, len[k]) * lz1[k << 1 | 1] % mod + lz1[k]) % mod;
    lz2[k << 1 | 1] = (ksm(10, len[k << 1 | 1]) * lz2[k] % mod + lz2[k << 1 | 1]) % mod;
    len[k << 1 | 1] += len[k];

    val1[k << 1] = (val1[k << 1] * ksm(10, len[k]) % mod + lz1[k] * (mid - l + 1) % mod + val2[k << 1] * lz2[k] % mod * ksm(10, len[k]) % mod) % mod;
    val2[k << 1] = (val2[k << 1] * ksm(100, len[k])) % mod;

    val1[k << 1 | 1] = (val1[k << 1 | 1] * ksm(10, len[k]) % mod + lz1[k] * (r - mid) % mod + val2[k << 1 | 1] * lz2[k] % mod * ksm(10, len[k]) % mod) % mod;
    val2[k << 1 | 1] = (val2[k << 1 | 1] * ksm(100, len[k])) % mod;

    len[k] = 0;
    lz1[k] = lz2[k] = 0;
}

void build(int k, int l, int r) {
    lz1[k] = lz2[k] = len[k] = 0;
    if (l == r) {
        val1[k] = 0;
        val2[k] = 1;
        return;
    }
    int mid = (l + r) >> 1;
    build(k << 1, l, mid);
    build(k << 1 | 1, mid + 1, r);
    pushUp(k);
}

void update(int k, int l, int r, int left, int right, int d) {
    if (left <= l && r <= right) {
        lz1[k] = (lz1[k] * 10 + d) % mod;
        lz2[k] = (ksm(10, len[k]) * d % mod + lz2[k]) % mod;
        len[k]++;
        val1[k] = (val1[k] * 10 % mod + d * (r - l + 1) % mod + val2[k] * 10 * d % mod) % mod;
        val2[k] = (val2[k] * 100) % mod;
        return;
    }
    pushDown(k, l, r);
    int mid = (l + r) >> 1;
    if (left <= mid) update(k << 1, l, mid, left, right, d);
    if (mid < right) update(k << 1 | 1, mid + 1, r, left, right, d);
    pushUp(k);
}

long long query(int k, int l, int r, int left, int right) {
    if (left <= l && r <= right) return val1[k];
    pushDown(k, l, r);
    long long ans = 0;
    int mid = (l + r) >> 1;
    if (left <= mid) ans = (ans + query(k << 1, l, mid, left, right)) % mod;
    if (mid < right) ans = (ans + query(k << 1 | 1, mid + 1, r, left, right)) % mod;
    return ans;
}

int n, m;
int l, r, d;
char op[20];

int main() {
    int t;
    scanf("%d", &t);
    cases(t) {
        scanf("%d%d", &n, &m);
        build(1, 1, n);
        printf("Case %d:\n", cas);
        while (m--) {
            scanf("%s", op);
            if (op[0] == 'w') {
                scanf("%d%d%d", &l, &r, &d);
                update(1, 1, n, l, r, d);
            } else {
                scanf("%d%d", &l, &r);
                printf("%lld\n", query(1, 1, n, l, r));
            }
        }
    }
    return 0;
}