結果
問題 | No.1100 Boxes |
ユーザー |
|
提出日時 | 2020-06-28 17:40:46 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 7,309 bytes |
コンパイル時間 | 1,740 ms |
コンパイル使用メモリ | 170,988 KB |
実行使用メモリ | 19,672 KB |
最終ジャッジ日時 | 2024-07-07 22:18:06 |
合計ジャッジ時間 | 3,433 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 36 |
コンパイルメッセージ
main.cpp:181:6: warning: literal operator suffixes not preceded by '_' are reserved for future standardization [-Wliteral-suffix] 181 | mint operator"" M(const ull n) { return mint(n); } | ^~~~~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;// Defineusing ll = long long;using ull = unsigned long long;using ld = long double;template <class T> using pvector = vector<pair<T, T>>;template <class T>using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;constexpr const ll dx[4] = {1, 0, -1, 0};constexpr const ll dy[4] = {0, 1, 0, -1};constexpr const ll MOD = 1e9 + 7;constexpr const ll mod = 998244353;constexpr const ll INF = 1LL << 60;constexpr const ll inf = 1 << 30;constexpr const char rt = '\n';constexpr const char sp = ' ';#define mp make_pair#define mt make_tuple#define pb push_back#define eb emplace_back#define elif else if#define fi first#define se secondtemplate <class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return 1;}return 0;}template <class T> bool chmin(T &a, const T &b) {if (a > b) {a = b;return 1;}return 0;}// Debug#define debug(...) \{ \cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \cerr << rt; \}#define dump(a, h, w) \{ \cerr << __LINE__ << ": " << #a << " = [" << rt; \rep(_i, h) { \rep(_j, w) { \if (a[_i][_j] <= -INF / 2) cerr << '-'; \if (abs(a[_i][_j]) >= INF / 2) \cerr << "∞" << sp; \else \cerr << a[_i][_j] << sp; \} \cerr << rt; \} \cerr << "]" << rt; \}#define vdump(a, n) \{ \cerr << __LINE__ << ": " << #a << " = ["; \rep(_i, n) { \if (_i) cerr << sp; \if (a[_i] <= -INF / 2) cerr << '-'; \if (abs(a[_i]) >= INF / 2) \cerr << "∞" << sp; \else \cerr << a[_i]; \} \cerr << "]" << rt; \}// Loop#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)#define each(i, a) for (auto &&i : a)// Stream#define fout(n) cout << fixed << setprecision(n)struct io {io() { cin.tie(nullptr), ios::sync_with_stdio(false); }} io;// Speed#pragma GCC optimize("Ofast,unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")// Mathinline constexpr ll gcd(const ll a, const ll b) {return b ? gcd(b, a % b) : a;}inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }inline constexpr ll modulo(const ll n, const ll m = MOD) {ll k = n % m;return k + m * (k < 0);}inline constexpr ll chmod(ll &n, const ll m = MOD) {n %= m;return n += m * (n < 0);}inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {ll r = 1;rep(i, 64) {if (n & (1LL << i)) r *= a;chmod(r, m);a *= a;chmod(a, m);}return r;}inline ll inv(const ll n, const ll m = MOD) {ll a = n, b = m, x = 1, y = 0;while (b) {ll t = a / b;a -= t * b;swap(a, b);x -= t * y;swap(x, y);}return modulo(x, m);}const ll mo = mod;struct mint {ll x;mint(ll x = 0) : x((x % mo + mo) % mo) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint &a) {if ((x += a.x) >= mo) x -= mo;return *this;}mint &operator-=(const mint &a) {if ((x += mo - a.x) >= mo) x -= mo;return *this;}mint &operator*=(const mint &a) {(x *= a.x) %= mo;return *this;}mint operator+(const mint &a) const { return mint(*this) += a; }mint operator-(const mint &a) const { return mint(*this) -= a; }mint operator*(const mint &a) const { return mint(*this) *= a; }bool operator==(const mint &a) const { return x == a.x; }bool operator!=(const mint &a) const { return x != a.x; }bool operator<=(const mint &a) { return x <= a.x; }bool operator<(const mint &a) { return x < a.x; }friend ll abs(const mint &a) { return a.x; }friend mint pow(const mint &a, ll n) {if (!n) return 1;mint b = pow(a, n >> 1);b *= b;if (n & 1) b *= a;return b;}mint inv() const { return pow(*this, mo - 2); }mint &operator/=(mint &a) { return (*this) *= a.inv(); }mint operator/(mint a) const { return mint(*this) /= a; }friend istream &operator>>(istream &is, mint &a) {ll t;is >> t;a = mint(t);return is;}friend ostream &operator<<(ostream &os, mint a) {os << a.x;return os;}};mint operator"" M(const ull n) { return mint(n); }struct modmath {vector<mint> fac, inv;modmath(ll n = 1 << 20) : fac(n + 1), inv(n + 1) {fac[0] = 1;rep(i, n) fac[i + 1] = fac[i] * (i + 1);inv[n] = fac[n].inv();dec(i, n - 1, 0) inv[i] = inv[i + 1] * (i + 1);}mint F(ll n) {if (n < 0) return 0;return fac[n];}mint P(ll n, ll r) {if (r < 0 || n < r || n < 0) return 0;return fac[n] * inv[n - r];}mint C(ll n, ll r) {if (r < 0 || n < r || n < 0) return 0;return fac[n] * inv[r] * inv[n - r];}mint c(ll n) {if (n < 0) return 0;return fac[2 * n] * inv[n] * inv[n + 1];}mint H(ll n, ll r) { return C(n + r - 1, n - 1); }} math;signed main() {ll N, K;cin >> N >> K;mint res = 0;inc(i, 1, K - 1) res +=math.C(K, i) * pow(mint(K - i), N) * pow(-2M, i - 1);cout << res << rt;}