結果
問題 | No.391 CODING WAR |
ユーザー | tokusakurai |
提出日時 | 2020-08-27 14:09:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 3,807 bytes |
コンパイル時間 | 2,472 ms |
コンパイル使用メモリ | 203,920 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 16:59:43 |
合計ジャッジ時間 | 3,297 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 22 ms
5,248 KB |
testcase_10 | AC | 21 ms
5,248 KB |
testcase_11 | AC | 11 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 18 ms
5,248 KB |
testcase_14 | AC | 17 ms
5,248 KB |
testcase_15 | AC | 18 ms
5,248 KB |
testcase_16 | AC | 11 ms
5,248 KB |
testcase_17 | AC | 14 ms
5,248 KB |
testcase_18 | AC | 10 ms
5,248 KB |
testcase_19 | AC | 10 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define elif else if #define sp(x) fixed << setprecision(x) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const ll MOD = 1000000007; //const ll MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const double pi = acos(-1.0); const double EPS = 1e-10; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; template<ll mod> struct Mod_Int{ ll x; Mod_Int() {} Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Mod_Int &operator += (const Mod_Int &p){ x = (x + p.x) % mod; return *this; } Mod_Int &operator -= (const Mod_Int &p){ x = (x + mod - p.x) % mod; return *this; } Mod_Int &operator *= (const Mod_Int &p){ x = (x * p.x) % mod; return *this; } Mod_Int &operator /= (const Mod_Int &p){ *this *= p.inverse(); return *this; } Mod_Int &operator ++ () {return *this += Mod_Int(1);} Mod_Int operator ++ (int){ Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator -- () {return *this -= Mod_Int(1);} Mod_Int operator -- (int){ Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator - () const {return Mod_Int(-x);} Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;} Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;} Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;} Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;} bool operator == (const Mod_Int &p) const {return x == p.x;} bool operator != (const Mod_Int &p) const {return x != p.x;} Mod_Int inverse() const { assert(*this != Mod_Int(0)); return pow(mod-2); } Mod_Int pow(ll k) const{ Mod_Int now = *this, ret = 1; while(k){ if(k&1) ret *= now; now *= now, k >>= 1; } return ret; } friend ostream &operator << (ostream &os, const Mod_Int &p){ return os << p.x; } friend istream &operator >> (istream &is, Mod_Int &p){ ll a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; template<typename T> struct combination{ vector<T> _fac, _ifac; combination(int n){ _fac.resize(n+1), _ifac.resize(n+1); _fac[0] = 1; rep2(i, 1, n) _fac[i] = _fac[i-1]*i; _ifac[n] = _fac[n].inverse(); rep3(i, n, 1) _ifac[i-1] = _ifac[i]*i; } T fac(int k) const {return _fac[k];} T ifac(int k) const {return _ifac[k];} T comb(int n, int k) const{ if(k < 0 || n < k) return 0; return fac(n) * ifac(n-k) * ifac(k); } T perm(int n, int k) const{ if(k < 0 || n < k) return 0; return fac(n) * ifac(n-k); } T second_stirling_number(ll n, int k){ //n個の区別できるボールをk個の区別できない箱に分割 T ret = 0; rep(i, k+1){ T tmp = comb(k, i)*T(k-i).pow(n); ret += ((i&1)? -tmp : tmp); } return ret; } }; int main(){ ll N; int K; cin >> N >> K; combination<mint> c(K); cout << c.second_stirling_number(N, K) << endl; }