結果

問題 No.1927 AB-CD
ユーザー tonyu0tonyu0
提出日時 2022-05-06 22:41:07
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 14 ms / 2,000 ms
コード長 3,903 bytes
コンパイル時間 860 ms
コンパイル使用メモリ 92,432 KB
実行使用メモリ 10,572 KB
最終ジャッジ日時 2023-09-20 03:46:03
合計ジャッジ時間 2,568 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 11 ms
8,680 KB
testcase_05 AC 10 ms
8,472 KB
testcase_06 AC 10 ms
8,476 KB
testcase_07 AC 9 ms
7,832 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 11 ms
9,116 KB
testcase_10 AC 9 ms
7,328 KB
testcase_11 AC 10 ms
8,216 KB
testcase_12 AC 5 ms
5,404 KB
testcase_13 AC 6 ms
6,004 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 4 ms
4,380 KB
testcase_16 AC 10 ms
8,112 KB
testcase_17 AC 8 ms
6,840 KB
testcase_18 AC 9 ms
7,100 KB
testcase_19 AC 9 ms
7,624 KB
testcase_20 AC 12 ms
9,488 KB
testcase_21 AC 9 ms
7,588 KB
testcase_22 AC 5 ms
5,152 KB
testcase_23 AC 13 ms
9,868 KB
testcase_24 AC 13 ms
10,480 KB
testcase_25 AC 14 ms
10,480 KB
testcase_26 AC 13 ms
10,572 KB
testcase_27 AC 1 ms
4,380 KB
testcase_28 AC 2 ms
4,380 KB
testcase_29 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}
[[maybe_unused]] constexpr long long MOD = 998244353;
// constexpr long long MOD = 1000000007;
[[maybe_unused]] constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

template <long long mod = 1000000007>
class modint {
public:
  long long x;
  constexpr modint(const long long x = 0) noexcept : x(x % mod) {}
  constexpr long long &value() noexcept { return x; }
  constexpr const long long &value() const noexcept { return x; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    if ((x += rhs.x) >= mod) x -= mod;
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if ((x += mod - rhs.x) >= mod) x -= mod;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    x = x * rhs.x % mod;
    return *this;
  }
  constexpr modint &operator/=(const modint rhs) noexcept {
    *this *= rhs.inverse();
    return *this;
  }
  constexpr bool operator==(const modint &rhs) const { return x == rhs.x; }
  constexpr bool operator!=(const modint &rhs) const { return x != rhs.x; }
  modint inverse() const {
    long long 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 + mod);
  }

  modint pow(long long exp) const {
    modint res(1), mul(x);
    while (exp > 0) {
      if (exp & 1) res *= mul;
      mul *= mul;
      exp >>= 1;
    }
    return res;
  }
  operator long long() const { return x; }
  friend ostream &operator<<(ostream &os, const modint &rhs) {
    return os << rhs.x;
  }
  friend istream &operator>>(istream &is, modint &a) {
    long long t;
    is >> t;
    a = modint<mod>(t);
    return is;
  }
};

template <long long mod = 1000000007>
class combination {
  using mint = modint<mod>;

public:
  constexpr combination(size_t n) {
    fac = new mint[n + 1];
    inv = new mint[n + 1];
    inv_fac = new mint[n + 1];

    fac[0] = 1;
    inv_fac[0] = 1;
    inv[1] = 1;
    // i * inv[i] = 1 mod p.
    // p = p / i * i + p % i
    // => p / i * i + p % i = 0 mod p
    // => (p / i * -inv[p % i]) * i = 1 mod p
    for (size_t i = 2; i <= n; ++i) { inv[i] -= inv[mod % i] * mint(mod / i); }
    for (size_t i = 1; i <= n; ++i) {
      fac[i] = fac[i - 1] * mint(i);
      inv_fac[i] = inv_fac[i - 1] * inv[i];
    }
  }

  mint operator()(size_t n, size_t k) {
    if (n < k) { return 0; }
    return fac[n] * inv_fac[n - k] * inv_fac[k];
  }
  ~combination() {
    delete[] fac;
    delete[] inv_fac;
    delete[] inv;
  }

private:
  mint *fac, *inv, *inv_fac;
};

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  string s;
  cin >> n >> s;
  combination<MOD> comb(n);
  int ab = 0;
  for (char c : s) ab += c == 'A' || c == 'B';
  // ABAAABABB... / CCCDDDCDCCD
  // みたいな感じにまずできる
  cout << comb(n, ab);
  return 0;
}
0