結果
問題 | No.945 YKC饅頭 |
ユーザー | brthyyjp |
提出日時 | 2021-06-03 22:50:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,977 ms / 2,000 ms |
コード長 | 3,494 bytes |
コンパイル時間 | 166 ms |
コンパイル使用メモリ | 82,248 KB |
実行使用メモリ | 144,296 KB |
最終ジャッジ日時 | 2024-04-28 17:52:09 |
合計ジャッジ時間 | 50,708 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
53,164 KB |
testcase_01 | AC | 39 ms
53,040 KB |
testcase_02 | AC | 68 ms
71,164 KB |
testcase_03 | AC | 99 ms
76,236 KB |
testcase_04 | AC | 61 ms
66,776 KB |
testcase_05 | AC | 86 ms
75,496 KB |
testcase_06 | AC | 97 ms
75,904 KB |
testcase_07 | AC | 96 ms
76,072 KB |
testcase_08 | AC | 63 ms
69,696 KB |
testcase_09 | AC | 77 ms
73,960 KB |
testcase_10 | AC | 96 ms
75,876 KB |
testcase_11 | AC | 83 ms
75,280 KB |
testcase_12 | AC | 94 ms
76,196 KB |
testcase_13 | AC | 102 ms
76,232 KB |
testcase_14 | AC | 100 ms
76,636 KB |
testcase_15 | AC | 58 ms
66,380 KB |
testcase_16 | AC | 72 ms
72,912 KB |
testcase_17 | AC | 88 ms
76,312 KB |
testcase_18 | AC | 104 ms
76,476 KB |
testcase_19 | AC | 74 ms
75,704 KB |
testcase_20 | AC | 65 ms
69,680 KB |
testcase_21 | AC | 66 ms
68,680 KB |
testcase_22 | AC | 102 ms
75,760 KB |
testcase_23 | AC | 109 ms
76,152 KB |
testcase_24 | AC | 100 ms
76,036 KB |
testcase_25 | AC | 101 ms
76,664 KB |
testcase_26 | AC | 104 ms
76,428 KB |
testcase_27 | AC | 75 ms
76,112 KB |
testcase_28 | AC | 74 ms
75,760 KB |
testcase_29 | AC | 39 ms
53,104 KB |
testcase_30 | AC | 38 ms
52,940 KB |
testcase_31 | AC | 336 ms
86,092 KB |
testcase_32 | AC | 563 ms
91,656 KB |
testcase_33 | AC | 902 ms
110,240 KB |
testcase_34 | AC | 1,030 ms
112,424 KB |
testcase_35 | AC | 1,680 ms
136,636 KB |
testcase_36 | AC | 801 ms
111,744 KB |
testcase_37 | AC | 798 ms
108,204 KB |
testcase_38 | AC | 849 ms
109,092 KB |
testcase_39 | AC | 609 ms
96,060 KB |
testcase_40 | AC | 838 ms
106,296 KB |
testcase_41 | AC | 509 ms
91,992 KB |
testcase_42 | AC | 1,261 ms
122,532 KB |
testcase_43 | AC | 667 ms
107,928 KB |
testcase_44 | AC | 1,409 ms
128,836 KB |
testcase_45 | AC | 1,260 ms
128,464 KB |
testcase_46 | AC | 372 ms
90,632 KB |
testcase_47 | AC | 1,044 ms
111,176 KB |
testcase_48 | AC | 327 ms
84,828 KB |
testcase_49 | AC | 712 ms
98,600 KB |
testcase_50 | AC | 1,397 ms
130,116 KB |
testcase_51 | AC | 1,958 ms
143,656 KB |
testcase_52 | AC | 1,964 ms
143,892 KB |
testcase_53 | AC | 1,934 ms
143,776 KB |
testcase_54 | AC | 1,977 ms
144,296 KB |
testcase_55 | AC | 1,956 ms
143,460 KB |
testcase_56 | AC | 625 ms
104,792 KB |
testcase_57 | AC | 577 ms
104,628 KB |
testcase_58 | AC | 1,388 ms
130,340 KB |
testcase_59 | AC | 1,443 ms
136,748 KB |
testcase_60 | AC | 1,003 ms
114,604 KB |
testcase_61 | AC | 1,285 ms
131,384 KB |
testcase_62 | AC | 1,340 ms
130,088 KB |
testcase_63 | AC | 668 ms
105,408 KB |
testcase_64 | AC | 989 ms
114,976 KB |
testcase_65 | AC | 1,007 ms
112,292 KB |
testcase_66 | AC | 996 ms
113,056 KB |
testcase_67 | AC | 1,123 ms
121,644 KB |
testcase_68 | AC | 978 ms
115,780 KB |
testcase_69 | AC | 844 ms
108,100 KB |
testcase_70 | AC | 880 ms
108,184 KB |
testcase_71 | AC | 889 ms
107,968 KB |
testcase_72 | AC | 1,075 ms
118,064 KB |
testcase_73 | AC | 1,385 ms
135,188 KB |
ソースコード
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 def main(): 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) if __name__ == '__main__': main()