#779224 (PyPy3) No.844 split game

提出ソース

結果

問題	No.844 split game
ユーザー	stng
提出日時	2022-07-16 17:29:00
言語	PyPy3 (7.3.15)
結果	AC
実行時間	896 ms / 2,000 ms
コード長	9,783 bytes
コンパイル時間	401 ms
コンパイル使用メモリ	87,060 KB
実行使用メモリ	108,732 KB
最終ジャッジ日時	2023-09-11 02:48:08
合計ジャッジ時間	25,359 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	408 ms 90,892 KB
testcase_01	AC	371 ms 97,144 KB
testcase_02	AC	701 ms 99,528 KB
testcase_03	AC	542 ms 99,472 KB
testcase_04	AC	353 ms 90,076 KB
testcase_05	AC	782 ms 104,396 KB
testcase_06	AC	406 ms 90,476 KB
testcase_07	AC	367 ms 94,096 KB
testcase_08	AC	299 ms 85,232 KB
testcase_09	AC	659 ms 94,392 KB
testcase_10	AC	821 ms 102,352 KB
testcase_11	AC	770 ms 106,824 KB
testcase_12	AC	635 ms 93,076 KB
testcase_13	AC	467 ms 89,148 KB
testcase_14	AC	474 ms 94,844 KB
testcase_15	AC	774 ms 106,904 KB
testcase_16	AC	881 ms 107,808 KB
testcase_17	AC	856 ms 107,676 KB
testcase_18	AC	779 ms 106,748 KB
testcase_19	AC	889 ms 108,732 KB
testcase_20	AC	784 ms 107,524 KB
testcase_21	AC	868 ms 108,252 KB
testcase_22	AC	896 ms 108,032 KB
testcase_23	AC	235 ms 80,512 KB
testcase_24	AC	265 ms 82,240 KB
testcase_25	AC	251 ms 80,932 KB
testcase_26	AC	201 ms 80,528 KB
testcase_27	AC	260 ms 80,808 KB
testcase_28	AC	157 ms 79,536 KB
testcase_29	AC	265 ms 82,236 KB
testcase_30	AC	268 ms 82,232 KB
testcase_31	AC	253 ms 80,828 KB
testcase_32	AC	214 ms 80,608 KB
testcase_33	AC	250 ms 81,776 KB
testcase_34	AC	213 ms 80,752 KB
testcase_35	AC	273 ms 82,040 KB
testcase_36	AC	246 ms 80,480 KB
testcase_37	AC	321 ms 83,928 KB
testcase_38	AC	396 ms 86,868 KB
testcase_39	AC	666 ms 95,488 KB
testcase_40	AC	307 ms 89,168 KB
testcase_41	AC	78 ms 70,996 KB
testcase_42	AC	77 ms 71,200 KB
testcase_43	AC	78 ms 71,164 KB
testcase_44	AC	78 ms 71,432 KB
testcase_45	AC	78 ms 71,188 KB
testcase_46	AC	78 ms 71,228 KB
testcase_47	AC	77 ms 71,380 KB
testcase_48	AC	78 ms 71,448 KB
testcase_49	AC	76 ms 71,044 KB
testcase_50	AC	78 ms 71,284 KB
testcase_51	AC	78 ms 71,556 KB
testcase_52	AC	78 ms 71,104 KB
testcase_53	AC	77 ms 71,244 KB
testcase_54	AC	78 ms 71,564 KB
testcase_55	AC	80 ms 71,440 KB
testcase_56	AC	79 ms 71,316 KB
testcase_57	AC	80 ms 71,424 KB
testcase_58	AC	78 ms 71,428 KB
testcase_59	AC	83 ms 71,408 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

n,m,a = map(int,input().split())
lrp = [[int(i)-1 for i in input().split()] for j in range(m)]

import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

class SegTree(object):
    def __init__(self, N, op_data, u_data):
        self._n = N
        self.log = (N-1).bit_length()
        self.size = 1 << self.log

        self.op = op_data
        self.e = u_data

        self.data = [u_data] * (2 * self.size)
        # self.len = [1] * (2 * self.size)

    def _update(self, i):
        self.data[i] = self.op(self.data[i << 1], self.data[i << 1 | 1])

    def initialize(self, arr=None):
        """ segtreeをarrで初期化する。len(arr) == Nにすること """
        if arr:
            for i, a in enumerate(arr, self.size):
                self.data[i] = a
        for i in reversed(range(1, self.size)):
            self._update(i)
            # self.len[i] = self.len[i << 1] + self.len[i << 1 | 1]

    def update(self, p, x):
        """ data[p] = x とする (0-indexed)"""
        p += self.size
        self.data[p] = x
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def get(self, p):
        """ data[p]を返す """
        return self.data[p + self.size]

    def prod(self, l, r):
        """
        op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
        """
        sml = self.e
        smr = self.e
        l += self.size
        r += self.size

        while l < r:
            if l & 1:
                sml = self.op(sml, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.data[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        """ op(data[0], data[1], ... data[N-1])を返す """
        return self.data[1]

    def max_right(self, l, func):
        """
        func(l, l+1, ..., r-1) = True,
        func(l, l+1, ..., r-1, r) = Falseとなる r を返す
        """
        if l == self._n:
            return self._n
        l += self.size
        sm = self.e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not func(self.op(sm, self.data[l])):
                while l < self.size:
                    l <<= 1
                    if func(self.op(sm, self.data[l])):
                        sm = self.op(sm, self.data[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.data[l])
            l += 1
            if (l & -l) == l:
                break
        return self._n

    def min_left(self, r, func):
        """
        func(     l, l+1, ..., r-1) = True,
        func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
        """
        if r == 0:
            return 0
        r += self.size
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r & 1:
                r >>= 1
            if not func(self.op(self.data[r], sm)):
                while r < self.size:
                    r = r << 1 | 1
                    if func(self.op(self.data[r], sm)):
                        sm = self.op(self.data[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.data[r], sm)
            if (r & -r) == r:
                break
        return 0


class LazySegTree(SegTree):
    def __init__(self, N, op_data, u_data, op_lazy, u_lazy, op_merge):
        super().__init__(N, op_data, u_data)
        self.composition = op_lazy
        self.mapping = op_merge
        self.id = u_lazy

        self.lazy = [u_lazy] * self.size

    def _all_apply(self, i, F):
        # self.data[i] = self.mapping(F, self.data[i], self.len[i])
        self.data[i] = self.mapping(F, self.data[i])
        if i < self.size:
            self.lazy[i] = self.composition(F, self.lazy[i])

    def _push(self, i):
        self._all_apply(i << 1, self.lazy[i])
        self._all_apply(i << 1 | 1, self.lazy[i])
        self.lazy[i] = self.id

    def update(self, p, x):
        """ data[p] = x とする (0-indexed)"""
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(p >> i)
        self.data[p] = x
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def apply(self, p, F):
        """ data[p]にFを作用させる(data[p] = op_merge(F, data[p])とする, 0-indexed) """
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(p >> i)
        # self.data[p] = self.mapping(F, self.data[p], self.len[p])
        self.data[p] = self.mapping(F, self.data[p])
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def range_apply(self, l, r, F):
        """ i = l, l+1, ..., r-1 について、Fを作用させる(op_merge(F, data[i]), 0-indexed) """
        if l == r:
            return

        l += self.size
        r += self.size
        for i in reversed(range(1, self.log + 1)):  # too->down
            if ((l >> i) << i) != l:
                self._push(l >> i)
            if ((r >> i) << i) != r:
                self._push((r - 1) >> i)

        l2, r2 = l, r
        while l < r:
            if l & 1:
                self._all_apply(l, F)
                l += 1
            if r & 1:
                r -= 1
                self._all_apply(r, F)
            l >>= 1
            r >>= 1
        l, r = l2, r2

        for i in range(1, self.log + 1):
            if ((l >> i) << i) != l:
                self._update(l >> i)
            if ((r >> i) << i) != r:
                self._update((r - 1) >> i)

    def get(self, p):
        """ data[p]を返す """
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(p >> i)
        return self.data[p]

    def prod(self, l, r):
        """
        op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
        l == rの時は単位元u_dataを返す
        """
        if l == r:
            return self.e

        l += self.size
        r += self.size
        for i in reversed(range(1, self.log + 1)):
            if ((l >> i) << i) != l:
                self._push(l >> i)
            if ((r >> i) << i) != r:
                self._push(r >> i)

        sml = self.e
        smr = self.e
        while l < r:
            if l & 1:
                sml = self.op(sml, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.data[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def max_right(self, l, func):
        """
        func(l, l+1, ..., r-1) = True,
        func(l, l+1, ..., r-1, r) = Falseとなる r を返す
        """
        if l == self._n:
            return self._n
        l += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(l >> i)

        sm = self.e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not func(self.op(sm, self.data[[l]])):
                while l < self.size:
                    self._push(l)
                    l <<= 1
                    if func(self.op(sm, self.data[l])):
                        sm = self.op(sm, self.data[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.data[l])
            l += 1
            if (l & -l) == l:
                break
        return self._n

    def min_left(self, r, func):
        """
        func(     l, l+1, ..., r-1) = True,
        func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
        """
        if r == 0:
            return 0
        r += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push((r - 1) >> i)
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r & 1:
                r >>= 1
            if not func(self.op(self.data[r], sm)):
                while r < self.size:
                    self._push(r)
                    r = r << 1 | 1
                    if func(self.op(self.data[r], sm)):
                        sm = self.op(self.data[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.data[r], sm)
            if (r & -r) == r:
                break
        return 0
    """
    遅延セグ木(ac-library移植)
    op_data(d_L, d_R) : d_Lとd_Rの二項演算, dataを返す
    op_lazy(lz_new, lz_orig) : lz_origにlz_newを作用させる, lazyを返す
    op_merge(lz, d) : dにlzを作用させる, dataを返す
    """

u_data = 0
op_data = max
u_lazy = -1

def op_lazy(nw, od):
    if nw == -1:
        return od
    return nw
 
 
def op_merge(lz, d):
    if lz == -1:
        return d
    return lz

lrp.sort(key=lambda x:(x[1],x[0]))
dp = [[-10**15]*2 for i in range(n+1)]
dp[0][1] = 0
dp[n][1] = 0
for i in range(n):
    dp[i][0] = 0

mv = 0


seg = LazySegTree(n+1, op_data, u_data, op_lazy, u_lazy, op_merge)
seg.initialize()

for i in range(m):
    l,r,p = lrp[i]
    p += 1
    r += 1
    if l != 0:
        if r != n:
            dp[r][1] = max(dp[l][1]+p-a,max(seg.get(l),dp[l][0])+p-2*a,dp[r][1])
        else:
            dp[r][1] = max(dp[l][1]+p,max(seg.get(l),dp[l][0])+p-a,dp[r][1])
    else:
        if r != n:
            dp[r][1] = max(dp[l][1]+p-a,max(seg.get(l),dp[l][0])+p-a,dp[r][1])
        else:
            dp[r][1] = max(dp[l][1]+p,max(seg.get(l),dp[l][0])+p,dp[r][1])
    #mv = max(mv,dp[r][1])
    #L, R = map(int, input().split())
    H = seg.prod(r, n+1)
    if H < dp[r][1]:
        seg.range_apply(r, n+1, dp[r][1])

ans = 0
#print(dp)
for i in range(n+1):
    ans = max(ans,dp[i][0],dp[i][1])

print(ans)

yukicoder

結果

テストケース

ソースコード