Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của flashmt

#include <iostream>
#include <algorithm>
#define N 500500
using namespace std;

int n,m,cnt,p[N],a[N],par[N],wage[N],ans[N],f[N],type[N],x[N],y[N];
int pu[N],pa[N],ax[N],ay[N],ux[N],uy[N];

void add(int x,int v)
{
    while (x<=m) f[x]+=v, x+=x&-x;
}

int get(int x)
{
    int r=0;
    while (x) r+=f[x], x-=x&-x;
    return r;
}

void visit(int x)
{
    for (int i=pa[x]+1;i<=pa[x+1];i++) ans[ay[i]]=get(ax[i])+wage[x];
    for (int i=pu[x]+1;i<=pu[x+1];i++) add(ux[i],uy[i]);
    for (int i=p[x]+1;i<=p[x+1];i++) visit(a[i]);
    for (int i=pu[x]+1;i<=pu[x+1];i++) add(ux[i],-uy[i]);
}

int main()
{
    char s[10];
    cin >> n >> m;
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&wage[i]);
        if (i>1) scanf("%d",&par[i]), p[par[i]]++;
    }
    for (int i=2;i<=n+1;i++) p[i]+=p[i-1];
    for (int i=2;i<=n;i++) a[p[par[i]]--]=i;
    for (int i=1;i<=m;i++)
    {
        scanf("%s%d",&s,&x[i]);
        type[i]=(s[0]=='p');
        if (type[i]) scanf("%d",&y[i]), pu[x[i]]++;
        else y[i]=++cnt, pa[x[i]]++;
    }
    for (int i=2;i<=n+1;i++) pu[i]+=pu[i-1], pa[i]+=pa[i-1];
    for (int i=1;i<=m;i++)
        if (!type[i]) ax[pa[x[i]]]=i, ay[pa[x[i]]--]=y[i];
        else ux[pu[x[i]]]=i, uy[pu[x[i]]--]=y[i];
    visit(1);
    for (int i=1;i<=cnt;i++) printf("%d\n",ans[i]);
}

Code mẫu của ladpro98

#include <bits/stdc++.h>
const int N = 500005;
using namespace std;
int init[N], bit[N], start[N], finish[N];//, ord[N];
vector<int> a[N];
int n, m, pos;

void preOrder(int u) {
    start[u] = ++pos;
    //ord[pos] = u;
    int i, v;
    for(i=0; i<a[u].size(); i++) {
        v = a[u][i]; preOrder(v);
    }
    finish[u] = pos;
}

void Upd(int i, int v) {
    while (i <= pos) {
        bit[i] += v; i += i & -i;
    }
}

int Get(int i) {
    int s = 0;
    while (i) {
        s += bit[i]; i -= i & -i;
    }
    return s;
}

int main()
{
    scanf("%d %d\n", &n, &m);
    scanf("%d\n", &init[1]);
    int i, v, x; char c;
    for(i=2; i<=n; i++) {
        scanf("%d %d\n", &init[i], &v);
        a[v].push_back(i);
    }
    preOrder(1);
    //for(int i=1; i<=pos; i++) cout << ord[i] << endl;

    while (m--) {
        scanf("%c", &c);
        if (c == 'p') {
            scanf("%d %d\n", &v, &x);
            Upd(start[v] + 1, x); Upd(finish[v] + 1, -x);
        }
        else {
            scanf("%d\n", &v);
            printf("%d\n", init[v] + Get(start[v]));
        }
    }
    return 0;
}

Code mẫu của RR

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <complex>

#define FOR(i,a,b) for(int i = a; i <= b; ++i)
#define FORD(i,a,b) for(int i = a; i >= b; --i)
#define REP(i,a) for(int i = 0; i < a; ++i)
#define MP make_pair
#define PB push_back
using namespace std;

const int MN = 1000111;

vector<int> ke[MN];
int A[MN], n, getIn[MN], getOut[MN], now, sum[MN];

void dfs(int u, int fu) {
    getIn[u] = ++now;
    REP(i,ke[u].size()) {
        int v = ke[u][i];
        if (v != fu) dfs(v, u);
    }
    getOut[u] = ++now;
}

#define _(u) ((u) & (-(u)))

void update(int u, int k) {
    while (u <= (n<<1)) {
        sum[u] += k;
        u += _(u);
    }
}

int get(int u) {
    int res = 0;
    while (u) {
        res += sum[u];
        u -= _(u);
    }
    return res;
}

//Buffer reading
int INP,AM;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        if (feof(stdin)) memset(BUF, 0, sizeof BUF); else fread(BUF,1,BUFSIZE,stdin); \
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//End of buffer reading

int main() {
    int q;
    GN(n); GN(q);
    GN(A[1]);
    int u;
    FOR(i,2,n) {
        GN(A[i]);
        GN(u);
        ke[u].PB(i);
    }
    dfs(1, -1);

    char c;
    int a, x;
    while (q--) {
        c = '#';
        while (c != 'p' && c != 'u') GETCHAR(c);
        if (c == 'p') {
            GN(a); GN(x);
            update(getIn[a]+1, x);
            update(getOut[a], -x);
        }
        else {
            GN(a);
            printf("%d\n", get(getIn[a]) + A[a]);
        }
    }
    return 0;
}

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }

typedef pair<int, int> II;

const double PI = acos(-1.0);
const double eps = 1e-9;

const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e17 + 5;
const ll mod = (ll)1e9 + 7;

const int bfsz = 1 << 16; char bf[bfsz + 5]; int rsz = 0;int ptr = 0;
char gc() { if (rsz <= 0) { ptr = 0; rsz = (int) fread(bf, 1, bfsz, stdin); if (rsz <= 0) return EOF; } --rsz; return bf[ptr++]; }
void ga(char &c) { c = EOF; while (!isalpha(c)) c = gc(); }
int gs(char s[]) { int l = 0; char c = gc(); while (isspace(c)) c = gc(); while (c != EOF && !isspace(c)) { s[l++] = c; c = gc(); } s[l] = '\0'; return l; }
template<class T> bool gi(T &v) {
    v = 0; char c = gc(); while (c != EOF && c != '-' && !isdigit(c)) c = gc(); if (c == EOF) return false; bool neg = c == '-'; if (neg) c = gc();
    while (isdigit(c)) { v = v * 10 + c - '0'; c = gc(); } if (neg) v = -v; return true;
}

#define maxn 2000005

int adj[maxn], next[maxn], last[maxn], E = 0;
int in[maxn], out[maxn];
int num = 0, n, q;
ll a[maxn], f[maxn];

void add(int u, int v){
    adj[E] = v; next[E] = last[u]; last[u] = E++;
}

void go(int u){
    in[u] = ++num;
    for(int e = last[u]; e != -1; e = next[e]){
        int v = adj[e];
        go(v);
    }
    out[u] = ++num;
}

char s[3];

ll get(int u){
    ll res = 0;
    for(int i = u; i > 0; i -= i & -i){
        res += f[i];
    }
    return res;
}

void update(int u, int gt){
    for(int i = u; i <= num; i += i & -i)
        f[i] += gt;
}

int main(){
//    freopen("in.txt", "r", stdin);

    gi(n); gi(q);
    gi(a[1]);
    int u, v;
    E = 0; ms(last, -1); ms(f, 0);
    For(i, 2, n){
        gi(a[i]); gi(u);
        add(u, i);
    }


    go(1);
    Rep(run, q){
        gs(s);
        if(s[0] == 'u'){
            gi(u);
            printf("%I64d\n", get(in[u]) + a[u]);
        }
        else{
            gi(u); gi(v);
            update(in[u] + 1, v); update(out[u], -v);
        }
    }
//  cout << clock() << endl;

    return 0;
}

Code mẫu của skyvn97

#include<cstdio>
#include<vector>
#define MAX   500500
#define FOR(i,a,b) for (int i=(a),_b=(b);i<=_b;i=i+1)
#define REP(i,n) for (int i=0,_n=(n);i<_n;i=i+1)
using namespace std;
class BIT {
    private:
    vector<int> v;
    int n;
    void update(int x,int d) {
        if (x<1 || x>n) return;
        for (;x<=n;x+=x&-x) v[x]+=d;
    }
    public:
    BIT() {
        n=0;
    }
    BIT(int n) {
        this->n=n;
        v.assign(n+7,0);
    }
    int get(int x) const {
        if (x<1 || x>n) return (0);
        int ret=0;
        for (;x>=1;x&=x-1) ret+=v[x];
        return (ret);
    }
    void update(int l,int r,int d) {
        if (l>r) return;
        update(r+1,-d);
        update(l,d);
    }
};
BIT bit;
vector<int> ch[MAX];
int sta[MAX],fin[MAX],fst[MAX];
int n,q,cnt;
inline int nextint(void) {
    int x;
    scanf("%d",&x);
    return (x);
}
void loadtree(void) {
    n=nextint();
    q=nextint();
    bit=BIT(n);
    FOR(i,1,n) {
        fst[i]=nextint();
        if (i>1) ch[nextint()].push_back(i);
    }
}
void dfs(int u) {
    sta[u]=++cnt;
    REP(i,ch[u].size()) dfs(ch[u][i]);
    fin[u]=cnt;
}
void process(void) {
    FOR(i,1,n) bit.update(sta[i],sta[i],fst[i]);
    REP(zz,q) {
        char c;
        scanf(" %c",&c);
        int u=nextint();
        if (c=='p') bit.update(sta[u]+1,fin[u],nextint());
        else printf("%d\n",bit.get(sta[u]));
    }
}
int main(void) {
    loadtree();
    dfs(1);
    process();
    return 0;
}