結果
問題 | No.3048 Order and Harmony |
ユーザー | risujiroh |
提出日時 | 2019-04-01 23:06:12 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 3,648 bytes |
コンパイル時間 | 1,500 ms |
コンパイル使用メモリ | 167,240 KB |
実行使用メモリ | 4,380 KB |
最終ジャッジ日時 | 2023-08-18 02:12:23 |
合計ジャッジ時間 | 5,696 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 3 ms
4,376 KB |
testcase_03 | AC | 88 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 1 ms
4,380 KB |
testcase_25 | AC | 93 ms
4,376 KB |
testcase_26 | AC | 113 ms
4,376 KB |
testcase_27 | AC | 107 ms
4,376 KB |
testcase_28 | AC | 6 ms
4,380 KB |
testcase_29 | AC | 1 ms
4,380 KB |
testcase_30 | AC | 4 ms
4,376 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 87 ms
4,376 KB |
testcase_33 | AC | 1 ms
4,380 KB |
testcase_34 | AC | 21 ms
4,376 KB |
testcase_35 | AC | 2 ms
4,376 KB |
testcase_36 | AC | 19 ms
4,376 KB |
testcase_37 | AC | 115 ms
4,376 KB |
testcase_38 | AC | 17 ms
4,376 KB |
testcase_39 | AC | 81 ms
4,380 KB |
testcase_40 | AC | 65 ms
4,376 KB |
testcase_41 | AC | 86 ms
4,380 KB |
testcase_42 | AC | 98 ms
4,376 KB |
testcase_43 | AC | 2 ms
4,380 KB |
testcase_44 | AC | 81 ms
4,376 KB |
testcase_45 | AC | 20 ms
4,380 KB |
testcase_46 | AC | 55 ms
4,380 KB |
testcase_47 | AC | 67 ms
4,380 KB |
testcase_48 | AC | 31 ms
4,376 KB |
testcase_49 | AC | 2 ms
4,380 KB |
testcase_50 | AC | 57 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,380 KB |
testcase_52 | AC | 1 ms
4,376 KB |
testcase_53 | AC | 124 ms
4,380 KB |
testcase_54 | AC | 2 ms
4,376 KB |
testcase_55 | AC | 2 ms
4,380 KB |
testcase_56 | AC | 111 ms
4,380 KB |
testcase_57 | AC | 1 ms
4,380 KB |
testcase_58 | AC | 2 ms
4,380 KB |
testcase_59 | AC | 1 ms
4,380 KB |
testcase_60 | AC | 13 ms
4,376 KB |
testcase_61 | AC | 90 ms
4,376 KB |
testcase_62 | AC | 26 ms
4,380 KB |
testcase_63 | AC | 1 ms
4,376 KB |
testcase_64 | AC | 137 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; template<class T = int> using V = vector<T>; template<class T = int> using VV = V< V<T> >; template<unsigned P> struct ModInt { using M = ModInt; unsigned v; ModInt() : v(0) {} template<class Z> ModInt(Z x) : v(x >= 0 ? x % P : (P - -x % P) % P) {} constexpr ModInt(unsigned v, int) : v(v) {} static constexpr unsigned p() { return P; } M operator+() const { return *this; } M operator-() const { return {v ? P - v : 0, 0}; } explicit operator bool() const noexcept { return v; } bool operator!() const noexcept { return !(bool) *this; } M operator*(M r) const { return M(*this) *= r; } M operator/(M r) const { return M(*this) /= r; } M operator+(M r) const { return M(*this) += r; } M operator-(M r) const { return M(*this) -= r; } bool operator==(M r) const { return v == r.v; } bool operator!=(M r) const { return !(*this == r); } M& operator*=(M r) { v = (uint64_t) v * r.v % P; return *this; } M& operator/=(M r) { return *this *= r.inv(); } M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; } M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; } M inv() const { int a = v, b = P, x = 1, u = 0; while (b) { int q = a / b; swap(a -= q * b, b); swap(x -= q * u, u); } assert(a == 1); return x; } template<class Z> M pow(Z n) const { if (n < 0) return pow(-n).inv(); M res = 1; for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a; return res; } template<class Z> friend M operator*(Z l, M r) { return M(l) *= r; } template<class Z> friend M operator/(Z l, M r) { return M(l) /= r; } template<class Z> friend M operator+(Z l, M r) { return M(l) += r; } template<class Z> friend M operator-(Z l, M r) { return M(l) -= r; } friend ostream& operator<<(ostream& os, M r) { return os << r.v; } friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; } template<class Z> friend bool operator==(Z l, M r) { return M(l) == r; } template<class Z> friend bool operator!=(Z l, M r) { return !(l == r); } }; using Mint = ModInt<(unsigned) 1e9 + 7>; V<Mint> tab{1, 682498929, 491101308, 76479948, 723816384, 67347853, 27368307, 625544428, 199888908, 888050723, 927880474, 281863274, 661224977, 623534362, 970055531, 261384175, 195888993, 66404266, 547665832, 109838563, 933245637, 724691727, 368925948, 268838846, 136026497, 112390913, 135498044, 217544623, 419363534, 500780548, 668123525, 128487469, 30977140, 522049725, 309058615, 386027524, 189239124, 148528617, 940567523, 917084264, 429277690, 996164327, 358655417, 568392357, 780072518, 462639908, 275105629, 909210595, 99199382, 703397904, 733333339, 97830135, 608823837, 256141983, 141827977, 696628828, 637939935, 811575797, 848924691, 131772368, 724464507, 272814771, 326159309, 456152084, 903466878, 92255682, 769795511, 373745190, 606241871, 825871994, 957939114, 435887178, 852304035, 663307737, 375297772, 217598709, 624148346, 671734977, 624500515, 748510389, 203191898, 423951674, 629786193, 672850561, 814362881, 823845496, 116667533, 256473217, 627655552, 245795606, 586445753, 172114298, 193781724, 778983779, 83868974, 315103615, 965785236, 492741665, 377329025, 847549272}; constexpr int N = 1e7; Mint fact(int n) { int i = n; Mint res = 1; while (i % N) { res *= i--; } res *= tab[i / N]; return res; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; if (n & 1) { cout << 0 << '\n'; } else { auto res = fact(n) / fact(n / 2) / fact(n / 2); cout << res << '\n'; } }