結果

問題 No.1099 Range Square Sum
ユーザー tamatotamato
提出日時 2020-09-25 11:19:18
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,498 bytes
コンパイル時間 150 ms
コンパイル使用メモリ 82,388 KB
実行使用メモリ 229,484 KB
最終ジャッジ日時 2024-06-28 05:47:18
合計ジャッジ時間 8,083 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
61,684 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 40 ms
54,360 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 40 ms
53,732 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 TLE -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9
mask = (1 << 60) - 1


def main():
    import sys
    input = sys.stdin.buffer.readline

    def op(a, b):
        sqsum_a, sum_a = a >> 60, a & mask
        if sum_a > 10**12:
            sum_a -= 1 << 60
            sqsum_a += 1
        sqsum_b, sum_b = b >> 60, b & mask
        if sum_b > 10**12:
            sum_b -= 1 << 60
            sqsum_b += 1
        return ((sqsum_a + sqsum_b) << 60) + sum_a + sum_b

    e = 0

    def mapping(a, x, seg_len):
        sqsum, sum_ = a >> 60, a & mask
        if sum_ > 10**12:
            sum_ -= 1 << 60
            sqsum += 1
        sqsum_new = sqsum + (seg_len * x) ** 2 + 2 * x * sum_
        sum_new = sum_ + seg_len * x
        return (sqsum_new << 60) + sum_new

    def composition(x, y):
        return x + y

    id = 0

    class LazySegTree:
        # Range update query
        def __init__(self, A, op=op, e=e, mapping=mapping, composition=composition, id=id, initialize=True):
            self.N = len(A)
            self.LV = (self.N - 1).bit_length()
            self.N0 = 1 << self.LV
            self.op = op
            self.e = e
            self.mapping = mapping
            self.composition = composition
            self.id = id
            if initialize:
                self.data = [self.e] * self.N0 + A + [self.e] * (self.N0 - self.N)
                for i in range(self.N0 - 1, 0, -1):
                    self.data[i] = op(self.data[i * 2], self.data[i * 2 + 1])
            else:
                self.data = [self.e] * (self.N0 * 2)
            self.lazy = [id] * (self.N0 * 2)

        def _ascend(self, i):
            for _ in range(i.bit_length() - 1):
                i >>= 1
                self.data[i] = self.op(self.data[i * 2], self.data[i * 2 + 1])

        def _descend(self, idx):
            lv = idx.bit_length()
            seg_len = 1 << self.LV
            for j in range(lv - 1, 0, -1):
                seg_len >>= 1
                i = idx >> j
                x = self.lazy[i]
                if x == self.id:
                    continue
                self.lazy[i * 2] = self.composition(self.lazy[i * 2], x)
                self.lazy[i * 2 + 1] = self.composition(self.lazy[i * 2 + 1], x)
                self.lazy[i] = self.id
                self.data[i * 2] = self.mapping(self.data[i * 2], x, seg_len)
                self.data[i * 2 + 1] = self.mapping(self.data[i * 2 + 1], x, seg_len)

        # open interval [l, r)
        def apply(self, l, r, x):
            l += self.N0 - 1
            r += self.N0 - 1
            self._descend(l // (l & -l))
            self._descend(r // (r & -r) - 1)
            l_ori = l
            r_ori = r
            seg_len = 1
            while l < r:
                if l & 1:
                    self.data[l] = self.mapping(self.data[l], x, seg_len)
                    self.lazy[l] = self.composition(self.lazy[l], x)
                    l += 1
                if r & 1:
                    r -= 1
                    self.data[r] = self.mapping(self.data[r], x, seg_len)
                    self.lazy[r] = self.composition(self.lazy[r], x)
                l >>= 1
                r >>= 1
                seg_len <<= 1
            self._ascend(l_ori // (l_ori & -l_ori))
            self._ascend(r_ori // (r_ori & -r_ori) - 1)

        # open interval [l, r)
        def query(self, l, r):
            l += self.N0 - 1
            r += self.N0 - 1
            self._descend(l // (l & -l))
            self._descend(r // (r & -r) - 1)
            ret_l = self.e
            ret_r = self.e
            while l < r:
                if l & 1:
                    ret_l = self.op(ret_l, self.data[l])
                    l += 1
                if r & 1:
                    ret_r = self.op(self.data[r - 1], ret_r)
                    r -= 1
                l >>= 1
                r >>= 1
            return self.op(ret_l, ret_r)

    N = int(input())
    A = list(map(int, input().split()))
    B = [((a*a) << 60) + a for a in A]
    ST = LazySegTree(B)
    ans = []
    for _ in range(int(input())):
        query = list(map(int, input().split()))
        if query[0] == 1:
            l, r, x = query[1:]
            ST.apply(l, r+1, x)
        else:
            l, r = query[1:]
            val = ST.query(l, r + 1)
            sqsum, sum_ = val >> 60, val & mask
            if sum_ > 10**12:
                sqsum += 1
            ans.append(sqsum)
    print(*ans, sep="\n")


if __name__ == '__main__':
    main()
0