/** * author: shu8Cream * created: 28.12.2022 19:50:03 **/ #include using namespace std; #define overload3(a,b,c,d,...) d #define rep1(i,n) for (int i=0; i<(n); i++) #define rep2(i,a,n) for (int i=(a); i<(n); i++) #define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__) #define rrep1(i,n) for (int i=(n-1); i>=0; i--) #define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--) #define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) int((x).size()) #define pcnt __builtin_popcountll using ll = long long; using P = pair; template using vc = vector; template using vv = vc>; using vi = vc; using vvi = vv; const int INF = 1e9; const ll LINF = 8e18; templateistream& operator>>(istream&i,vc&v){rep(j,sz(v))i>>v[j];return i;} templatestring join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<ostream& operator<<(ostream&o,const vc&v){if(sz(v))o<istream& operator>>(istream&i,pair&v){return i>>v.first>>v.second;} templateostream& operator<<(ostream&o,const pair&v){return o< inline bool chmax(T& a, T b) {if(a inline bool chmin(T& a, T b) {if(a>b) { a=b;return true; } return false;} template string to_string(T s); template string to_string(pair p); string to_string(char c) { return string(1, c); } string to_string(string s) { return s; } string to_string(const char s[]) { return string(s); } template string to_string(T v) { if (v.empty()) return "{}"; string ret = "{"; for (auto x : v) ret += to_string(x) + ","; ret.back() = '}'; return ret; } template string to_string(pair p) { return "{" + to_string(p.first) + ":" + to_string(p.second) + "}"; } void debug_out() { cout << endl; } template void debug_out(Head H, Tail... T) { cout << to_string(H) << " "; debug_out(T...); } #ifdef _DEBUG #define debug(...) debug_out(__VA_ARGS__) #else #define debug(...) #endif struct DynamicSegTree { public: DynamicSegTree(int n): n(n),root(nullptr) {} void set(int pos, ll x) { set(root,0,n,pos,x); } ll get(int pos) { return get(root,0,n,pos); } ll prod(int l, int r) { return prod(root,0,n,l,r); } private: struct node { ll val; node *left; node *right; node(ll val): val(val), left(nullptr), right(nullptr) {} }; int n; node *root; // 0-indexed, [l,r) void set(node *&t, int l, int r, int pos, ll x){ if(t==nullptr) t = new node(0); // 単位元で初期化 if(r-l==1){ t->val += x; return; } int mid = (l + r)>>1; if(posleft,l,mid,pos,x); else set(t->right,mid,r,pos,x); // 葉以外のノードを更新 // ここの演算は区間クエリに依存 t->val = 0; // 初期化 if(t->left) t->val += t->left->val; if(t->right) t->val += t->right->val; } ll get(node *&t, int l, int r, int pos){ if(t==nullptr) return 0; // 単位元を返す if(r-l==1) return t->val; int mid = (l + r)>>1; if(posleft,l,mid,pos); else return get(t->right,mid,r,pos); } ll prod(node *&t, int sl, int sr, int l, int r){ if(t==nullptr) return 0; // 単位元を返す if(sr<=l || r<=sl) return 0; // 単位元を返す if(l<=sl && sr<=r) return t->val; int mid = (sl + sr)>>1; return prod(t->left,sl,mid,l,r) + prod(t->right,mid,sr,l,r); } }; void YUKI789(){ DynamicSegTree st(1000000000); int q; cin >> q; int op,x,l,r; ll y; ll ans = 0; for(;q--;){ cin >> op; if(op==0){ cin >> x >> y; st.set(x,y); }else{ cin >> l >> r; ans += st.prod(l,r+1); debug("ans", ans); } } cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); YUKI789(); }