結果
問題 | No.1725 [Cherry 3rd Tune D] 無言の言葉 |
ユーザー | horitaka1999 |
提出日時 | 2021-10-30 01:32:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,186 ms / 4,000 ms |
コード長 | 2,557 bytes |
コンパイル時間 | 161 ms |
コンパイル使用メモリ | 82,480 KB |
実行使用メモリ | 196,356 KB |
最終ジャッジ日時 | 2024-04-16 16:06:42 |
合計ジャッジ時間 | 32,740 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
52,864 KB |
testcase_01 | AC | 45 ms
53,248 KB |
testcase_02 | AC | 78 ms
76,032 KB |
testcase_03 | AC | 128 ms
77,184 KB |
testcase_04 | AC | 65 ms
69,248 KB |
testcase_05 | AC | 86 ms
76,976 KB |
testcase_06 | AC | 202 ms
77,748 KB |
testcase_07 | AC | 146 ms
77,208 KB |
testcase_08 | AC | 183 ms
78,304 KB |
testcase_09 | AC | 56 ms
65,152 KB |
testcase_10 | AC | 129 ms
77,056 KB |
testcase_11 | AC | 55 ms
65,152 KB |
testcase_12 | AC | 229 ms
84,976 KB |
testcase_13 | AC | 229 ms
85,376 KB |
testcase_14 | AC | 622 ms
91,636 KB |
testcase_15 | AC | 247 ms
87,296 KB |
testcase_16 | AC | 264 ms
87,332 KB |
testcase_17 | AC | 361 ms
90,384 KB |
testcase_18 | AC | 661 ms
90,644 KB |
testcase_19 | AC | 338 ms
84,668 KB |
testcase_20 | AC | 227 ms
81,176 KB |
testcase_21 | AC | 564 ms
86,608 KB |
testcase_22 | AC | 846 ms
121,916 KB |
testcase_23 | AC | 987 ms
119,128 KB |
testcase_24 | AC | 746 ms
105,600 KB |
testcase_25 | AC | 967 ms
143,940 KB |
testcase_26 | AC | 778 ms
129,196 KB |
testcase_27 | AC | 824 ms
150,168 KB |
testcase_28 | AC | 1,207 ms
151,608 KB |
testcase_29 | AC | 1,140 ms
147,824 KB |
testcase_30 | AC | 1,083 ms
160,076 KB |
testcase_31 | AC | 746 ms
116,144 KB |
testcase_32 | AC | 1,300 ms
190,348 KB |
testcase_33 | AC | 1,277 ms
192,780 KB |
testcase_34 | AC | 1,293 ms
185,608 KB |
testcase_35 | AC | 1,233 ms
172,420 KB |
testcase_36 | AC | 1,285 ms
182,832 KB |
testcase_37 | AC | 1,910 ms
86,560 KB |
testcase_38 | AC | 1,856 ms
86,500 KB |
testcase_39 | AC | 1,857 ms
86,360 KB |
testcase_40 | AC | 2,186 ms
88,760 KB |
testcase_41 | AC | 1,837 ms
86,940 KB |
testcase_42 | AC | 44 ms
59,264 KB |
testcase_43 | AC | 409 ms
196,356 KB |
ソースコード
def y_plus(m): if m == 0 or m == 1: return 1 binM = list(map(int,list(bin(m)[2:]))) if pow(2,len(binM)) -m == pow(2,len(binM) -1): return 1 return -1 * y_plus(pow(2,len(binM)) - m) def change(S): return ord(S) - ord('a') X = list(input()) Y = list(input()) xacum = [[0] * 26 for _ in range(len(X)+1)] rev_xacum = [[0] * 26 for _ in range(len(X)+1)] yacum = [[0] * 26 for _ in range(len(Y)+1)] rev_yacum = [[0] * 26 for _ in range(len(Y)+1)] for i in range(len(X)): xacum[i+1][change(X[i])] += 1 for i in range(len(Y)): yacum[i+1][change(Y[i])] += 1 for i in range(1,len(X)+1): for k in range(26): xacum[i][k] += xacum[i-1][k] X.reverse() for i in range(len(X)): rev_xacum[i+1][change(X[i])] += 1 for i in range(1,len(X)+1): for k in range(26): rev_xacum[i][k] += rev_xacum[i-1][k] for i in range(1,len(Y)+1): for k in range(26): yacum[i][k] += yacum[i-1][k] Y.reverse() for i in range(len(Y)): rev_yacum[i+1][change(Y[i])] += 1 for i in range(1,len(Y)+1): for k in range(26): rev_yacum[i][k] += rev_yacum[i-1][k] Z = len(X) + len(Y) Q = int(input()) ANS = [] for _ in range(Q): L,R,C = input().split() L = int(L) R = int(R) l = (L-1) // Z tl = L % Z if tl == 0: tl = Z r = R //Z tr = R % Z ans = (xacum[-1][change(C)] + yacum[-1][change(C)]) * (r-l) if y_plus(l+1) == 1: if (l+1) % 2 == 1:#+X -> +Y ans -= xacum[min(tl-1,len(X))][change(C)] + yacum[max(tl-1-len(X),0)][change(C)] else:#-X -> + Y ans -= rev_xacum[min(tl-1,len(X))][change(C)] + yacum[max(tl-1-len(X),0)][change(C)] else: if (l+1) % 2 == 1:#+X -> -Y ans -= xacum[min(tl-1,len(X))][change(C)] + rev_yacum[max(tl-1-len(X),0)][change(C)] else:#-X -> + Y ans -= rev_xacum[min(tl-1,len(X))][change(C)] + rev_yacum[max(tl-1-len(X),0)][change(C)] if y_plus(r+1) == 1: if (r+1) % 2 == 1:#+X -> +Y ans += xacum[min(tr,len(X))][change(C)] + yacum[max(tr-len(X),0)][change(C)] else:#-X -> + Y ans += rev_xacum[min(tr,len(X))][change(C)] + yacum[max(tr-len(X),0)][change(C)] else: if (r+1) % 2 == 1:#+X -> -Y ans += xacum[min(tr,len(X))][change(C)] + rev_yacum[max(tr-len(X),0)][change(C)] else:#-X -> + Y ans += rev_xacum[min(tr,len(X))][change(C)] + rev_yacum[max(tr-len(X),0)][change(C)] ANS.append(ans) for i in range(Q): print(ANS[i])