結果
問題 | No.945 YKC饅頭 |
ユーザー | mkawa2 |
提出日時 | 2021-03-18 16:27:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 357 ms / 2,000 ms |
コード長 | 1,408 bytes |
コンパイル時間 | 439 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 92,092 KB |
最終ジャッジ日時 | 2024-04-28 06:30:56 |
合計ジャッジ時間 | 13,184 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
52,480 KB |
testcase_01 | AC | 41 ms
52,096 KB |
testcase_02 | AC | 51 ms
59,776 KB |
testcase_03 | AC | 71 ms
68,096 KB |
testcase_04 | AC | 49 ms
59,392 KB |
testcase_05 | AC | 54 ms
61,440 KB |
testcase_06 | AC | 72 ms
67,328 KB |
testcase_07 | AC | 69 ms
66,560 KB |
testcase_08 | AC | 49 ms
58,880 KB |
testcase_09 | AC | 63 ms
64,896 KB |
testcase_10 | AC | 73 ms
67,840 KB |
testcase_11 | AC | 64 ms
64,128 KB |
testcase_12 | AC | 65 ms
65,024 KB |
testcase_13 | AC | 75 ms
67,840 KB |
testcase_14 | AC | 76 ms
68,992 KB |
testcase_15 | AC | 45 ms
53,376 KB |
testcase_16 | AC | 55 ms
61,056 KB |
testcase_17 | AC | 62 ms
64,256 KB |
testcase_18 | AC | 70 ms
66,816 KB |
testcase_19 | AC | 47 ms
58,496 KB |
testcase_20 | AC | 52 ms
59,392 KB |
testcase_21 | AC | 51 ms
59,392 KB |
testcase_22 | AC | 72 ms
67,712 KB |
testcase_23 | AC | 75 ms
68,736 KB |
testcase_24 | AC | 76 ms
68,480 KB |
testcase_25 | AC | 72 ms
68,096 KB |
testcase_26 | AC | 76 ms
68,864 KB |
testcase_27 | AC | 49 ms
59,008 KB |
testcase_28 | AC | 49 ms
59,392 KB |
testcase_29 | AC | 42 ms
51,968 KB |
testcase_30 | AC | 42 ms
52,096 KB |
testcase_31 | AC | 88 ms
77,568 KB |
testcase_32 | AC | 83 ms
73,728 KB |
testcase_33 | AC | 115 ms
82,048 KB |
testcase_34 | AC | 141 ms
83,584 KB |
testcase_35 | AC | 181 ms
89,672 KB |
testcase_36 | AC | 159 ms
84,992 KB |
testcase_37 | AC | 149 ms
82,688 KB |
testcase_38 | AC | 144 ms
82,432 KB |
testcase_39 | AC | 102 ms
79,360 KB |
testcase_40 | AC | 98 ms
82,048 KB |
testcase_41 | AC | 92 ms
78,976 KB |
testcase_42 | AC | 172 ms
87,040 KB |
testcase_43 | AC | 152 ms
83,072 KB |
testcase_44 | AC | 158 ms
85,828 KB |
testcase_45 | AC | 180 ms
90,752 KB |
testcase_46 | AC | 77 ms
71,552 KB |
testcase_47 | AC | 142 ms
83,968 KB |
testcase_48 | AC | 99 ms
77,184 KB |
testcase_49 | AC | 109 ms
79,744 KB |
testcase_50 | AC | 192 ms
90,752 KB |
testcase_51 | AC | 182 ms
91,344 KB |
testcase_52 | AC | 198 ms
91,972 KB |
testcase_53 | AC | 183 ms
91,076 KB |
testcase_54 | AC | 203 ms
91,980 KB |
testcase_55 | AC | 192 ms
92,092 KB |
testcase_56 | AC | 62 ms
66,816 KB |
testcase_57 | AC | 60 ms
66,304 KB |
testcase_58 | AC | 310 ms
89,268 KB |
testcase_59 | AC | 357 ms
90,876 KB |
testcase_60 | AC | 189 ms
83,072 KB |
testcase_61 | AC | 334 ms
89,332 KB |
testcase_62 | AC | 326 ms
89,348 KB |
testcase_63 | AC | 95 ms
81,920 KB |
testcase_64 | AC | 209 ms
83,836 KB |
testcase_65 | AC | 180 ms
82,672 KB |
testcase_66 | AC | 172 ms
82,548 KB |
testcase_67 | AC | 270 ms
86,412 KB |
testcase_68 | AC | 193 ms
83,584 KB |
testcase_69 | AC | 121 ms
81,664 KB |
testcase_70 | AC | 133 ms
81,792 KB |
testcase_71 | AC | 133 ms
82,048 KB |
testcase_72 | AC | 223 ms
85,096 KB |
testcase_73 | AC | 341 ms
90,492 KB |
ソースコード
import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 md = 998244353 # md = 10**9+7 n, m = LI() w = 1 << (n-1).bit_length() tree = [inf]*w*2 tt = [] for i in range(m): l, r, t = SI().split() l, r = int(l)-1, int(r) t = "YKC".index(t) tt.append(t) stack = [(1, 0, w)] while stack: u, ul, ur = stack.pop() if ur <= l or r <= ul: continue if tree[u] != inf: continue if l <= ul and ur <= r: tree[u] = i else: um = (ul+ur)//2 stack.append((u*2, ul, um)) stack.append((u*2+1, um, ur)) # print(i,l,r,stack,tree) for u in range(2, w+n): tree[u] = min(tree[u], tree[u//2]) cnt = [0]*3 for k in range(n): i = tree[k+w] if i != inf: cnt[tt[i]] += 1 print(*cnt)