Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int N = 2e5 + 10;
- using lli = long long;
- lli fw[N];
- int n, m;
- void Update(int pst, lli val){
- for(int i = pst; i <= n; i += i & -i)
- fw[i] += val;
- }
- lli Sum(int pst, lli sum = 0){
- for(int i = pst; i >= 1; i -= i & -i)
- sum += fw[i];
- return sum;
- }
- int main(){
- scanf("%d %d", &n, &m);
- for(int i=1;i<=m;i++){
- int opr, a, b;
- scanf("%d %d %d", &opr, &a, &b);
- if(opr == 1){
- Update(b, (lli) a);
- }
- else if(opr == 2){
- printf("%lld\n", Sum(b) - Sum(a - 1));
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement