結果

問題 No.945 YKC饅頭
ユーザー brthyyjpbrthyyjp
提出日時 2021-06-03 22:52:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,954 ms / 2,000 ms
コード長 3,585 bytes
コンパイル時間 715 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 144,832 KB
最終ジャッジ日時 2024-11-17 12:14:29
合計ジャッジ時間 52,527 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
52,608 KB
testcase_01 AC 42 ms
52,352 KB
testcase_02 AC 77 ms
72,192 KB
testcase_03 AC 114 ms
76,160 KB
testcase_04 AC 72 ms
66,944 KB
testcase_05 AC 93 ms
76,032 KB
testcase_06 AC 109 ms
76,012 KB
testcase_07 AC 104 ms
76,160 KB
testcase_08 AC 76 ms
69,888 KB
testcase_09 AC 93 ms
75,776 KB
testcase_10 AC 108 ms
76,160 KB
testcase_11 AC 94 ms
75,904 KB
testcase_12 AC 104 ms
76,288 KB
testcase_13 AC 114 ms
76,404 KB
testcase_14 AC 111 ms
76,036 KB
testcase_15 AC 67 ms
65,664 KB
testcase_16 AC 87 ms
72,576 KB
testcase_17 AC 99 ms
75,776 KB
testcase_18 AC 104 ms
76,544 KB
testcase_19 AC 85 ms
76,416 KB
testcase_20 AC 72 ms
69,888 KB
testcase_21 AC 78 ms
68,992 KB
testcase_22 AC 112 ms
76,032 KB
testcase_23 AC 113 ms
76,584 KB
testcase_24 AC 113 ms
76,160 KB
testcase_25 AC 116 ms
76,424 KB
testcase_26 AC 112 ms
76,160 KB
testcase_27 AC 84 ms
75,648 KB
testcase_28 AC 85 ms
75,648 KB
testcase_29 AC 40 ms
52,736 KB
testcase_30 AC 39 ms
52,224 KB
testcase_31 AC 360 ms
86,528 KB
testcase_32 AC 552 ms
91,648 KB
testcase_33 AC 879 ms
110,204 KB
testcase_34 AC 1,007 ms
112,088 KB
testcase_35 AC 1,883 ms
136,256 KB
testcase_36 AC 881 ms
111,960 KB
testcase_37 AC 804 ms
108,172 KB
testcase_38 AC 834 ms
108,156 KB
testcase_39 AC 616 ms
95,188 KB
testcase_40 AC 845 ms
106,240 KB
testcase_41 AC 535 ms
91,648 KB
testcase_42 AC 1,262 ms
123,824 KB
testcase_43 AC 663 ms
108,336 KB
testcase_44 AC 1,406 ms
128,336 KB
testcase_45 AC 1,268 ms
128,932 KB
testcase_46 AC 391 ms
90,624 KB
testcase_47 AC 1,090 ms
111,288 KB
testcase_48 AC 347 ms
84,776 KB
testcase_49 AC 731 ms
99,252 KB
testcase_50 AC 1,381 ms
129,556 KB
testcase_51 AC 1,916 ms
144,444 KB
testcase_52 AC 1,941 ms
144,436 KB
testcase_53 AC 1,889 ms
144,440 KB
testcase_54 AC 1,954 ms
144,832 KB
testcase_55 AC 1,949 ms
143,544 KB
testcase_56 AC 612 ms
104,576 KB
testcase_57 AC 605 ms
104,704 KB
testcase_58 AC 1,255 ms
129,968 KB
testcase_59 AC 1,496 ms
136,248 KB
testcase_60 AC 972 ms
114,260 KB
testcase_61 AC 1,272 ms
131,508 KB
testcase_62 AC 1,249 ms
130,980 KB
testcase_63 AC 690 ms
105,344 KB
testcase_64 AC 992 ms
115,124 KB
testcase_65 AC 933 ms
113,332 KB
testcase_66 AC 914 ms
112,428 KB
testcase_67 AC 1,231 ms
122,412 KB
testcase_68 AC 982 ms
114,616 KB
testcase_69 AC 898 ms
108,168 KB
testcase_70 AC 860 ms
107,904 KB
testcase_71 AC 850 ms
107,828 KB
testcase_72 AC 1,051 ms
118,068 KB
testcase_73 AC 1,413 ms
134,968 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())

    segy = LazySegTree([INF]*n, INF, None, segfunc)
    segk = LazySegTree([INF]*n, INF, None, segfunc)
    segc = 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':
            segy.update(l, r+1, i)
        if t == 'K':
            segk.update(l, r+1, i)
        if t == 'C':
            segc.update(l, r+1, i)

    y = 0
    k = 0
    c = 0
    for i in range(n):
        yi = segy.query(i, i+1)
        ki = segk.query(i, i+1)
        ci = segc.query(i, i+1)
        if yi < ki and yi < ci:
            y += 1
        if ki < yi and ki < ci:
            k += 1
        if ci < yi and ci < ki:
            c += 1
    print(y, k, c)

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