結果
| 問題 | No.2130 分配方法の数え上げ mod 998244353 |
| ユーザー |
 k1suxu
|
| 提出日時 | 2022-11-25 21:57:28 |
| 言語 | C++23(draft) (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,857 bytes |
| コンパイル時間 | 4,573 ms |
| コンパイル使用メモリ | 291,012 KB |
| 最終ジャッジ日時 | 2024-04-10 03:09:30 |
| 合計ジャッジ時間 | 5,007 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52,
from main.cpp:5:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'constexpr std::_Vector_base<Modular_Int<998244353>, std::allocator<Modular_Int<998244353> > >::_Vector_impl::~_Vector_impl()':
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'constexpr std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = Modular_Int<998244353>]': target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/vector:66,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/functional:64,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:53:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_vector.h:133:14: note: called from here
133 | struct _Vector_impl
| ^~~~~~~~~~~~
ソースコード
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>
template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
#define int long long
template<int MOD>
struct Modular_Int {
int x;
Modular_Int() = default;
Modular_Int(int x_) : x(x_ >= 0? x_%MOD : (MOD-(-x_)%MOD)%MOD) {}
int val() const {
return (x%MOD+MOD)%MOD;
}
int get_mod() const {
return MOD;
}
Modular_Int<MOD>& operator^=(int d) {
Modular_Int<MOD> ret(1);
int nx = x;
while(d) {
if(d&1) ret *= nx;
(nx *= nx) %= MOD;
d >>= 1;
}
*this = ret;
return *this;
}
Modular_Int<MOD> operator^(int d) const {return Modular_Int<MOD>(*this) ^= d;}
Modular_Int<MOD> pow(int d) const {return Modular_Int<MOD>(*this) ^= d;}
//use this basically
Modular_Int<MOD> inv() const {
return Modular_Int<MOD>(*this) ^ (MOD-2);
}
//only if the module number is not prime
//Don't use. This is broken.
// Modular_Int<MOD> inv() const {
// int a = (x%MOD+MOD)%MOD, b = MOD, u = 1, v = 0;
// while(b) {
// int t = a/b;
// a -= t*b, swap(a, b);
// u -= t*v, swap(u, v);
// }
// return Modular_Int<MOD>(u);
// }
Modular_Int<MOD>& operator+=(const Modular_Int<MOD> other) {
if((x += other.x) >= MOD) x -= MOD;
return *this;
}
Modular_Int<MOD>& operator-=(const Modular_Int<MOD> other) {
if((x -= other.x) < 0) x += MOD;
return *this;
}
Modular_Int<MOD>& operator*=(const Modular_Int<MOD> other) {
int z = x;
z *= other.x;
z %= MOD;
x = z;
if(x < 0) x += MOD;
return *this;
}
Modular_Int<MOD>& operator/=(const Modular_Int<MOD> other) {
return *this = *this * other.inv();
}
Modular_Int<MOD>& operator++() {
x++;
if (x == MOD) x = 0;
return *this;
}
Modular_Int<MOD>& operator--() {
if (x == 0) x = MOD;
x--;
return *this;
}
Modular_Int<MOD> operator+(const Modular_Int<MOD> other) const {return Modular_Int<MOD>(*this) += other;}
Modular_Int<MOD> operator-(const Modular_Int<MOD> other) const {return Modular_Int<MOD>(*this) -= other;}
Modular_Int<MOD> operator*(const Modular_Int<MOD> other) const {return Modular_Int<MOD>(*this) *= other;}
Modular_Int<MOD> operator/(const Modular_Int<MOD> other) const {return Modular_Int<MOD>(*this) /= other;}
Modular_Int<MOD>& operator+=(const int other) {Modular_Int<MOD> other_(other); *this += other_; return *this;}
Modular_Int<MOD>& operator-=(const int other) {Modular_Int<MOD> other_(other); *this -= other_; return *this;}
Modular_Int<MOD>& operator*=(const int other) {Modular_Int<MOD> other_(other); *this *= other_; return *this;}
Modular_Int<MOD>& operator/=(const int other) {Modular_Int<MOD> other_(other); *this /= other_; return *this;}
Modular_Int<MOD> operator+(const int other) const {return Modular_Int<MOD>(*this) += other;}
Modular_Int<MOD> operator-(const int other) const {return Modular_Int<MOD>(*this) -= other;}
Modular_Int<MOD> operator*(const int other) const {return Modular_Int<MOD>(*this) *= other;}
Modular_Int<MOD> operator/(const int other) const {return Modular_Int<MOD>(*this) /= other;}
bool operator==(const Modular_Int<MOD> other) const {return (*this).val() == other.val();}
bool operator!=(const Modular_Int<MOD> other) const {return (*this).val() != other.val();}
bool operator==(const int other) const {return (*this).val() == other;}
bool operator!=(const int other) const {return (*this).val() != other;}
Modular_Int<MOD> operator-() const {return Modular_Int<MOD>(0LL)-Modular_Int<MOD>(*this);}
//入れ子にしたい
// friend constexpr istream& operator>>(istream& is, mint& x) noexcept {
// int X;
// is >> X;
// x = X;
// return is;
// }
// friend constexpr ostream& operator<<(ostream& os, mint& x) {
// os << x.val();
// return os;
// }
};
// const int MOD_VAL = 1e9+7;
const int MOD_VAL = 998244353;
using mint = Modular_Int<MOD_VAL>;
istream& operator>>(istream& is, mint& x) {
int X;
is >> X;
x = X;
return is;
}
ostream& operator<<(ostream& os, mint& x) {
os << x.val();
return os;
}
// istream& operator<<(istream& is, mint &a) {
// int x;
// is >> x;
// a = mint(x);
// return is;
// }
// ostream& operator<<(ostream& os, mint a) {
// os << a.val();
// return os;
// }
vector<mint> f = {1}, rf = {1};
void init(int n) {
f.resize(n, 0);
rf.resize(n, 0);
f[0] = 1;
repi(i, 1, n) f[i] = (f[i - 1] * i);
repi(i, 0, n) rf[i] = f[i].inv();
}
mint P(int n, int k) {
assert(n>=k);
while(n > f.size()-1) {
f.push_back(f.back() * f.size());
rf.push_back(f.back().inv());
}
return f[n] * f[n-k];
}
mint C(int n, int k) {
assert(n>=k);
while(n > f.size()-1) {
f.push_back(f.back() * f.size());
rf.push_back(f.back().inv());
}
return f[n]*rf[n-k]*rf[k];
}
mint H(int n, int k) {
assert(n>=1);
return C(n+k-1, k);
}
mint Cat(int n) {
return C(2*n, n)-C(2*n, n-1);
}
void solve() {
int n, m;
cin >> n >> m;
if(n < m) {
cout << 0 << endl;
return;
}
mint ans = (mint(2)^n) - 1;
mint mn = 1;
repi(i, 1, m) {
mn *= n-i+1;
mn /= i;
ans -= mn;
}
cout << ans.val() << endl;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}