結果
問題 | No.1927 AB-CD |
ユーザー | Cyanmond |
提出日時 | 2022-05-06 21:32:09 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 11,731 bytes |
コンパイル時間 | 2,130 ms |
コンパイル使用メモリ | 204,264 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-05 22:43:30 |
合計ジャッジ時間 | 3,806 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 40 ms
5,376 KB |
testcase_05 | AC | 39 ms
5,376 KB |
testcase_06 | AC | 38 ms
5,376 KB |
testcase_07 | AC | 34 ms
5,376 KB |
testcase_08 | AC | 5 ms
5,376 KB |
testcase_09 | AC | 41 ms
5,376 KB |
testcase_10 | AC | 31 ms
5,376 KB |
testcase_11 | AC | 36 ms
5,376 KB |
testcase_12 | AC | 17 ms
5,376 KB |
testcase_13 | AC | 20 ms
5,376 KB |
testcase_14 | AC | 3 ms
5,376 KB |
testcase_15 | AC | 9 ms
5,376 KB |
testcase_16 | AC | 37 ms
5,376 KB |
testcase_17 | AC | 27 ms
5,376 KB |
testcase_18 | AC | 30 ms
5,376 KB |
testcase_19 | AC | 32 ms
5,376 KB |
testcase_20 | AC | 45 ms
5,376 KB |
testcase_21 | AC | 33 ms
5,376 KB |
testcase_22 | AC | 15 ms
5,376 KB |
testcase_23 | AC | 48 ms
5,376 KB |
testcase_24 | AC | 53 ms
5,376 KB |
testcase_25 | AC | 53 ms
5,376 KB |
testcase_26 | AC | 52 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
ソースコード
#line 2 "ProCon/Library/template/util.hpp" #include <algorithm> #include <array> #include <cassert> #include <cstdint> #include <iostream> #include <iterator> #include <limits> #include <numeric> #include <queue> #include <random> #include <tuple> #include <type_traits> #include <vector> using i8 = std::int8_t; using u8 = std::uint8_t; using i16 = std::int16_t; using i32 = std::int32_t; using i64 = std::int64_t; using u16 = std::uint16_t; using u32 = std::uint32_t; using u64 = std::uint64_t; constexpr i8 operator""_i8(unsigned long long n) noexcept { return static_cast<i8>(n); } constexpr i16 operator""_i16(unsigned long long n) noexcept { return static_cast<i16>(n); } constexpr i32 operator""_i32(unsigned long long n) noexcept { return static_cast<i32>(n); } constexpr i64 operator""_i64(unsigned long long n) noexcept { return static_cast<i64>(n); } constexpr u8 operator""_u8(unsigned long long n) noexcept { return static_cast<u8>(n); } constexpr u16 operator""_u16(unsigned long long n) noexcept { return static_cast<u16>(n); } constexpr u32 operator""_u32(unsigned long long n) noexcept { return static_cast<u32>(n); } constexpr u64 operator""_u64(unsigned long long n) noexcept { return static_cast<u64>(n); } constexpr char eoln = '\n'; template <typename T, T Div = 2> constexpr T infty = std::numeric_limits<T>::max() / Div - 2; template <class T> using RevPriorityQueue = std::priority_queue<T, std::vector<T>, std::greater<T>>; constexpr std::array<std::pair<int, int>, 4> dxy4 = {{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}}; constexpr std::array<i64, 6> infty_list = {infty<short>, infty<int>, infty<i64>, infty<i64, 3>, infty<u32>, infty<u64>}; template <typename T> bool is_infty(const T v) { if (v > 0 and static_cast<u64>(v) > infty<u64>) return false; for (const auto e : infty_list) { if (e == static_cast<i64>(v)) return true; } return false; } class Range { struct Iterator { int itr; constexpr Iterator(const int pos) noexcept : itr(pos) {} constexpr void operator++() noexcept { ++itr; } constexpr bool operator!=(const Iterator &other) const noexcept { return itr != other.itr; } constexpr int operator*() const noexcept { return itr; } }; const Iterator first, last; public: explicit constexpr Range(const int f, const int l) noexcept : first(f), last(std::max(f, l)) {} constexpr Iterator begin() const noexcept { return first; } constexpr Iterator end() const noexcept { return last; } }; class ReversedRange { struct Iterator { int itr; constexpr Iterator(const int pos) noexcept : itr(pos) {} constexpr void operator++() noexcept { --itr; } constexpr bool operator!=(const Iterator &other) const noexcept { return itr != other.itr; } constexpr int operator*() const noexcept { return itr; } }; const Iterator first, last; public: explicit constexpr ReversedRange(const int f, const int l) noexcept : first(l - 1), last(std::min(f, l) - 1) {} constexpr Iterator begin() const noexcept { return first; } constexpr Iterator end() const noexcept { return last; } }; #define SIKICM_REP1(i, r) for (const int i : Range(0, r)) #define SIKICM_REP2(i, l, r) for (int i : Range(l, r)) #define SIKICM_RVP1(i, r) for (const int i : ReversedRange(0, r)) #define SIKICM_RVP2(i, l, r) for (int i : ReversedRange(l, r)) #define SIKICM_SELECT2(a, b, c, name, ...) name #define REP(...) SIKICM_SELECT2(__VA_ARGS__, SIKICM_REP2, SIKICM_REP1)(__VA_ARGS__) #define RVP(...) SIKICM_SELECT2(__VA_ARGS__, SIKICM_RVP2, SIKICM_RVP1)(__VA_ARGS__) #define HRL(n) for ([[maybe_unused]] const int loop_counter : Range(0, n)) template <class Container> constexpr int len(const Container &c) { return static_cast<int>(std::size(c)); } template <typename T> constexpr bool chmin(T &v, const T a) { if (v > a) { v = a; return true; } return false; } template <typename T> constexpr bool chmax(T &v, const T a) { if (v < a) { v = a; return true; } return false; } template <typename T> constexpr T ceil_div(const T x, const T y) { assert(y != 0); assert(x > 0 and y > 0); return (x + y - 1) / y; } template <class Container, class T> constexpr int lwb(const Container &c, const T &val) { return static_cast<int>(std::distance(c.cbegin(), std::lower_bound(c.cbegin(), c.cend(), val))); } template <class Container, class T> constexpr int upb(const Container &c, const T &val) { return static_cast<int>(std::distance(c.cbegin(), std::upper_bound(c.cbegin(), c.cend(), val))); } template <class Container, class F> constexpr int lmp(const Container &c, const F &f) { return static_cast<int>( std::distance(c.cbegin(), std::partition_point(c.cbegin(), c.cend(), f))); } template <class T> auto make_vec(const int n, const T &value) { return std::vector<T>(n, value); } template <class... Args> auto make_vec(const int n, Args... args) { return std::vector<decltype(make_vec(args...))>(n, make_vec(args...)); } template <class T, class... Tail> void renumber(const std::vector<int> &order, std::vector<T> &head, Tail &... tail) { const int n = len(order); std::vector<T> sorted_head(n); REP(i, n) sorted_head[i] = head[order[i]]; head = std::move(sorted_head); if constexpr (sizeof...(Tail) != 0) { renumber(order, tail...); } } template <class Head, class... Tail> std::vector<int> priority_sort(std::vector<Head> &head, std::vector<Tail> &... tail) { const int n = len(head); std::vector<std::tuple<Head, Tail..., int>> res(n); REP(i, n) res[i] = std::make_tuple(head[i], tail[i]..., i); std::sort(res.begin(), res.end()); std::vector<int> order(n); REP(i, 0, n) order[i] = std::get<std::tuple_size_v<std::tuple<Head, Tail...>>>(res[i]); renumber(order, head, tail...); return order; } std::vector<int> iotav(const int n) { std::vector<int> ret(n); std::iota(ret.begin(), ret.end(), 0); return ret; } template <class Container> auto calc_sum(const Container &c) { return std::accumulate(c.cbegin(), c.cend(), static_cast<typename Container::value_type>(0)); } template <typename T> constexpr T ceil_log2(const T x) { int e = 0; while ((static_cast<T>(1) << e) < x) ++e; return e; } template <typename T> constexpr int ceil_pow2(const T x) { return 1 << ceil_log2(x); } #line 5 "ProCon/Library/template/debug.hpp" #include <utility> namespace DebugImpl { template <typename U, typename = void> struct is_specialize : std::false_type {}; template <typename U> struct is_specialize<U, typename std::conditional<false, typename U::iterator, void>::type> : std::true_type {}; template <typename U> struct is_specialize<U, typename std::conditional<false, decltype(U::first), void>::type> : std::true_type {}; template <typename U> struct is_specialize<U, std::enable_if_t<std::is_integral<U>::value, void>> : std::true_type {}; void dump(const char &t) { std::cerr << t; } void dump(const std::string &t) { std::cerr << t; } void dump(const bool &t) { std::cerr << (t ? "true" : "false"); } template <typename U, std::enable_if_t<!is_specialize<U>::value, std::nullptr_t> = nullptr> void dump(const U &t) { std::cerr << t; } template <typename T> void dump(const T &t, std::enable_if_t<std::is_integral<T>::value> * = nullptr) { std::string res; if (is_infty(t)) res = "inf"; if constexpr (std::is_signed<T>::value) { if (is_infty(-t)) res = "-inf"; } if (res.empty()) res = std::to_string(t); std::cerr << res; } template <typename T, typename U> void dump(const std::pair<T, U> &); template <typename T> void dump(const std::pair<T *, int> &); template <typename T> void dump(const T &t, std::enable_if_t<!std::is_void<typename T::iterator>::value> * = nullptr) { std::cerr << "[ "; for (auto it = t.begin(); it != t.end();) { dump(*it); std::cerr << (++it == t.end() ? "" : ", "); } std::cerr << " ]"; } template <typename T, typename U> void dump(const std::pair<T, U> &t) { std::cerr << "( "; dump(t.first); std::cerr << ", "; dump(t.second); std::cerr << " )"; } template <typename T> void dump(const std::pair<T *, int> &t) { std::cerr << "[ "; for (int i = 0; i < t.second; i++) { dump(t.first[i]); std::cerr << (i == t.second - 1 ? "" : ", "); } std::cerr << " ]"; } void trace() { std::cerr << std::endl; } template <typename Head, typename... Tail> void trace(Head &&head, Tail &&... tail) { std::cerr << " "; dump(head); if (sizeof...(tail) != 0) std::cerr << ','; trace(std::forward<Tail>(tail)...); } } // namespace DebugImpl #ifdef SIKI_DEBUG #define vpr(...) \ do { \ std::cerr << "## " << #__VA_ARGS__ << " ="; \ DebugImpl::trace(__VA_ARGS__); \ } while (0) #else #define vpr(...) (void(0)) #endif // https://github.com/NyaanNyaan/library/blob/master/template/debug.hpp #line 2 "ProCon/Library/template/macro.hpp" #define ALL(x) (x).begin(), (x).end() #define pf push_front #define pb push_back #define ef emplace_front #define eb emplace_back #define ppf pop_front #define ppb pop_back #line 4 "main.cpp" #include <bits/stdc++.h> using namespace std; #line 2 "ProCon/Library/nyaan_lib/modint/modint.hpp" template <int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt<mod>(t); return (is); } int get() const { return x; } static constexpr int get_mod() { return mod; } }; #line 9 "main.cpp" using Fp = ModInt<998244353>; int main() { int N; string S; cin >> N >> S; int count_0 = 0, count_1 = 0; for (const char e : S) ++(e == 'A' or e == 'B' ? count_0 : count_1); Fp ans = 1; REP(i, 1, N + 1) ans *= i; REP(i, 1, count_0 + 1) ans /= i; REP(i, 1, count_1 + 1) ans /= i; cout << ans << eoln; }