1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1b:T513,#include #include #define N 1000000 + 5 typedef long long ll; using namespace std; ll cnt = 0; ll n, m, k, a, b, c, value; ll v[N], ans[N], tree[N * 4]; ll segmentTree(ll start, ll end, ll node) { ll mid = (start + end) / 2; if (start == end) return tree[node] = v[start]; return tree[node] = segmentTree(start, mid, node * 2) + segmentTree(mid + 1, end, node * 2 + 1); } ll update(ll start, ll end, ll node, ll index) { ll mid = (start + end) / 2; if (start > index || end < index) return; if (start == end) return tree[node] = v[start]; return update(start, mid, node * 2, index) + update(mid + 1, end, node * 2 + 1, index); } ll sum(ll start, ll end, ll node, ll left, ll right) { ll mid = (start + end) / 2; if (start > right || end < left) return 0; else if (start >= left && end <= right) return tree[node]; return sum(start, mid, node * 2, left, right) + sum(mid + 1, end, node * 2 + 1, left, right); } int main() { cin >> n >> m >> k; for (ll i = 1; i <= n; i++) cin >> v[i]; segmentTree(1, n, 1); for (ll i = 1; i <= m + k; i++) { cin >> a >> b >> c; if (a == 1) { v[b] = c; update(1, n, 1, b); } else if (a == 2) { ans[cnt] = sum(1, n, 1, b, c); cnt++; } } for (ll i = 0; i < cnt; i++) cout << ans[i] << '\n'; }

제출 #130556

제출 정보

제출 결과

제출 코드

찾은 반례