結果
問題 | No.1725 [Cherry 3rd Tune D] 無言の言葉 |
ユーザー | mkawa2 |
提出日時 | 2021-10-30 13:45:45 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,884 bytes |
コンパイル時間 | 488 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 621,128 KB |
最終ジャッジ日時 | 2024-04-16 16:20:07 |
合計ジャッジ時間 | 54,068 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
11,136 KB |
testcase_01 | AC | 31 ms
10,752 KB |
testcase_02 | AC | 47 ms
12,716 KB |
testcase_03 | AC | 86 ms
18,524 KB |
testcase_04 | AC | 41 ms
12,160 KB |
testcase_05 | AC | 47 ms
13,176 KB |
testcase_06 | AC | 266 ms
40,136 KB |
testcase_07 | AC | 105 ms
20,208 KB |
testcase_08 | AC | 192 ms
29,176 KB |
testcase_09 | AC | 38 ms
11,776 KB |
testcase_10 | AC | 100 ms
19,676 KB |
testcase_11 | AC | 37 ms
11,520 KB |
testcase_12 | AC | 294 ms
52,668 KB |
testcase_13 | AC | 315 ms
54,436 KB |
testcase_14 | AC | 1,762 ms
201,472 KB |
testcase_15 | AC | 366 ms
61,784 KB |
testcase_16 | AC | 473 ms
78,272 KB |
testcase_17 | AC | 733 ms
112,288 KB |
testcase_18 | AC | 2,143 ms
280,924 KB |
testcase_19 | AC | 604 ms
90,528 KB |
testcase_20 | AC | 248 ms
39,476 KB |
testcase_21 | AC | 2,087 ms
273,776 KB |
testcase_22 | AC | 2,386 ms
314,992 KB |
testcase_23 | AC | 2,468 ms
314,088 KB |
testcase_24 | AC | 1,652 ms
243,448 KB |
testcase_25 | AC | 3,074 ms
424,656 KB |
testcase_26 | AC | 2,388 ms
338,656 KB |
testcase_27 | AC | 2,715 ms
422,312 KB |
testcase_28 | AC | 3,371 ms
459,464 KB |
testcase_29 | AC | 3,266 ms
442,752 KB |
testcase_30 | AC | 3,258 ms
468,680 KB |
testcase_31 | AC | 2,063 ms
284,064 KB |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | MLE | - |
testcase_35 | MLE | - |
testcase_36 | MLE | - |
testcase_37 | AC | 3,451 ms
284,036 KB |
testcase_38 | AC | 3,410 ms
284,052 KB |
testcase_39 | AC | 3,425 ms
284,084 KB |
testcase_40 | AC | 3,423 ms
284,148 KB |
testcase_41 | AC | 3,415 ms
283,912 KB |
testcase_42 | AC | 31 ms
11,136 KB |
testcase_43 | AC | 1,268 ms
121,216 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 from functools import lru_cache 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) @lru_cache(None) def solve(lv, s, c, rev=False): if s == ww[lv]: return sc[-1][c]*aa[lv]+tc[-1][c]*bb[lv] if lv == 0: if rev: return isc[s][c] return sc[s][c] lw = ww[lv-1] if s <= lw: return solve(lv-1, s, c, False) left = sc[-1][c]*aa[lv-1]+tc[-1][c]*bb[lv-1] if s <= lw+y: if rev: return left+itc[s-lw][c] return left+tc[s-lw][c] if rev: left+itc[-1][c]+solve(lv-1, s-lw-y, c, True) return left+tc[-1][c]+solve(lv-1, s-lw-y, c, True) 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(len(ww)-1, r, c)-solve(len(ww)-1, l, c) print(ans)