結果
問題 | No.1481 Rotation ABC |
ユーザー | hitonanode |
提出日時 | 2021-04-16 22:08:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 235 ms / 2,000 ms |
コード長 | 10,292 bytes |
コンパイル時間 | 2,382 ms |
コンパイル使用メモリ | 216,824 KB |
実行使用メモリ | 6,212 KB |
最終ジャッジ日時 | 2024-07-03 01:56:46 |
合計ジャッジ時間 | 7,622 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 176 ms
6,184 KB |
testcase_14 | AC | 195 ms
6,196 KB |
testcase_15 | AC | 173 ms
6,056 KB |
testcase_16 | AC | 147 ms
5,376 KB |
testcase_17 | AC | 138 ms
5,376 KB |
testcase_18 | AC | 208 ms
6,088 KB |
testcase_19 | AC | 139 ms
5,376 KB |
testcase_20 | AC | 131 ms
5,376 KB |
testcase_21 | AC | 191 ms
6,196 KB |
testcase_22 | AC | 118 ms
5,376 KB |
testcase_23 | AC | 232 ms
6,084 KB |
testcase_24 | AC | 228 ms
6,088 KB |
testcase_25 | AC | 235 ms
6,108 KB |
testcase_26 | AC | 234 ms
6,212 KB |
testcase_27 | AC | 235 ms
6,072 KB |
testcase_28 | AC | 97 ms
5,376 KB |
testcase_29 | AC | 97 ms
5,376 KB |
testcase_30 | AC | 35 ms
5,376 KB |
testcase_31 | AC | 124 ms
5,376 KB |
testcase_32 | AC | 143 ms
5,376 KB |
testcase_33 | AC | 119 ms
5,376 KB |
testcase_34 | AC | 110 ms
5,376 KB |
testcase_35 | AC | 103 ms
5,376 KB |
testcase_36 | AC | 100 ms
5,376 KB |
testcase_37 | AC | 68 ms
5,376 KB |
testcase_38 | AC | 63 ms
5,376 KB |
testcase_39 | AC | 49 ms
5,376 KB |
testcase_40 | AC | 105 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T, typename V> void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); } template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; } #endif template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #else #define dbg(x) (x) #endif template <int mod> struct ModInt { #if __cplusplus >= 201402L #define MDCONST constexpr #else #define MDCONST #endif using lint = long long; MDCONST static int get_mod() { return mod; } static int get_primitive_root() { static int primitive_root = 0; if (!primitive_root) { primitive_root = [&]() { std::set<int> fac; int v = mod - 1; for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i; if (v > 1) fac.insert(v); for (int g = 1; g < mod; g++) { bool ok = true; for (auto i : fac) if (ModInt(g).pow((mod - 1) / i) == 1) { ok = false; break; } if (ok) return g; } return -1; }(); } return primitive_root; } int val; MDCONST ModInt() : val(0) {} MDCONST ModInt &_setval(lint v) { return val = (v >= mod ? v - mod : v), *this; } MDCONST ModInt(lint v) { _setval(v % mod + mod); } MDCONST explicit operator bool() const { return val != 0; } MDCONST ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); } MDCONST ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); } MDCONST ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); } MDCONST ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); } MDCONST ModInt operator-() const { return ModInt()._setval(mod - val); } MDCONST ModInt &operator+=(const ModInt &x) { return *this = *this + x; } MDCONST ModInt &operator-=(const ModInt &x) { return *this = *this - x; } MDCONST ModInt &operator*=(const ModInt &x) { return *this = *this * x; } MDCONST ModInt &operator/=(const ModInt &x) { return *this = *this / x; } friend MDCONST ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); } friend MDCONST ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); } friend MDCONST ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); } friend MDCONST ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); } MDCONST bool operator==(const ModInt &x) const { return val == x.val; } MDCONST bool operator!=(const ModInt &x) const { return val != x.val; } MDCONST bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map<ModInt, T> friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; return is >> t, x = ModInt(t), is; } MDCONST friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { return os << x.val; } MDCONST ModInt pow(lint n) const { lint ans = 1, tmp = this->val; while (n) { if (n & 1) ans = ans * tmp % mod; tmp = tmp * tmp % mod, n /= 2; } return ans; } static std::vector<long long> facs, invs; MDCONST static void _precalculation(int N) { int l0 = facs.size(); if (N <= l0) return; facs.resize(N), invs.resize(N); for (int i = l0; i < N; i++) facs[i] = facs[i - 1] * i % mod; long long facinv = ModInt(facs.back()).pow(mod - 2).val; for (int i = N - 1; i >= l0; i--) { invs[i] = facinv * facs[i - 1] % mod; facinv = facinv * i % mod; } } MDCONST lint inv() const { if (this->val < std::min(mod >> 1, 1 << 21)) { while (this->val >= int(facs.size())) _precalculation(facs.size() * 2); return invs[this->val]; } else { return this->pow(mod - 2).val; } } MDCONST ModInt fac() const { while (this->val >= int(facs.size())) _precalculation(facs.size() * 2); return facs[this->val]; } MDCONST ModInt doublefac() const { lint k = (this->val + 1) / 2; return (this->val & 1) ? ModInt(k * 2).fac() / (ModInt(2).pow(k) * ModInt(k).fac()) : ModInt(k).fac() * ModInt(2).pow(k); } MDCONST ModInt nCr(const ModInt &r) const { return (this->val < r.val) ? 0 : this->fac() / ((*this - r).fac() * r.fac()); } ModInt sqrt() const { if (val == 0) return 0; if (mod == 2) return val; if (pow((mod - 1) / 2) != 1) return 0; ModInt b = 1; while (b.pow((mod - 1) / 2) == 1) b += 1; int e = 0, m = mod - 1; while (m % 2 == 0) m >>= 1, e++; ModInt x = pow((m - 1) / 2), y = (*this) * x * x; x *= (*this); ModInt z = b.pow(m); while (y != 1) { int j = 0; ModInt t = y; while (t != 1) j++, t *= t; z = z.pow(1LL << (e - j - 1)); x *= z, z *= z, y *= z; e = j; } return ModInt(std::min(x.val, mod - x.val)); } }; template <int mod> std::vector<long long> ModInt<mod>::facs = {1}; template <int mod> std::vector<long long> ModInt<mod>::invs = {0}; using mint = ModInt<998244353>; int main() { int N; string S; cin >> N >> S; set<string> se; se.insert(""); for (auto c : S) { set<string> snx; for (auto s : se) { if (s.size() < 3) { snx.insert(s + c); } } for (auto s : snx) se.insert(s); } bool b = false; for (auto s : se) { if (s == "ABC" or s == "BCA" or s == "CAB") b = true; } dbg(se); if (!b) { puts("1"); return 0; } vector<int> cnt(3); for (auto c : S) cnt[c - 'A']++; mint ret = mint(N).nCr(cnt[0]) * mint(N - cnt[0]).nCr(cnt[1]); dbg(ret); REP(d, 3) { int e = (d + 1) % 3, f = (d + 2) % 3; ret -= cnt[d]; } cout << ret << '\n'; }