結果

問題 No.945 YKC饅頭
ユーザー brthyyjpbrthyyjp
提出日時 2021-06-03 22:48:46
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,315 bytes
コンパイル時間 259 ms
コンパイル使用メモリ 87,136 KB
実行使用メモリ 145,900 KB
最終ジャッジ日時 2023-08-11 00:40:12
合計ジャッジ時間 59,166 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
71,192 KB
testcase_01 AC 69 ms
71,428 KB
testcase_02 AC 101 ms
76,396 KB
testcase_03 AC 129 ms
77,548 KB
testcase_04 AC 92 ms
76,344 KB
testcase_05 AC 115 ms
77,252 KB
testcase_06 AC 128 ms
77,692 KB
testcase_07 AC 121 ms
77,368 KB
testcase_08 AC 95 ms
76,540 KB
testcase_09 AC 109 ms
77,316 KB
testcase_10 AC 125 ms
77,728 KB
testcase_11 AC 111 ms
77,240 KB
testcase_12 AC 122 ms
77,412 KB
testcase_13 AC 131 ms
77,756 KB
testcase_14 AC 131 ms
77,884 KB
testcase_15 AC 88 ms
76,388 KB
testcase_16 AC 104 ms
77,316 KB
testcase_17 AC 119 ms
77,628 KB
testcase_18 AC 136 ms
78,044 KB
testcase_19 AC 103 ms
77,652 KB
testcase_20 AC 95 ms
76,228 KB
testcase_21 AC 97 ms
76,468 KB
testcase_22 AC 132 ms
77,900 KB
testcase_23 AC 141 ms
78,048 KB
testcase_24 AC 133 ms
77,624 KB
testcase_25 AC 131 ms
77,540 KB
testcase_26 AC 134 ms
77,960 KB
testcase_27 AC 101 ms
77,132 KB
testcase_28 AC 101 ms
77,248 KB
testcase_29 AC 72 ms
71,260 KB
testcase_30 AC 70 ms
71,188 KB
testcase_31 AC 385 ms
87,488 KB
testcase_32 AC 630 ms
93,072 KB
testcase_33 AC 982 ms
112,424 KB
testcase_34 AC 1,106 ms
114,268 KB
testcase_35 AC 1,857 ms
138,568 KB
testcase_36 AC 858 ms
112,092 KB
testcase_37 AC 857 ms
111,432 KB
testcase_38 AC 965 ms
112,768 KB
testcase_39 AC 682 ms
96,612 KB
testcase_40 AC 938 ms
109,476 KB
testcase_41 AC 571 ms
93,104 KB
testcase_42 AC 1,402 ms
124,636 KB
testcase_43 AC 715 ms
108,424 KB
testcase_44 AC 1,514 ms
130,160 KB
testcase_45 AC 1,382 ms
130,928 KB
testcase_46 AC 422 ms
92,204 KB
testcase_47 AC 1,169 ms
114,292 KB
testcase_48 AC 394 ms
86,516 KB
testcase_49 AC 783 ms
100,892 KB
testcase_50 AC 1,519 ms
131,200 KB
testcase_51 TLE -
testcase_52 TLE -
testcase_53 TLE -
testcase_54 TLE -
testcase_55 TLE -
testcase_56 AC 686 ms
106,140 KB
testcase_57 AC 662 ms
106,096 KB
testcase_58 AC 1,404 ms
131,392 KB
testcase_59 AC 1,561 ms
137,000 KB
testcase_60 AC 1,043 ms
115,836 KB
testcase_61 AC 1,363 ms
133,972 KB
testcase_62 AC 1,508 ms
132,240 KB
testcase_63 AC 722 ms
106,932 KB
testcase_64 AC 1,067 ms
118,092 KB
testcase_65 AC 1,117 ms
113,612 KB
testcase_66 AC 1,076 ms
113,608 KB
testcase_67 AC 1,232 ms
124,440 KB
testcase_68 AC 1,058 ms
116,888 KB
testcase_69 AC 887 ms
109,048 KB
testcase_70 AC 897 ms
109,476 KB
testcase_71 AC 903 ms
109,308 KB
testcase_72 AC 1,084 ms
121,204 KB
testcase_73 AC 1,431 ms
135,576 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