結果
問題 | No.1100 Boxes |
ユーザー | tokusakurai |
提出日時 | 2020-06-27 11:39:33 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 3,301 bytes |
コンパイル時間 | 1,390 ms |
コンパイル使用メモリ | 166,616 KB |
実行使用メモリ | 19,256 KB |
最終ジャッジ日時 | 2023-09-18 19:15:51 |
合計ジャッジ時間 | 3,617 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
18,980 KB |
testcase_01 | AC | 16 ms
19,156 KB |
testcase_02 | AC | 16 ms
18,960 KB |
testcase_03 | AC | 16 ms
19,092 KB |
testcase_04 | AC | 16 ms
19,092 KB |
testcase_05 | AC | 16 ms
18,968 KB |
testcase_06 | AC | 16 ms
19,096 KB |
testcase_07 | AC | 16 ms
18,968 KB |
testcase_08 | AC | 16 ms
19,132 KB |
testcase_09 | AC | 16 ms
18,976 KB |
testcase_10 | AC | 16 ms
19,096 KB |
testcase_11 | AC | 16 ms
18,988 KB |
testcase_12 | AC | 16 ms
19,044 KB |
testcase_13 | AC | 16 ms
19,024 KB |
testcase_14 | AC | 16 ms
19,092 KB |
testcase_15 | AC | 16 ms
19,148 KB |
testcase_16 | AC | 16 ms
19,028 KB |
testcase_17 | AC | 16 ms
19,256 KB |
testcase_18 | AC | 16 ms
19,036 KB |
testcase_19 | AC | 17 ms
19,032 KB |
testcase_20 | AC | 16 ms
18,964 KB |
testcase_21 | AC | 20 ms
19,036 KB |
testcase_22 | AC | 27 ms
19,108 KB |
testcase_23 | AC | 22 ms
19,128 KB |
testcase_24 | AC | 23 ms
18,956 KB |
testcase_25 | AC | 24 ms
18,968 KB |
testcase_26 | AC | 32 ms
18,964 KB |
testcase_27 | AC | 28 ms
19,032 KB |
testcase_28 | AC | 19 ms
18,964 KB |
testcase_29 | AC | 30 ms
19,128 KB |
testcase_30 | AC | 28 ms
18,960 KB |
testcase_31 | AC | 22 ms
18,980 KB |
testcase_32 | AC | 27 ms
18,956 KB |
testcase_33 | AC | 34 ms
19,108 KB |
testcase_34 | AC | 34 ms
18,960 KB |
testcase_35 | AC | 16 ms
18,956 KB |
testcase_36 | AC | 25 ms
18,956 KB |
testcase_37 | AC | 16 ms
19,092 KB |
testcase_38 | AC | 23 ms
18,976 KB |
testcase_39 | AC | 32 ms
19,032 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 ld = long double; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; //const ll MOD = 1e9+7; const ll MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const ld 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 pow (ll n) const { Mod_Int now = *this, ret = 1; while(n > 0){ if(n & 1) ret *= now; now *= now, n >>= 1; } return ret; } Mod_Int inverse () const { return pow(mod-2); } 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>; const int MAX_N = 1e6; mint fac[MAX_N+1], ifac[MAX_N+1]; void init(){ fac[0] = 1; rep2(i, 1, MAX_N){ fac[i] = fac[i-1]*i; } ifac[MAX_N] = fac[MAX_N].inverse(); rep3(i, MAX_N, 1){ ifac[i-1] = ifac[i]*i; } } mint comb(int n, int k){ return fac[n]*ifac[n-k]*ifac[k]; } mint perm(int n, int k){ return fac[n]*ifac[n-k]; } int main(){ int N, K; cin >> N >> K; mint ans = 0; init(); rep2(i, 1, K){ ans += comb(K, i)*mint(K-i).pow(N)*mint(-2).pow(i-1); } cout << ans << endl; }