3kcmDu - Online C++0x Compiler & Debugging Tool

/* AUTHOR: TUAN ANH - BUI */
// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y) return x = y, true;
        return false;
    }

template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y) return x = y, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */

const int MOD = 1e3 + 7;
const int inf = (int)1e9 + 27092008;
const ll INF  = (ll)1e18 + 27092008;
const int N = 2e5 + 5;
int n, q, node[N << 2], lazy[N << 2];
int fibo[N], sta, len;
map<ii, int> last;
vector<int> fib;

int calcFibo(int K) {
    if (K < N) return fibo[K];
    return fib[(K - sta) % len];
}

void pushDown(int id, int l, int r) {
    if (lazy[id]) {
        int mid = (l + r) >> 1;
        node[id << 1] += lazy[id] * (mid - l + 1);
        node[id << 1 | 1] += lazy[id] * (r - mid);
        lazy[id << 1] += lazy[id];
        lazy[id << 1 | 1] += lazy[id];
        lazy[id] = 0;
    }
}

void update(int id, int l, int r, int u, int v, int k) {
    if (l > v || r < u) return;
    if (u <= l && r <= v) {
        node[id] += (r - l + 1) * k;
        lazy[id] += k;
        return;
    }
    pushDown(id, l, r);
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, u, v, k);
    update(id << 1 | 1, mid + 1, r, u, v, k);
    node[id] = node[id << 1] + node[id << 1 | 1];
}

int get(int id, int l, int r, int u, int v) {
    if (l > v || r < u) return 0;
    if (u <= l && r <= v) return node[id];
    pushDown(id, l, r);
    int mid = (l + r) >> 1;
    return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
}

void init(void) {
    cin >> n >> q;
    fibo[1] = fibo[2] = 1;
    FOR(i, 3, N - 5) fibo[i] = (fibo[i - 1] + fibo[i - 2]) % MOD;
}

void process(void) {
    FOR(i, 2, N - 5) {
        if (last.find({fibo[i-1], fibo[i]}) != last.end()) {
            sta = last[{fibo[i-1], fibo[i]}];
            break;
        }
        last[{fibo[i-1], fibo[i]}] = i;
    }

    int a = fibo[sta - 1];
    int b = fibo[sta];
    fib.pb(fibo[sta]);
    for(int i = sta + 1; fibo[i] != b || fibo[i - 1] != a; i++) {
        fib.pb(fibo[i]);
    }
    len = (int)fib.size();

    while(q--) {
        int type; cin >> type;
        if (type == 1) {
            int l, r, k;
            cin >> l >> r >> k;
            update(1, 1, n, l, r, calcFibo(k));
        } else {
            int l, r;
            cin >> l >> r;
            cout << get(1, 1, n, l, r) << '\n';
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}