Submission #72711518

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vec vector
#define pll pair<ll,ll>
const ll N = 2e5 + 50;
ll bit[N];

void add(int x,int v){
	for(int i = x ; i < N ; i += (i & (-i))){
		bit[i] += v;
	}
}

ll get(ll x){
	ll sum = 0;
	for(int i = x ; i > 0 ; i -= (i & (-i))){
		sum += bit[i];
	}
	return sum;
}

ll sum(ll l,ll r){
	return get(r) - get(l - 1);
}

void solve(){
	ll n,q;cin >> n >> q;
	vec<ll> a(n + 1);
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
		add(i,a[i]);
	}
	while(q--){
		ll op;cin >> op;
		if(op == 1){
			ll x;cin >> x;
			add(x,a[x + 1] - a[x]);
			add(x + 1,a[x] - a[x + 1]);
			swap(a[x],a[x + 1]);
		}else if(op == 2){
			ll l,r;cin >> l >> r;
			cout << sum(l,r) << "\n";
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
    return 0;
}

Submission Info

Judge Result