結果
問題 | No.346 チワワ数え上げ問題 |
ユーザー | McGregorsh |
提出日時 | 2022-06-21 14:25:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 165 ms / 2,000 ms |
コード長 | 1,554 bytes |
コンパイル時間 | 240 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 99,584 KB |
最終ジャッジ日時 | 2024-04-22 08:30:30 |
合計ジャッジ時間 | 4,983 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 136 ms
89,700 KB |
testcase_01 | AC | 143 ms
89,088 KB |
testcase_02 | AC | 120 ms
83,344 KB |
testcase_03 | AC | 128 ms
83,200 KB |
testcase_04 | AC | 136 ms
89,372 KB |
testcase_05 | AC | 123 ms
83,328 KB |
testcase_06 | AC | 129 ms
89,408 KB |
testcase_07 | AC | 129 ms
89,088 KB |
testcase_08 | AC | 142 ms
89,600 KB |
testcase_09 | AC | 133 ms
89,344 KB |
testcase_10 | AC | 165 ms
99,584 KB |
testcase_11 | AC | 138 ms
90,460 KB |
testcase_12 | AC | 160 ms
96,896 KB |
testcase_13 | AC | 137 ms
90,248 KB |
testcase_14 | AC | 146 ms
89,856 KB |
testcase_15 | AC | 140 ms
90,240 KB |
testcase_16 | AC | 163 ms
97,408 KB |
testcase_17 | AC | 160 ms
99,328 KB |
testcase_18 | AC | 157 ms
99,540 KB |
testcase_19 | AC | 156 ms
97,536 KB |
testcase_20 | AC | 159 ms
99,572 KB |
testcase_21 | AC | 157 ms
99,328 KB |
testcase_22 | AC | 158 ms
99,456 KB |
testcase_23 | AC | 118 ms
83,456 KB |
testcase_24 | AC | 126 ms
83,072 KB |
testcase_25 | AC | 115 ms
83,452 KB |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): s = input() cww = 'cww' dp = [[0] * 4 for i in range(len(s)+1)] for i in range(len(s)+1): dp[i][0] = 1 for i in range(len(s)): for j in range(1, 4): if s[i] != cww[j-1]: dp[i][j] += dp[i-1][j] else: dp[i][j] += dp[i-1][j-1] + dp[i-1][j] #print(dp) print(dp[len(s)-1][3]) if __name__ == '__main__': main()