#623375 (C++17) No.1481 Rotation ABC

• 問題: No.1481 Rotation ABC
• ユーザー: nok0
• 提出日時: 2021-02-27 10:40:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,072 bytes
• コンパイル時間: 4,312 ms
• コンパイル使用メモリ: 264,292 KB
• 実行使用メモリ: 39,040 KB
• 最終ジャッジ日時: 2024-10-02 17:11:48
• 合計ジャッジ時間: 8,900 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	75 ms; 38,488 KB
testcase_01	AC	78 ms; 38,504 KB
testcase_02	AC	75 ms; 38,504 KB
testcase_03	AC	74 ms; 38,396 KB
testcase_04	AC	73 ms; 38,488 KB
testcase_05	AC	75 ms; 38,464 KB
testcase_06	AC	76 ms; 38,324 KB
testcase_07	AC	78 ms; 38,464 KB
testcase_08	AC	77 ms; 38,472 KB
testcase_09	AC	77 ms; 38,344 KB
testcase_10	AC	73 ms; 38,416 KB
testcase_11	AC	72 ms; 38,528 KB
testcase_12	AC	73 ms; 38,388 KB
testcase_13	AC	76 ms; 38,672 KB
testcase_14	AC	75 ms; 38,892 KB
testcase_15	AC	74 ms; 38,668 KB
testcase_16	AC	75 ms; 38,644 KB
testcase_17	AC	76 ms; 38,668 KB
testcase_18	AC	79 ms; 38,852 KB
testcase_19	AC	75 ms; 38,756 KB
testcase_20	AC	75 ms; 38,576 KB
testcase_21	AC	78 ms; 38,776 KB
testcase_22	AC	76 ms; 38,656 KB
testcase_23	AC	76 ms; 38,912 KB
testcase_24	AC	75 ms; 38,772 KB
testcase_25	AC	77 ms; 38,784 KB
testcase_26	AC	75 ms; 38,736 KB
testcase_27	AC	78 ms; 38,772 KB
testcase_28	AC	78 ms; 38,708 KB
testcase_29	AC	80 ms; 38,800 KB
testcase_30	AC	75 ms; 38,840 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-

ソースコード

#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;

using mint = atcoder::modint998244353;

const int CombMAX = 3000000;
std::vector<mint> fac(CombMAX + 1), finv(CombMAX + 1), inv(CombMAX + 1);

struct Combinationinit {
	Combinationinit() {
		const int MOD = mint::mod();
		fac[0] = fac[1] = 1;
		finv[0] = finv[1] = 1;
		inv[1] = 1;
		for(int i = 2; i <= CombMAX; i++) {
			fac[i] = fac[i - 1] * i;
			inv[i] = MOD - inv[MOD % i] * (MOD / i);
			finv[i] = finv[i - 1] * inv[i];
		}
	}
} Combinationinit_;

int main() {
	int n;
	string s;
	cin >> n >> s;

	int count_a = count(s.begin(), s.end(), 'A');
	int count_b = count(s.begin(), s.end(), 'B');
	int count_c = count(s.begin(), s.end(), 'C');

	s += s;
	bool can_operation = 0, exist_a = 0, exist_ab = 0;
	for(auto &c : s) {
		if(c == 'A') exist_a = 1;
		if(c == 'B' and exist_a) exist_ab = 1;
		if(c == 'C' and exist_ab) can_operation = 1;
	}

	if(can_operation) {
		mint res = fac[n] * finv[count_a] * finv[count_b] * finv[count_c] - n;
		cout << res.val() << endl;
	} else
		cout << 1 << endl;
}