From ea2a5f0dc3000fe3c2f70c150ba5da195705b689 Mon Sep 17 00:00:00 2001
From: Ren Baoshuo <i@baoshuo.ren>
Date: Wed, 7 Jul 2021 19:05:20 +0800
Subject: [PATCH] =?UTF-8?q?P4145=20=E4=B8=8A=E5=B8=9D=E9=80=A0=E9=A2=98?=
 =?UTF-8?q?=E7=9A=84=E4=B8=83=E5=88=86=E9=92=9F=202=20/=20=E8=8A=B1?=
 =?UTF-8?q?=E7=A5=9E=E6=B8=B8=E5=8E=86=E5=90=84=E5=9B=BD?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

R52569587
---
 Luogu/problem/P4145/P4145.cpp | 84 +++++++++++++++++++++++++++++++++++
 1 file changed, 84 insertions(+)
 create mode 100644 Luogu/problem/P4145/P4145.cpp

diff --git a/Luogu/problem/P4145/P4145.cpp b/Luogu/problem/P4145/P4145.cpp
new file mode 100644
index 00000000..136ce3f0
--- /dev/null
+++ b/Luogu/problem/P4145/P4145.cpp
@@ -0,0 +1,84 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, m, k, l, r;
+long long a[100005];
+
+struct node {
+    int l, r;
+    long long s;
+    bool allIsOne;
+
+    node() {
+        l = r = s = 0;
+        allIsOne = false;
+    }
+    node(int _l, int _r) {
+        l = _l;
+        r = _r;
+        s = 0;
+        allIsOne = false;
+    }
+} tr[100005 << 2];
+
+void pushup(int u) {
+    tr[u].s = tr[u << 1].s + tr[u << 1 | 1].s;
+    tr[u].allIsOne = tr[u << 1].allIsOne && tr[u << 1 | 1].allIsOne;
+}
+
+void build(int u, int l, int r) {
+    tr[u] = node(l, r);
+    if (l == r) {
+        tr[u].s = a[l];
+        tr[u].allIsOne = (a[l] == 1 ? true : false);
+        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) {
+    if (tr[u].allIsOne) return;
+    if (tr[u].l == tr[u].r) {
+        tr[u].s = floor(sqrt(tr[u].s));
+        tr[u].allIsOne = (tr[u].s == 1 ? true : false);
+        return;
+    }
+    int mid = tr[u].l + tr[u].r >> 1;
+    if (l <= mid) modify(u << 1, l, r);
+    if (r > mid) modify(u << 1 | 1, l, r);
+    pushup(u);
+}
+
+long long query(int u, int l, int r) {
+    if (l <= tr[u].l && tr[u].r <= r) {
+        return tr[u].s;
+    }
+    int mid = tr[u].l + tr[u].r >> 1;
+    long long s = 0;
+    if (l <= mid) s += query(u << 1, l, r);
+    if (r > mid) s += query(u << 1 | 1, l, r);
+    return s;
+}
+
+int main() {
+    scanf("%d", &n);
+    for (int i = 1; i <= n; i++) {
+        scanf("%lld", a + i);
+    }
+    build(1, 1, n);
+    scanf("%d", &m);
+    for (int i = 0; i < m; i++) {
+        scanf("%d%d%d", &k, &l, &r);
+        if (l > r) swap(l, r);
+        if (k == 0) {
+            modify(1, l, r);
+        } else if (k == 1) {
+            printf("%lld\n", query(1, l, r));
+        }
+    }
+    return 0;
+}