結果
問題 | No.1725 [Cherry 3rd Tune D] 無言の言葉 |
ユーザー | mkawa2 |
提出日時 | 2021-10-30 13:56:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 966 ms / 4,000 ms |
コード長 | 2,270 bytes |
コンパイル時間 | 621 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 321,536 KB |
最終ジャッジ日時 | 2024-04-16 16:20:27 |
合計ジャッジ時間 | 18,056 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
54,144 KB |
testcase_01 | AC | 47 ms
54,400 KB |
testcase_02 | AC | 71 ms
70,400 KB |
testcase_03 | AC | 118 ms
77,532 KB |
testcase_04 | AC | 64 ms
66,560 KB |
testcase_05 | AC | 67 ms
69,376 KB |
testcase_06 | AC | 135 ms
77,936 KB |
testcase_07 | AC | 113 ms
77,012 KB |
testcase_08 | AC | 121 ms
77,568 KB |
testcase_09 | AC | 56 ms
63,872 KB |
testcase_10 | AC | 115 ms
76,908 KB |
testcase_11 | AC | 58 ms
64,768 KB |
testcase_12 | AC | 178 ms
92,660 KB |
testcase_13 | AC | 178 ms
92,800 KB |
testcase_14 | AC | 307 ms
92,544 KB |
testcase_15 | AC | 183 ms
95,460 KB |
testcase_16 | AC | 202 ms
98,848 KB |
testcase_17 | AC | 227 ms
100,480 KB |
testcase_18 | AC | 329 ms
90,880 KB |
testcase_19 | AC | 209 ms
88,320 KB |
testcase_20 | AC | 149 ms
83,172 KB |
testcase_21 | AC | 312 ms
85,888 KB |
testcase_22 | AC | 487 ms
166,084 KB |
testcase_23 | AC | 483 ms
155,904 KB |
testcase_24 | AC | 389 ms
133,040 KB |
testcase_25 | AC | 623 ms
215,168 KB |
testcase_26 | AC | 511 ms
184,680 KB |
testcase_27 | AC | 575 ms
234,368 KB |
testcase_28 | AC | 659 ms
225,792 KB |
testcase_29 | AC | 636 ms
217,324 KB |
testcase_30 | AC | 658 ms
249,216 KB |
testcase_31 | AC | 424 ms
156,280 KB |
testcase_32 | AC | 930 ms
315,404 KB |
testcase_33 | AC | 966 ms
321,536 KB |
testcase_34 | AC | 924 ms
303,860 KB |
testcase_35 | AC | 847 ms
276,156 KB |
testcase_36 | AC | 923 ms
300,644 KB |
testcase_37 | AC | 382 ms
80,768 KB |
testcase_38 | AC | 364 ms
81,072 KB |
testcase_39 | AC | 359 ms
80,512 KB |
testcase_40 | AC | 351 ms
80,920 KB |
testcase_41 | AC | 352 ms
80,256 KB |
testcase_42 | AC | 43 ms
54,272 KB |
testcase_43 | AC | 351 ms
208,128 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # 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 = 18446744073709551615 # inf = 4294967295 md = 10**9+7 # md = 998244353 from collections import Counter def cntc(s): res = [] cnt = Counter() res.append(cnt.copy()) for c in s: c = ord(c)-97 cnt[c] += 1 res.append(cnt.copy()) return res s = SI() t = SI() x = len(s) y = len(t) sc = cntc(s) tc = cntc(t) isc = cntc(s[::-1]) itc = cntc(t[::-1]) ww = [x] aa = [1] bb = [0] while ww[-1] < 10**9+5: ww.append(ww[-1]*2+y) aa.append(aa[-1]*2) bb.append(bb[-1]*2+1) # print(ww) # print(aa) # print(bb) def solve(s, c): res = 0 stack = [(len(ww)-1, s, c, False)] while stack: lv, s, c, rev = stack.pop() if s == ww[lv]: res += sc[-1][c]*aa[lv]+tc[-1][c]*bb[lv] elif lv == 0: if rev: res += isc[s][c] else: res += sc[s][c] else: lw = ww[lv-1] if s <= lw: stack.append((lv-1, s, c, False)) else: res += sc[-1][c]*aa[lv-1]+tc[-1][c]*bb[lv-1] if s <= lw+y: if rev: res += itc[s-lw][c] else: res += tc[s-lw][c] else: if rev: res += itc[-1][c] stack.append((lv-1, s-lw-y, c, True)) else: res += tc[-1][c] stack.append((lv-1, s-lw-y, c, True)) return res for _ in range(II()): l, r, c = SI().split() l = int(l)-1 r = int(r) c = ord(c)-97 # print(solve(r, c),solve(l, c)) ans = solve(r, c)-solve(l, c) print(ans)