【HDOJ】4267 A Simple Problem with Integers

树状数组。Easy.

/* 4267 */
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

const int maxn = 50005;
const int maxm = 55;
int n;


inline int lowest(int x) {
    return -x & x;
}

typedef struct arr_t {
    int s[maxn];
    
    void clr() {
        memset(s, 0, sizeof(s));
    }
    
    void update(int x, int delta) {
        while (x <= n) {
            s[x] += delta;
            x += lowest(x);
        }
    }
    
    int sum(int x) {
        int ret = 0;
        
        while (x) {
            ret += s[x];
            x -= lowest(x);
        }
        return ret;
    }
} arr_t;

arr_t ts[maxm];
int A[maxn], M[11][maxn];
int ID[11][11];

void init_() {
    int cnt = 0;
    
    rep(i, 1, 11) {
        rep(j, 0, i) {
            ID[i][j] = cnt++;
        }
    }
    
    rep(i, 1, 11) {
        int k = i-1;
        rep(j, 1, maxn) {
            M[k][j] = M[k][j-1] + 1;
            if (M[k][j] == i)
                M[k][j] = 0;
        }
    }
}

void init() {
    rep(i, 0, maxm)
        ts[i].clr();
}

void update(int a, int b, int k, int delta) {
    int from = a;
    int to = a+(b-a)/k*k;
    int findex = (from+k-1)/k;
    int tindex = (to+k-1)/k;
    int id = ID[k][a%k];
    
    ts[id].update(findex, delta);
    ts[id].update(tindex+1, -delta);
}

int sum(int x) {
    int id, index, delta;
    int ret = 0;
    
    rep(i, 1, 11) {
        index = (x+i-1)/i;
        id = ID[i][M[i-1][x]];
        delta = ts[id].sum(index);
        ret += delta;
    }
    return ret;
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    int type;
    int a, b, k, c;
    int q;
    int ans;
    
    init_();
    while (scanf("%d", &n)!=EOF) {
        rep(i, 1, n+1)
            scanf("%d", &A[i]);
        init();
        scanf("%d", &q);
        while (q--) {
            scanf("%d %d", &type, &a);
            if (type == 1) {
                scanf("%d %d %d", &b, &k, &c);
                update(a, b, k, c);
            } else {
                ans = sum(a) + A[a];
                printf("%d
", ans);
            }
        }
    }
    
    #ifndef ONLINE_JUDGE
        printf("time = %d.
", (int)clock());
    #endif
    
    return 0;
}