結果
問題 | No.790 ちきんの括弧並べ |
ユーザー | 👑 emthrm |
提出日時 | 2019-10-25 05:37:46 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,783 bytes |
コンパイル時間 | 684 ms |
コンパイル使用メモリ | 81,452 KB |
実行使用メモリ | 4,380 KB |
最終ジャッジ日時 | 2023-09-25 19:05:26 |
合計ジャッジ時間 | 1,955 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,380 KB |
ソースコード
// #include <algorithm> // #include <cassert> #include <iostream> #include <iomanip> #include <utility> #include <vector> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) const int MOD = 1000000007; // 998244353; struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(10); } } iosetup; /*-------------------------------------------------*/ int mod = MOD; struct ModInt { unsigned val; ModInt(): val(0) {} ModInt(long long x) : val(x >= 0 ? x % mod : x % mod + mod) {} ModInt pow(long long exponent) { ModInt tmp = *this, res = 1; while (exponent > 0) { if (exponent & 1) res *= tmp; tmp *= tmp; exponent >>= 1; } return res; } ModInt &operator+=(const ModInt &rhs) { if((val += rhs.val) >= mod) val -= mod; return *this; } ModInt &operator-=(const ModInt &rhs) { if((val += mod - rhs.val) >= mod) val -= mod; return *this; } ModInt &operator*=(const ModInt &rhs) { val = static_cast<unsigned long long>(val) * rhs.val % mod; return *this; } ModInt &operator/=(const ModInt &rhs) { return *this *= rhs.inv(); } bool operator==(const ModInt &rhs) const { return val == rhs.val; } bool operator!=(const ModInt &rhs) const { return val != rhs.val; } bool operator<(const ModInt &rhs) const { return val < rhs.val; } bool operator<=(const ModInt &rhs) const { return val <= rhs.val; } bool operator>(const ModInt &rhs) const { return val > rhs.val; } bool operator>=(const ModInt &rhs) const { return val >= rhs.val; } ModInt operator-() const { return ModInt(val ? mod - val : 0); } ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; } ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; } ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; } ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; } friend ostream &operator<<(ostream &os, const ModInt &rhs) { return os << rhs.val; } friend istream &operator>>(istream &is, ModInt &rhs) { long long x; is >> x; rhs = ModInt(x); return is; } private: ModInt inv() const { // if (__gcd(val, mod) != 1) assert(false); unsigned a = val, b = mod; int x = 1, y = 0; while (b) { unsigned tmp = a / b; swap(a -= tmp * b, b); swap(x -= tmp * y, y); } return ModInt(x); } }; int abs(const ModInt &x) { return x.val; } struct Combinatorics { vector<ModInt> fact, fact_inv, inv; Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) { fact[0] = 1; FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i; fact_inv[val] = ModInt(1) / fact[val]; for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i; FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i]; } ModInt nCk(int n, int k) { if (n < 0 || n < k || k < 0) return ModInt(0); // assert(n <= val && k <= val); return fact[n] * fact_inv[k] * fact_inv[n - k]; } ModInt nPk(int n, int k) { if (n < 0 || n < k || k < 0) return ModInt(0); // assert(n <= val); return fact[n] * fact_inv[n - k]; } ModInt nHk(int n, int k) { if (n < 0 || k < 0) return ModInt(0); return (k == 0 ? ModInt(1) : nCk(n + k - 1, k)); } private: int val; }; vector<ModInt> catalan_number(int val, Combinatorics &com) { // assert(val + 1 <= com.val); vector<ModInt> res(val + 1); res[0] = 1; REP(i, val) res[i + 1] = res[i] * com.inv[i + 2] * 2 * (2 * i + 1); return res; } int main() { mod = 742909; Combinatorics com(14); vector<ModInt> catalan = catalan_number(13, com); int n; cin >> n; cout << catalan[n] << '\n'; return 0; }