結果

問題 No.945 YKC饅頭
ユーザー brthyyjpbrthyyjp
提出日時 2021-06-03 22:55:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,419 ms / 2,000 ms
コード長 3,288 bytes
コンパイル時間 275 ms
コンパイル使用メモリ 87,296 KB
実行使用メモリ 123,560 KB
最終ジャッジ日時 2023-08-11 00:51:18
合計ジャッジ時間 37,834 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
71,280 KB
testcase_01 AC 71 ms
71,376 KB
testcase_02 AC 91 ms
76,560 KB
testcase_03 AC 118 ms
77,628 KB
testcase_04 AC 84 ms
76,252 KB
testcase_05 AC 104 ms
77,144 KB
testcase_06 AC 117 ms
77,648 KB
testcase_07 AC 112 ms
77,380 KB
testcase_08 AC 86 ms
76,628 KB
testcase_09 AC 102 ms
77,320 KB
testcase_10 AC 114 ms
77,380 KB
testcase_11 AC 102 ms
77,328 KB
testcase_12 AC 110 ms
77,300 KB
testcase_13 AC 117 ms
77,404 KB
testcase_14 AC 118 ms
77,516 KB
testcase_15 AC 87 ms
76,396 KB
testcase_16 AC 99 ms
76,544 KB
testcase_17 AC 113 ms
77,432 KB
testcase_18 AC 111 ms
77,040 KB
testcase_19 AC 90 ms
76,536 KB
testcase_20 AC 88 ms
76,488 KB
testcase_21 AC 89 ms
76,548 KB
testcase_22 AC 123 ms
77,668 KB
testcase_23 AC 121 ms
77,592 KB
testcase_24 AC 122 ms
77,832 KB
testcase_25 AC 121 ms
77,604 KB
testcase_26 AC 123 ms
77,548 KB
testcase_27 AC 89 ms
76,404 KB
testcase_28 AC 90 ms
76,408 KB
testcase_29 AC 71 ms
71,380 KB
testcase_30 AC 69 ms
71,168 KB
testcase_31 AC 265 ms
82,380 KB
testcase_32 AC 287 ms
82,988 KB
testcase_33 AC 543 ms
93,652 KB
testcase_34 AC 765 ms
102,172 KB
testcase_35 AC 1,246 ms
117,000 KB
testcase_36 AC 726 ms
108,168 KB
testcase_37 AC 724 ms
104,860 KB
testcase_38 AC 716 ms
103,080 KB
testcase_39 AC 398 ms
87,276 KB
testcase_40 AC 460 ms
90,240 KB
testcase_41 AC 318 ms
83,648 KB
testcase_42 AC 1,000 ms
112,696 KB
testcase_43 AC 610 ms
105,704 KB
testcase_44 AC 995 ms
109,980 KB
testcase_45 AC 1,064 ms
117,608 KB
testcase_46 AC 225 ms
82,772 KB
testcase_47 AC 775 ms
101,672 KB
testcase_48 AC 295 ms
83,920 KB
testcase_49 AC 495 ms
90,932 KB
testcase_50 AC 1,117 ms
118,024 KB
testcase_51 AC 1,419 ms
123,520 KB
testcase_52 AC 1,392 ms
123,352 KB
testcase_53 AC 1,394 ms
123,388 KB
testcase_54 AC 1,404 ms
123,424 KB
testcase_55 AC 1,399 ms
123,560 KB
testcase_56 AC 293 ms
87,392 KB
testcase_57 AC 286 ms
87,128 KB
testcase_58 AC 826 ms
110,972 KB
testcase_59 AC 949 ms
117,388 KB
testcase_60 AC 581 ms
97,432 KB
testcase_61 AC 852 ms
112,764 KB
testcase_62 AC 807 ms
111,968 KB
testcase_63 AC 332 ms
87,256 KB
testcase_64 AC 573 ms
98,524 KB
testcase_65 AC 543 ms
96,060 KB
testcase_66 AC 530 ms
95,900 KB
testcase_67 AC 746 ms
104,436 KB
testcase_68 AC 579 ms
98,304 KB
testcase_69 AC 457 ms
90,812 KB
testcase_70 AC 470 ms
92,200 KB
testcase_71 AC 458 ms
92,232 KB
testcase_72 AC 627 ms
100,504 KB
testcase_73 AC 905 ms
115,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class LazySegTree:
    # RMQ and RUQ
    def __init__(self, init_val, seg_ide, lazy_ide, segfunc):
        self.n = len(init_val)
        self.num = 2**(self.n-1).bit_length()

        self.seg_ide = seg_ide
        self.lazy_ide = lazy_ide

        self.segfunc = segfunc

        # seg, lazy: 1-indexed
        self.seg = [seg_ide]*2*self.num
        for i in range(self.n):
            self.seg[i+self.num] = init_val[i]
        for i in range(self.num-1, 0, -1):
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

        self.lazy = [lazy_ide]*2*self.num

    def gindex(self, l, r):
        # l, r: 1-indexed
        L = l + self.num
        R = r + self.num
        lm = (L // (L & -L)) >> 1
        rm = (R // (R & -R)) >> 1
        while L < R:
            if R <= rm:
                yield R
            if L <= lm:
                yield L
            L = L >> 1
            R = R >> 1
        while L:
            yield L
            L = L >> 1

    def propagate(self, *ids):
        # ids: 1-indexed
        for i in reversed(ids):
            v = self.lazy[i]
            if v is None:
                continue
            self.lazy[2*i] = self.lazy[2*i+1] = self.seg[2*i] = self.seg[2*i+1] = v
            self.lazy[i] = None

    def update(self, l, r, x):
        # l, r: 0-indexed
        # change x to [l, r)
        *ids, = self.gindex(l, r)
        self.propagate(*ids)
        L = l + self.num
        R = r + self.num
        while L < R:
            if R & 1:
                R -= 1
                self.lazy[R] = self.seg[R] = x
            if L & 1:
                self.lazy[L] = self.seg[L] = x
                L += 1
            L = L >> 1
            R = R >> 1
        for i in ids:
            # i: 1-indexed
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

    def query(self, l, r):
        # l, r: 0-indexed
        # query for [l, r)
        if r <= l:
            return self.seg_ide

        self.propagate(*self.gindex(l, r))
        L = l + self.num
        R = r + self.num
        res = self.seg_ide
        while L < R:
            if R & 1:
                R -= 1
                res = self.segfunc(res, self.seg[R])
            if L & 1:
                res = self.segfunc(self.seg[L], res)
                L += 1
            L = L >> 1
            R = R >> 1
        return res

    def __str__(self): # for debug
        arr = [self.query(i,i+1) for i in range(self.n)]
        return str(arr)

def segfunc(x, y):
    if x <= y:
        return x
    else:
        return y

import sys
import io, os
input = sys.stdin.readline

INF = 10**18

def main():
    n, m = map(int, input().split())

    seg = LazySegTree([INF]*n, INF, None, segfunc)

    Q = []
    for i in range(m):
        l, r, t = map(str, input().split())
        l, r = int(l), int(r)
        l, r = l-1, r-1
        Q.append((l, r, t))

    for i in reversed(range(m)):
        l, r, t = Q[i]
        if t == 'Y':
            seg.update(l, r+1, 1)
        if t == 'K':
            seg.update(l, r+1, 2)
        if t == 'C':
            seg.update(l, r+1, 3)

    ans = [0]*3
    for i in range(n):
        t = seg.query(i, i+1)
        if t != INF:
            ans[t-1] += 1
    print(*ans)

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