結果

問題 No.945 YKC饅頭
ユーザー brthyyjpbrthyyjp
提出日時 2021-06-03 22:52:08
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,585 bytes
コンパイル時間 507 ms
コンパイル使用メモリ 87,084 KB
実行使用メモリ 145,760 KB
最終ジャッジ日時 2023-08-11 00:46:37
合計ジャッジ時間 56,330 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
71,304 KB
testcase_01 AC 68 ms
71,412 KB
testcase_02 AC 97 ms
77,240 KB
testcase_03 AC 127 ms
78,104 KB
testcase_04 AC 87 ms
76,648 KB
testcase_05 AC 111 ms
77,536 KB
testcase_06 AC 127 ms
77,752 KB
testcase_07 AC 120 ms
77,684 KB
testcase_08 AC 95 ms
76,548 KB
testcase_09 AC 105 ms
77,364 KB
testcase_10 AC 124 ms
77,852 KB
testcase_11 AC 110 ms
77,576 KB
testcase_12 AC 120 ms
77,580 KB
testcase_13 AC 130 ms
77,740 KB
testcase_14 AC 125 ms
77,848 KB
testcase_15 AC 87 ms
76,416 KB
testcase_16 AC 100 ms
77,296 KB
testcase_17 AC 113 ms
77,400 KB
testcase_18 AC 124 ms
77,564 KB
testcase_19 AC 101 ms
77,612 KB
testcase_20 AC 94 ms
76,348 KB
testcase_21 AC 95 ms
76,356 KB
testcase_22 AC 131 ms
78,020 KB
testcase_23 AC 133 ms
78,116 KB
testcase_24 AC 130 ms
78,104 KB
testcase_25 AC 129 ms
77,784 KB
testcase_26 AC 131 ms
77,912 KB
testcase_27 AC 99 ms
77,676 KB
testcase_28 AC 102 ms
77,544 KB
testcase_29 AC 68 ms
71,448 KB
testcase_30 AC 69 ms
71,276 KB
testcase_31 AC 377 ms
87,588 KB
testcase_32 AC 602 ms
93,144 KB
testcase_33 AC 931 ms
111,640 KB
testcase_34 AC 1,092 ms
113,088 KB
testcase_35 AC 1,856 ms
138,700 KB
testcase_36 AC 847 ms
112,584 KB
testcase_37 AC 848 ms
110,380 KB
testcase_38 AC 897 ms
110,676 KB
testcase_39 AC 663 ms
96,952 KB
testcase_40 AC 873 ms
108,672 KB
testcase_41 AC 590 ms
93,448 KB
testcase_42 AC 1,386 ms
125,344 KB
testcase_43 AC 716 ms
110,300 KB
testcase_44 AC 1,465 ms
128,736 KB
testcase_45 AC 1,363 ms
130,472 KB
testcase_46 AC 414 ms
91,796 KB
testcase_47 AC 1,164 ms
112,344 KB
testcase_48 AC 365 ms
86,376 KB
testcase_49 AC 815 ms
100,444 KB
testcase_50 AC 1,498 ms
131,120 KB
testcase_51 TLE -
testcase_52 TLE -
testcase_53 TLE -
testcase_54 TLE -
testcase_55 TLE -
testcase_56 AC 647 ms
106,412 KB
testcase_57 AC 637 ms
106,368 KB
testcase_58 AC 1,381 ms
132,220 KB
testcase_59 AC 1,601 ms
137,608 KB
testcase_60 AC 1,066 ms
116,756 KB
testcase_61 AC 1,409 ms
134,396 KB
testcase_62 AC 1,388 ms
133,144 KB
testcase_63 AC 741 ms
107,024 KB
testcase_64 AC 1,096 ms
118,844 KB
testcase_65 AC 1,019 ms
114,924 KB
testcase_66 AC 1,001 ms
115,292 KB
testcase_67 AC 1,339 ms
124,136 KB
testcase_68 AC 1,077 ms
117,728 KB
testcase_69 AC 976 ms
108,564 KB
testcase_70 AC 923 ms
109,532 KB
testcase_71 AC 938 ms
110,616 KB
testcase_72 AC 1,152 ms
119,784 KB
testcase_73 AC 1,543 ms
135,892 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