Codeforces 311D Interval Cubing 数学 + 线段树 (看题解)

Interval Cubing

这种数学题谁顶得住啊。

因为 (3 ^ 48) % (mod - 1)为 1 ， 所以48个一个循环节， 用线段树直接维护。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ull unsigned long long

using namespace std;

const int N = 1e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = ;
const double eps = 1e-;
const double PI = acos(-);

int n, q;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
int a[N << ][], lazy[N << ];

inline void pull(int rt) {
    for(int i = ; i < ; i++) {
        a[rt][i] = a[rt << ][i] + a[rt <<  | ][i];
        if(a[rt][i] >= mod) a[rt][i] -= mod;
    }
}

inline void push(int rt) {
    lazy[rt] %= ;
    if(lazy[rt]) {
        lazy[rt << ] += lazy[rt];
        lazy[rt <<  | ] += lazy[rt];
        rotate(a[rt << ], a[rt << ] + lazy[rt], a[rt << ] + );
        rotate(a[rt <<  | ], a[rt <<  | ] + lazy[rt], a[rt <<  | ] + );
        lazy[rt] = ;
    }
}

void build(int l, int r, int rt) {
    if(l == r) {
        scanf("%d", &a[rt][]);
        a[rt][] %= mod;
        for(int i = ; i < ; i++)
            a[rt][i] = 1LL * a[rt][i - ] * a[rt][i - ] % mod * a[rt][i - ] % mod;
        return;
    }
    int mid = l + r >> ;
    build(lson); build(rson);
    pull(rt);
}

void update(int L, int R, int l, int r, int rt) {
    if(l >= L && r <= R) {
        lazy[rt]++;
        rotate(a[rt], a[rt] + , a[rt] + );
        return;
    }
    push(rt);
    int mid = l + r >> ;
    if(L <= mid) update(L, R, lson);
    if(R > mid)  update(L, R, rson);
    pull(rt);
}

int query(int L, int R, int l, int r, int rt) {
    if(l >= L && r <= R) return a[rt][];
    push(rt);
    int mid = l + r >> ;
    if(R <= mid) return query(L, R, lson);
    else if(L > mid) return query(L, R, rson);
    else return (query(L, R, lson) + query(L, R, rson)) % mod;
}

int main() {
    scanf("%d", &n);
    build(, n, );
    scanf("%d", &q);
    while(q--) {
        int t, L, R;
        scanf("%d%d%d", &t, &L, &R);
        if(t == ) {
            printf("%d\n", query(L, R, , n, ));
        } else {
            update(L, R, , n, );
        }
    }
    return ;
 }

/*
*/