結果

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

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
52,352 KB
testcase_01 AC 40 ms
52,352 KB
testcase_02 AC 69 ms
70,272 KB
testcase_03 AC 101 ms
76,356 KB
testcase_04 AC 64 ms
66,944 KB
testcase_05 AC 87 ms
76,416 KB
testcase_06 AC 100 ms
76,032 KB
testcase_07 AC 97 ms
76,124 KB
testcase_08 AC 64 ms
68,352 KB
testcase_09 AC 78 ms
73,996 KB
testcase_10 AC 99 ms
76,660 KB
testcase_11 AC 84 ms
75,536 KB
testcase_12 AC 94 ms
75,972 KB
testcase_13 AC 102 ms
76,492 KB
testcase_14 AC 101 ms
75,924 KB
testcase_15 AC 57 ms
65,664 KB
testcase_16 AC 73 ms
72,448 KB
testcase_17 AC 88 ms
76,160 KB
testcase_18 AC 107 ms
76,516 KB
testcase_19 AC 75 ms
76,160 KB
testcase_20 AC 65 ms
68,864 KB
testcase_21 AC 67 ms
68,864 KB
testcase_22 AC 110 ms
76,368 KB
testcase_23 AC 113 ms
76,156 KB
testcase_24 AC 104 ms
76,160 KB
testcase_25 AC 103 ms
76,672 KB
testcase_26 AC 107 ms
76,672 KB
testcase_27 AC 74 ms
76,288 KB
testcase_28 AC 76 ms
75,652 KB
testcase_29 AC 39 ms
52,736 KB
testcase_30 AC 40 ms
52,224 KB
testcase_31 AC 355 ms
87,256 KB
testcase_32 AC 586 ms
91,604 KB
testcase_33 AC 911 ms
110,196 KB
testcase_34 AC 1,031 ms
111,840 KB
testcase_35 AC 1,683 ms
136,548 KB
testcase_36 AC 820 ms
111,296 KB
testcase_37 AC 786 ms
110,492 KB
testcase_38 AC 867 ms
108,484 KB
testcase_39 AC 643 ms
95,332 KB
testcase_40 AC 840 ms
107,348 KB
testcase_41 AC 516 ms
92,028 KB
testcase_42 AC 1,257 ms
121,908 KB
testcase_43 AC 674 ms
107,672 KB
testcase_44 AC 1,390 ms
127,392 KB
testcase_45 AC 1,247 ms
127,700 KB
testcase_46 AC 395 ms
90,964 KB
testcase_47 AC 1,093 ms
111,600 KB
testcase_48 AC 369 ms
85,172 KB
testcase_49 AC 716 ms
99,296 KB
testcase_50 AC 1,387 ms
129,744 KB
testcase_51 AC 1,957 ms
143,880 KB
testcase_52 AC 1,946 ms
143,628 KB
testcase_53 AC 1,902 ms
143,628 KB
testcase_54 AC 1,940 ms
143,892 KB
testcase_55 AC 1,939 ms
143,620 KB
testcase_56 AC 637 ms
104,620 KB
testcase_57 AC 603 ms
104,704 KB
testcase_58 AC 1,326 ms
129,800 KB
testcase_59 AC 1,426 ms
134,712 KB
testcase_60 AC 954 ms
115,084 KB
testcase_61 AC 1,250 ms
131,788 KB
testcase_62 AC 1,343 ms
130,480 KB
testcase_63 AC 683 ms
105,360 KB
testcase_64 AC 963 ms
116,612 KB
testcase_65 AC 1,021 ms
112,472 KB
testcase_66 AC 1,015 ms
112,328 KB
testcase_67 AC 1,102 ms
123,348 KB
testcase_68 AC 974 ms
115,020 KB
testcase_69 AC 792 ms
107,724 KB
testcase_70 AC 820 ms
108,164 KB
testcase_71 AC 821 ms
108,224 KB
testcase_72 AC 1,010 ms
117,836 KB
testcase_73 AC 1,321 ms
133,632 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)

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

INF = 10**18

n, m = map(int, input().split())

segy = LazySegTree([INF]*n, INF, None, min)
segk = LazySegTree([INF]*n, INF, None, min)
segc = LazySegTree([INF]*n, INF, None, min)

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)
0