0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-22 11:11:59 +00:00
OI-codes/LibreOJ/131/131.cpp

89 lines
1.9 KiB
C++
Raw Normal View History

#include <bits/stdc++.h>
#define int long long
using namespace std;
struct node {
int l, r;
long long s, d;
node() {
l = r = s = d = 0;
}
node(int _l, int _r) {
l = _l;
r = _r;
s = d = 0;
}
} tr[1000005 << 2];
int n, m, op, x, y, k;
long long a[1000005];
void pushup(int u) {
tr[u].s = tr[u << 1].s + tr[u << 1 | 1].s;
}
void pushdown(int u) {
if (!tr[u].d) return;
tr[u << 1].d += tr[u].d;
tr[u << 1].s += (tr[u << 1].r - tr[u << 1].l + 1) * tr[u].d;
tr[u << 1 | 1].d += tr[u].d;
tr[u << 1 | 1].s += (tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1) * tr[u].d;
tr[u].d = 0;
}
void build(int u, int l, int r) {
tr[u] = node(l, r);
if (l == r) {
tr[u].s = a[l];
return;
}
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
pushup(u);
}
void modify(int u, int l, int r, int d) {
if (tr[u].l >= l && tr[u].r <= r) {
tr[u].d += d;
tr[u].s += (tr[u].r - tr[u].l + 1) * d;
return;
}
int mid = tr[u].l + tr[u].r >> 1;
pushdown(u);
if (l <= mid) modify(u << 1, l, r, d);
if (r > mid) modify(u << 1 | 1, l, r, d);
pushup(u);
}
long long query(int u, int l, int r) {
if (tr[u].l >= l && tr[u].r <= r) {
return tr[u].s;
}
int mid = tr[u].l + tr[u].r >> 1;
long long s = 0;
pushdown(u);
if (l <= mid) s += query(u << 1, l, r);
if (r > mid) s += query(u << 1 | 1, l, r);
return s;
}
signed main() {
scanf("%lld%lld", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
build(1, 1, n);
for (int i = 0; i < m; i++) {
scanf("%lld%lld", &op, &x);
if (op == 1) {
scanf("%lld%lld", &y, &k);
modify(1, x, y, k);
} else if (op == 2) {
cout << query(1, x, x) << endl;
}
}
return 0;
}