結果

問題 No.727 仲介人moko
コンテスト
ユーザー jell
提出日時 2018-12-09 19:45:30
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,545 bytes
コンパイル時間 28,142 ms
コンパイル使用メモリ 275,952 KB
実行使用メモリ 7,296 KB
最終ジャッジ日時 2024-09-16 15:28:11
合計ジャッジ時間 30,782 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 13 WA * 5 RE * 7
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #include <boost/functional/hash.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using mlint = boost::multiprecision::cpp_int;

#include <cassert>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <complex>
#include <functional>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <iomanip>

using namespace std;
using i64 = int_fast64_t;
using db = double;
using pii = pair<int,int>;
using pli = pair<int_fast64_t,int>;
using pdi = pair<db,int>;
using plpii = pair<int_fast64_t,pair<int,int>>;
template <class T> using mat = vector<vector<T>>;
template <class T> using rprque = priority_queue<T,vector<T>,greater<T>>;

#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for(int_fast64_t i = (s); i <= (t); ++i)
#define drep(i,s,t) for(int_fast64_t i = (s); i >= (t); --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second

struct setupper {
    setupper(uint_fast8_t prec) {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(prec);
        #ifdef Local
        #define debug 1
        #define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
        cout << "-- Execution At Local ---\n" << "\n<Standard Output>\n" << "\n----------------\n\n";
        auto print_atexit = []() {
            time_t end_time = time(NULL);
            struct tm *ret = localtime(&end_time);
            cout << "\n----------------\n";
            cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";
        };
        atexit(print_atexit);
        #endif
    }
} setupper_obj(10);

template <class T, class U> ostream& operator << (ostream &s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream &s, vector<T> &v) { for(auto i = v.begin(); i != v.end(); ++i) { if(i != begin(v)) s << " "; s << *i; } return s; }

template <class T> void hash_combine(size_t &seed, T const &key) {
    hash<T> hasher;
    seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &p) const {
            size_t seed(0);
            hash_combine(seed,p.first);
            hash_combine(seed,p.second);
            return seed;
        }
    };
    template <class T, class U, class V> struct hash<tuple<T,U,V>> {
        size_t operator()(tuple<T,U,V> const &t) const {
            size_t seed(0);
            hash_combine(seed,get<0>(t));
            hash_combine(seed,get<1>(t));
            hash_combine(seed,get<2>(t));
            return seed;
        }
    };
}

const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x,y); };
const auto lam_max = [](auto x, auto y) { return max(x,y); };
const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };
const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
i64 mask(i64 n, uint8_t e) { return n & (1 << e) - 1; }
int ilog(i64 x, uint64_t b = 2) { if(x) return ilog(x / b, b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 :  x / y; }
i64 gcd(i64 a, i64 b) { if(!b) return abs(a); return gcd(b, a % b); }
i64 lcm(i64 a, i64 b) { if(a | b) return abs(a / gcd(a, b) * b); return 0; }
i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) {
    i64 d = a;
    if(b) d = extgcd(b,a % b,y,x),y -= (a / b) * x;
    else x = 1,y = 0;
    return d;
}
template <class F> i64 binsr(i64 ok, i64 ng, const F &fn) { while(abs(ok - ng) > 1){ i64 mid = ok + ng >> 1; (fn(mid) ? ok : ng) = mid; } return ok; }
template <class T> T cmprs(T &v) {
    T tmp,ret = v; sort(all(tmp = v));
    tmp.erase(unique(all(tmp)),end(tmp));
    each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
    return ret;
}

constexpr int dx[9] = {1,0,-1,0,1,-1,-1,1,0};
constexpr int dy[9] = {0,1,0,-1,1,1,-1,-1,0};
constexpr i64 mod = 1e9 + 7;
constexpr db gold = 1.618033988;
constexpr db eps = 1e-15;


struct Mathfn {
    constexpr static int n = 1 << 18;
    uint_fast64_t fact_[n + 1],invfact_[n + 1];

    constexpr Mathfn() : fact_(),invfact_() {
        fact_init(n);
        invfact_init(n);
    }

    constexpr void fact_init(int n) {
        fact_[0] = 1;
        for(int i = 1; i <= n; ++i) fact_[i] = fact_[i - 1] * i % mod;
    }

    constexpr uint_fast64_t fact(int x) {
        return x >= 0 ? fact_[x] : 0;
    }

    constexpr void invfact_init(int n) {
        invfact_[n] = modinv(fact(n));
        for(int i = n; i > 0; --i) invfact_[i - 1] = invfact_[i] * i % mod;
    }

    constexpr uint_fast64_t invfact(int x) {
        return x >= 0 ? invfact_[x] : 0;
    }

    constexpr uint_fast64_t comb(int x, int y) {
        return fact(x) * invfact(y) % mod * invfact(x - y) % mod;
    }

    constexpr uint_fast64_t modpow(int_fast64_t n, uint_fast64_t e) {
        if(!e) return 1;
        if(!(n %= mod)) return 0;
        return modpow(n * n % mod, e >> 1) * (e & 1 ? n : 1) % mod;
    }

    constexpr uint_fast64_t modinv(uint_fast64_t n) { return modpow(n,mod - 2); }

    constexpr int_fast64_t gcd(int_fast64_t a, int_fast64_t b) { if(!b) return a > 0 ? a : -a; return gcd(b, a % b); }

    constexpr int_fast64_t lcm(int_fast64_t a, int_fast64_t b) { if(a | b) return a / gcd(a, b) * b; return 0; }
} mf;

int n;

int main() {
    cin>>n;
    i64 ans=mf.fact(n)*mf.fact(n)%mod;
    rep(i,n) {
        ans=ans*(2*i+1)%mod;
    }
    esc(ans);
}
0