結果

問題 No.1725 [Cherry 3rd Tune D] 無言の言葉
コンテスト
ユーザー LyricalMaestro
提出日時 2025-05-10 16:29:03
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 792 ms / 4,000 ms
コード長 2,511 bytes
コンパイル時間 381 ms
コンパイル使用メモリ 83,036 KB
実行使用メモリ 141,664 KB
最終ジャッジ日時 2025-05-10 16:29:24
合計ジャッジ時間 20,273 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff # 

## https://yukicoder.me/problems/no/1725


def solve0(l, solve_x, is_reverse, c):
    if is_reverse == 0:
        return solve_x[l][c]
    else:
        if l == len(solve_x) - 1:
            return solve_x[len(solve_x) - 1][c]
        else:
            return solve_x[len(solve_x) - 1][c] - solve_x[len(solve_x) - 1 - l - 1][c]


class Solver:

    def __init__(self, len_x, len_y, solve_x, solve_y, solve_full_map):
        self.len_x = len_x
        self.len_y = len_y
        self.solve_x = solve_x
        self.solve_y = solve_y
        self.solve_full_map = solve_full_map

    def solve(self, l, c):
        def f(n):
            return (self.len_x + self.len_y) * (2 ** n) - self.len_y

        def solve2(l, n, is_reverse, c):
            if n == 0:
                return solve0(l, self.solve_x, is_reverse, c)
            
            if l < f(n - 1):
                return solve2(l, n - 1, 0, c)
            elif l < f(n - 1) + self.len_y:
                return self.solve_full_map[n - 1][c] + solve0(l - f(n - 1), self.solve_y, is_reverse, c)
            else:
                return self.solve_full_map[n - 1][c] + self.solve_y[-1][c] + solve2(l - self.len_y - f(n - 1), n - 1, 1, c)

        new_c = ord(c) - ord("a")
        return solve2(l, 40, 0, new_c)


def main():
    X = input()
    Y = input()

    Q = int(input())
    queries = []
    for _ in range(Q):
        l, r, c = input().split()
        queries.append((int(l) - 1, int(r) - 1, c))
    
    # 事前準備
    len_x = len(X)
    len_y = len(Y)

    solve_x = [[0] * 26 for _ in range(len_x)]
    cum_c = [0] * 26
    for i in range(len_x):
        c = ord(X[i]) - ord("a")
        cum_c[c] += 1
        for j in range(26):
            solve_x[i][j] += cum_c[j]

    solve_y = [[0] * 26 for _ in range(len_y)]
    cum_c = [0] * 26
    for i in range(len_y):
        c = ord(Y[i]) - ord("a")
        cum_c[c] += 1
        for j in range(26):
            solve_y[i][j] += cum_c[j]

    solve_full_map = [[0] * 26 for _ in range(40)]
    for i in range(26):
        solve_full_map[0][i] = solve_x[-1][i]

    for n in range(1, 40):
        for c in range(26):
            solve_full_map[n][c] = 2 * solve_full_map[n - 1][c] + solve_y[-1][c]

    solver = Solver(len_x, len_y, solve_x, solve_y, solve_full_map)
    for l, r, c in queries:
        ans_l = 0
        if l > 0:
            ans_l = solver.solve(l - 1, c) 
        ans_r = solver.solve(r, c)

        print(ans_r - ans_l)










if __name__ == '__main__':
    main()
0