結果
| 問題 | No.523 LED |
| ユーザー |
 haruki_K
|
| 提出日時 | 2020-02-08 05:23:40 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,177 ms / 2,000 ms |
| コード長 | 7,117 bytes |
| コンパイル時間 | 1,788 ms |
| コンパイル使用メモリ | 170,112 KB |
| 実行使用メモリ | 237,876 KB |
| 最終ジャッジ日時 | 2024-09-25 08:43:48 |
| 合計ジャッジ時間 | 31,781 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,175 ms
237,788 KB |
| testcase_01 | AC | 958 ms
237,740 KB |
| testcase_02 | AC | 928 ms
237,820 KB |
| testcase_03 | AC | 937 ms
237,716 KB |
| testcase_04 | AC | 1,151 ms
237,800 KB |
| testcase_05 | AC | 1,177 ms
237,836 KB |
| testcase_06 | AC | 1,165 ms
237,724 KB |
| testcase_07 | AC | 1,130 ms
237,716 KB |
| testcase_08 | AC | 1,074 ms
237,720 KB |
| testcase_09 | AC | 945 ms
237,816 KB |
| testcase_10 | AC | 926 ms
237,844 KB |
| testcase_11 | AC | 1,091 ms
237,720 KB |
| testcase_12 | AC | 1,056 ms
237,684 KB |
| testcase_13 | AC | 925 ms
237,768 KB |
| testcase_14 | AC | 935 ms
237,876 KB |
| testcase_15 | AC | 946 ms
237,724 KB |
| testcase_16 | AC | 927 ms
237,800 KB |
| testcase_17 | AC | 910 ms
237,828 KB |
| testcase_18 | AC | 923 ms
237,844 KB |
| testcase_19 | AC | 935 ms
237,876 KB |
| testcase_20 | AC | 933 ms
237,824 KB |
| testcase_21 | AC | 1,128 ms
237,676 KB |
| testcase_22 | AC | 1,154 ms
237,744 KB |
| testcase_23 | AC | 1,105 ms
237,792 KB |
| testcase_24 | AC | 1,103 ms
237,828 KB |
ソースコード
// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T,d-1>::type>;
template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<
// >>> montgomery modint
template <uint32_t MOD>
struct modint {
using u32 = uint32_t;
using u64 = uint64_t;
using i64 = int64_t;
using M = modint;
static constexpr u32 mul_inv(u32 n, int e = 5, u32 x = 1) {
return e == 0 ? x : mul_inv(n, e-1, x*(2-x*n));
}
static constexpr u32 mod = MOD;
static constexpr u32 nn = mul_inv(MOD);
static constexpr u32 r2 = -u64(MOD) % MOD;
u32 x;
constexpr modint(i64 x = 0) : x(reduce(((x%=MOD)<0 ? x+MOD : x)*r2)) {}
static constexpr u32 reduce(u64 w) {
return u32(w >> 32) + MOD - i64((u64(u32(w) * nn) * MOD) >> 32);
}
constexpr i64 val() const {
i64 r = reduce(x);
if (r >= MOD) r -= MOD;
return r;
}
constexpr operator i64() const { return val(); }
constexpr bool operator==(M p) const { return val() == p.val(); }
constexpr bool operator!=(M p) const { return val() != p.val(); }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { M r; r.x = x ? i64(2*MOD)-x : 0; return r; }
constexpr M &operator+=(M p) {
i64 t = x; if (((t += p.x) -= 2*MOD) < 0) t += 2*MOD;
x = t;
return *this;
}
constexpr M &operator-=(M p) { return *this += -p; }
constexpr M &operator*=(M p) { x = reduce(u64(x)*p.x); return *this; }
constexpr M &operator/=(M p) { *this *= p.inv(); return *this; }
constexpr M operator+(M p) const { return M(*this) += p; }
constexpr M operator-(M p) const { return M(*this) -= p; }
constexpr M operator*(M p) const { return M(*this) *= p; }
constexpr M operator/(M p) const { return M(*this) /= p; }
friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
constexpr M inv() const { return pow(MOD - 2); }
constexpr M pow(i64 n) const {
if (n < 0) return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
return r;
}
friend ostream &operator<<(ostream &os, M p) {
return os << p.val();
}
friend istream &operator>>(istream &is, M &a) {
u32 t; is >> t; a = t; return is;
}
#ifdef LOCAL
friend string to_s(M p) { return to_s(p.val(), MOD); }
#endif
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
// >>> mod table
template <int32_t mod>
struct ModTable {
static constexpr int32_t Size = 2e7 + 10;
static_assert(Size <= mod, "");
using ll = int64_t;
int32_t fact[Size], finv[Size], inv[Size];
ModTable() {
fact[0] = fact[1] = finv[0] = finv[1] = inv[1] = 1;
for (int i = 2; i < Size; i++) {
fact[i] = ll(fact[i-1])*i % mod;
inv[i] = mod - ll(inv[mod%i])*(mod/i) % mod;
finv[i] = ll(finv[i-1])*inv[i] % mod;
}
}
};
const ModTable<MOD> mod_tab;
modint<MOD> fact(int n) {
assert(0 <= n); assert(n < ModTable<MOD>::Size);
return mod_tab.fact[n];
}
modint<MOD> finv(int n) {
assert(0 <= n); assert(n < ModTable<MOD>::Size);
return mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
if (n < 0 || k < 0 || n < k) return 0;
return fact(n)*finv(k)*finv(n-k);
}
modint<MOD> P(int n, int k) {
assert(k >= 0);
return fact(n)*finv(n-k);
}
// <<<
int32_t main() {
int n; cin >> n;
cout << fact(2*n)/mint(2).pow(n) << endl;
}