結果
問題 | No.3048 Order and Harmony |
ユーザー | ei1333333 |
提出日時 | 2019-04-01 22:58:40 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 110 ms / 2,000 ms |
コード長 | 4,733 bytes |
コンパイル時間 | 2,101 ms |
コンパイル使用メモリ | 198,984 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-08-18 02:03:34 |
合計ジャッジ時間 | 5,736 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 64 ms
4,384 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 | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,384 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 2 ms
4,384 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 2 ms
4,384 KB |
testcase_24 | AC | 2 ms
4,380 KB |
testcase_25 | AC | 70 ms
4,376 KB |
testcase_26 | AC | 87 ms
4,384 KB |
testcase_27 | AC | 82 ms
4,380 KB |
testcase_28 | AC | 6 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,376 KB |
testcase_30 | AC | 4 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 66 ms
4,380 KB |
testcase_33 | AC | 2 ms
4,384 KB |
testcase_34 | AC | 19 ms
4,380 KB |
testcase_35 | AC | 2 ms
4,384 KB |
testcase_36 | AC | 17 ms
4,376 KB |
testcase_37 | AC | 90 ms
4,384 KB |
testcase_38 | AC | 16 ms
4,380 KB |
testcase_39 | AC | 73 ms
4,376 KB |
testcase_40 | AC | 59 ms
4,376 KB |
testcase_41 | AC | 77 ms
4,376 KB |
testcase_42 | AC | 75 ms
4,376 KB |
testcase_43 | AC | 1 ms
4,384 KB |
testcase_44 | AC | 73 ms
4,376 KB |
testcase_45 | AC | 18 ms
4,380 KB |
testcase_46 | AC | 50 ms
4,380 KB |
testcase_47 | AC | 48 ms
4,376 KB |
testcase_48 | AC | 28 ms
4,380 KB |
testcase_49 | AC | 1 ms
4,376 KB |
testcase_50 | AC | 38 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,380 KB |
testcase_52 | AC | 2 ms
4,380 KB |
testcase_53 | AC | 99 ms
4,380 KB |
testcase_54 | AC | 1 ms
4,380 KB |
testcase_55 | AC | 2 ms
4,380 KB |
testcase_56 | AC | 87 ms
4,380 KB |
testcase_57 | AC | 1 ms
4,380 KB |
testcase_58 | AC | 1 ms
4,376 KB |
testcase_59 | AC | 2 ms
4,380 KB |
testcase_60 | AC | 12 ms
4,376 KB |
testcase_61 | AC | 68 ms
4,380 KB |
testcase_62 | AC | 23 ms
4,380 KB |
testcase_63 | AC | 1 ms
4,380 KB |
testcase_64 | AC | 110 ms
4,380 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; struct INFTY { const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; operator int64() { return infll; } operator int() { return inf; } } inf; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } 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^=(int64_t n) { int y = x; x = 1; while(n > 0) { if(n & 1) x = 1LL * x * y % mod; y = 1LL * y * y % mod; n >>= 1; } 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; } ModInt operator^(const int64_t n) const { return ModInt(*this) ^= n; } 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; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } friend ostream &operator<<(ostream &os, const ModInt< mod > &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt< mod > &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } }; using modint = ModInt< mod >; int64 uku[] = { 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, 698611116, }; modint getUku(int N) { int64 mul = uku[N / 10000000]; for(int i = N / 10000000 * 10000000 + 1; i <= N; i++) { mul *= i; mul %= mod; } return mul; } int main() { int N; cin >> N; if(N % 2 == 1) { cout << 0 << endl; return 0; } N /= 2; int N2 = 2 * N; modint ret1 = getUku(N2), ret2 = getUku(N); ret2 *= ret2; cout << ret1 / ret2 << endl; }