Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Pratiyush Mishra
- #include <bits/stdc++.h>
- #define ull unsigned long long int
- #define ll long long int
- #define LL_MAX 9223372036854775807
- #define pb push_back
- #define pf push_front
- #define mp make_pair
- #define popb pop_back
- #define vl vector<ll>
- #define pl pair<ll,ll>
- #define bs(v, x) binary_search(v.begin(), v.end(), x)
- #define mem1(a) memset(a, -1, sizeof(a))
- #define popf pop_front
- #define p0(x) cout << x << " "
- #define p1(x) cout << x << '\n'
- #define p2(x, y) cout << x << " " << y << '\n'
- #define p3(x, y, z) cout << x << " " << y << " " << z << '\n'
- #define printv(v) \
- for (ll i = 0; i < v.size(); ++i) \
- cout << v[i] << " "; \
- cout << '\n'
- #define pr1(x) cout << fixed << setprecision(15) << x << '\n'
- #define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
- // ordered_set s ; s.order_of_key(val) no. of elements strictly less than val
- // s.find_by_order(i) itertor to ith element (0 indexed)
- #define mod 1000000007
- #define mod1 998244353
- #define fio \
- ios_base::sync_with_stdio(false); \
- cin.tie(NULL)
- #define get(n) \
- ll n; \
- cin >> n
- #define getvec(v, n) \
- vector<ll> v(n); \
- for (ll i = 0; i < n; i++) \
- cin >> v[i];
- #define getstr(s) \
- string s; \
- cin >> s
- #define all(x) x.begin(), x.end()
- #define countBits(x) __builtin_popcount(x)
- using namespace std;
- // 1-indexed BIT to calculate sum in ranges...solves the following problem: https://codeforces.com/edu/course/2/lesson/4/1/practice/contest/273169/problem/A
- const int M = 1e6;
- ll v[M], bit[M];
- int n, q;
- void update(int pos, ll val)
- {
- if (pos <= 0)
- return;
- for (; pos <= n; pos += (pos & -pos))
- bit[pos] += val;
- }
- ll query(int r)
- {
- ll ans = 0;
- for (; r > 0; r -= (r & -r))
- ans += bit[r];
- return ans;
- }
- ll query(int l, int r)
- {
- ll ans = query(r) - query(l - 1);
- return ans;
- }
- void mainSolve()
- {
- cin >> n >> q;
- for (int i = 1; i <= n; i++)
- cin >> v[i], update(i, v[i]);
- while (q--)
- {
- int t;
- cin >> t;
- if (t == 1)
- {
- ll pos, val;
- cin >> pos >> val;
- ++pos;
- update(pos, val - v[pos]);
- v[pos] = val;
- }
- else
- {
- int l, r;
- cin >> l >> r;
- ++l;
- cout << query(l, r) << endl;
- }
- }
- }
- int main()
- {
- fio;
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- #endif
- //get(t);
- ll t = 1;
- while (t--)
- {
- mainSolve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement