結果
問題 | No.1035 Color Box |
ユーザー |
![]() |
提出日時 | 2020-04-24 21:51:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 4,657 bytes |
コンパイル時間 | 1,482 ms |
コンパイル使用メモリ | 171,524 KB |
実行使用メモリ | 8,064 KB |
最終ジャッジ日時 | 2024-10-15 02:43:48 |
合計ジャッジ時間 | 2,759 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#pragma region Macros#include <bits/stdc++.h>using namespace std;//#include <boost/multiprecision/cpp_int.hpp>//using multiInt = boost::multiprecision::cpp_int;using ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename Q_type>using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;constexpr int MOD_TYPE = 1;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9;constexpr ll LINF = (ll)4e18;constexpr ld PI = acos(-1.0);constexpr ld EPS = 1e-11;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";#pragma endregiontemplate <int MOD>struct Fp{long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD){if (val < 0)v += MOD;}constexpr int getmod(){return MOD;}constexpr Fp operator-() const noexcept{return val ? MOD - val : 0;}constexpr Fp operator+(const Fp &r) const noexcept{return Fp(*this) += r;}constexpr Fp operator-(const Fp &r) const noexcept{return Fp(*this) -= r;}constexpr Fp operator*(const Fp &r) const noexcept{return Fp(*this) *= r;}constexpr Fp operator/(const Fp &r) const noexcept{return Fp(*this) /= r;}constexpr Fp &operator+=(const Fp &r) noexcept{val += r.val;if (val >= MOD)val -= MOD;return *this;}constexpr Fp &operator-=(const Fp &r) noexcept{val -= r.val;if (val < 0)val += MOD;return *this;}constexpr Fp &operator*=(const Fp &r) noexcept{val = val * r.val % MOD;return *this;}constexpr Fp &operator/=(const Fp &r) noexcept{long long a = r.val, b = MOD, u = 1, v = 0;while (b){long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}val = val * u % MOD;if (val < 0)val += MOD;return *this;}constexpr bool operator==(const Fp &r) const noexcept{return this->val == r.val;}constexpr bool operator!=(const Fp &r) const noexcept{return this->val != r.val;}friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept{return os << x.val;}friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept{return is >> x.val;}};Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept{if (n == 0)return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1)t = t * a;return t;}using mint = Fp<MOD>;template <class T>struct BiCoef{vector<T> fact_, inv_, finv_;constexpr BiCoef(){}constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1){init(n);}constexpr void init(int n) noexcept{fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);int MOD = fact_[0].getmod();for (int i = 2; i < n; i++){fact_[i] = fact_[i - 1] * i;inv_[i] = -inv_[MOD % i] * (MOD / i);finv_[i] = finv_[i - 1] * inv_[i];}}constexpr T C(int n, int k) const noexcept{if (n < k || n < 0 || k < 0)return 0;return fact_[n] * finv_[k] * finv_[n - k];}constexpr T P(int n, int k) const noexcept{return C(n, k) * fact_[k];}constexpr T H(int n, int k) const noexcept{return C(n + k - 1, k);}constexpr T fact(int n) const noexcept{if (n < 0)return 0;return fact_[n];}constexpr T inv(int n) const noexcept{if (n < 0)return 0;return inv_[n];}constexpr T finv(int n) const noexcept{if (n < 0)return 0;return finv_[n];}};BiCoef<mint> bc(200010);void solve(){ll n, m;cin >> n >> m;mint ans = 0;for (ll i = 1; i <= m; i++){ans = modpow(i, n) * bc.C(m, i) - ans;}cout << ans << endl;}int main(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);solve();return 0;}