結果
問題 | No.1481 Rotation ABC |
ユーザー | tamato |
提出日時 | 2021-04-16 22:05:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,542 bytes |
コンパイル時間 | 291 ms |
コンパイル使用メモリ | 86,888 KB |
実行使用メモリ | 79,248 KB |
最終ジャッジ日時 | 2023-09-16 00:45:50 |
合計ジャッジ時間 | 5,121 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
78,544 KB |
testcase_01 | AC | 77 ms
78,228 KB |
testcase_02 | AC | 80 ms
78,568 KB |
testcase_03 | AC | 77 ms
78,224 KB |
testcase_04 | AC | 81 ms
78,688 KB |
testcase_05 | AC | 78 ms
78,532 KB |
testcase_06 | AC | 78 ms
78,220 KB |
testcase_07 | AC | 78 ms
78,248 KB |
testcase_08 | AC | 78 ms
78,408 KB |
testcase_09 | AC | 77 ms
78,532 KB |
testcase_10 | AC | 77 ms
78,320 KB |
testcase_11 | AC | 78 ms
78,376 KB |
testcase_12 | AC | 78 ms
78,344 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 86 ms
78,324 KB |
testcase_29 | AC | 84 ms
78,308 KB |
testcase_30 | AC | 85 ms
78,336 KB |
testcase_31 | AC | 91 ms
78,884 KB |
testcase_32 | AC | 92 ms
78,848 KB |
testcase_33 | AC | 91 ms
78,956 KB |
testcase_34 | AC | 89 ms
78,988 KB |
testcase_35 | AC | 93 ms
78,916 KB |
testcase_36 | AC | 92 ms
78,944 KB |
testcase_37 | AC | 91 ms
79,088 KB |
testcase_38 | AC | 90 ms
78,816 KB |
testcase_39 | AC | 90 ms
78,996 KB |
testcase_40 | AC | 92 ms
79,248 KB |
ソースコード
mod = 1000000007 eps = 10**-9 def main(): import sys input = sys.stdin.readline # comb init nmax = 10 ** 5 + 10 # change here fac = [0] * nmax finv = [0] * nmax inv = [0] * nmax fac[0] = 1 fac[1] = 1 finv[0] = 1 finv[1] = 1 inv[1] = 1 for i in range(2, nmax): fac[i] = fac[i - 1] * i % mod inv[i] = mod - inv[mod % i] * (mod // i) % mod finv[i] = finv[i - 1] * inv[i] % mod def comb(n, r): if n < r: return 0 else: return (fac[n] * ((finv[r] * finv[n - r]) % mod)) % mod N = int(input()) S = input().rstrip('\n') ok = 0 # ABC flg = 0 for s in S: if flg == 0 and s == "A": flg = 1 elif flg == 1 and s == "B": flg = 2 elif flg == 2 and s == "C": ok = 1 break # BCA flg = 0 for s in S: if flg == 0 and s == "B": flg = 1 elif flg == 1 and s == "C": flg = 2 elif flg == 2 and s == "A": ok = 1 break # CAB flg = 0 for s in S: if flg == 0 and s == "C": flg = 1 elif flg == 1 and s == "A": flg = 2 elif flg == 2 and s == "B": ok = 1 break if not ok: print(1) exit() a = S.count("A") b = S.count("B") c = N - a - b ans = (comb(N, a) * comb(N-a, b) - a - b - c)%mod print(ans) if __name__ == '__main__': main()