結果
問題 | No.1481 Rotation ABC |
ユーザー | tamato |
提出日時 | 2021-04-16 22:05:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 77 ms / 2,000 ms |
コード長 | 1,541 bytes |
コンパイル時間 | 253 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 77,824 KB |
最終ジャッジ日時 | 2024-07-03 01:53:47 |
合計ジャッジ時間 | 3,854 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
mod = 998244353 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()