結果

問題 No.1967 Sugoroku Optimization
ユーザー milanis48663220milanis48663220
提出日時 2022-06-03 21:54:40
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 80 ms / 2,000 ms
コード長 4,412 bytes
コンパイル時間 1,098 ms
コンパイル使用メモリ 120,812 KB
最終ジャッジ日時 2025-01-29 17:40:39
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
typedef long long ll;
template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
return vector<vector<T>>(n, vector<T>(m, v));
}
template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}
template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
if(v.empty()) {
cout << endl;
return;
}
for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
cout << v.back() << endl;
}
const ll MOD = 998244353;
class ModInt{
public:
ll v;
ModInt(ll _v = 0){
if(_v < 0) _v = (_v%MOD)+MOD;
if(_v >= MOD) _v %= MOD;
v = _v;
}
ModInt operator+(ll n){
return ModInt((v+n)%MOD);
}
ModInt operator-(ll n){
return ModInt((v-n+MOD)%MOD);
}
ModInt operator*(ll n){
if(n >= MOD) n %= MOD;
return ModInt((v*n)%MOD);
}
ModInt operator/(ll n){
return ModInt((ModInt(n).inv()*v).v%MOD);
}
ModInt &operator+=(ll n){
v = (v+n)%MOD;
return *this;
}
ModInt &operator-=(ll n){
v = (v-n+MOD)%MOD;
return *this;
}
ModInt &operator*=(ll n){
v = (v*n+MOD)%MOD;
return *this;
}
ModInt operator+(ModInt n){
return ModInt((v+n.v)%MOD);
}
ModInt operator-(ModInt n){
return ModInt((v-n.v+MOD)%MOD);
}
ModInt operator*(ModInt n){
return ModInt((v*n.v)%MOD);
}
ModInt operator/(ModInt n){
return ModInt((n.inv()*v).v%MOD);
}
ModInt &operator+=(ModInt n){
v = (v+n.v)%MOD;
return *this;
}
ModInt &operator-=(ModInt n){
v = (v-n.v+MOD)%MOD;
return *this;
}
ModInt &operator*=(ModInt n){
v = (v*n.v)%MOD;
return *this;
}
bool operator==(ModInt n){
return v == n.v;
}
bool operator!=(ModInt n){
return v != n.v;
}
ModInt &operator=(ll n){
v = n%MOD;
return *this;
}
ModInt inv(){
if(v == 1) return ModInt(1);
else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);
}
};
ostream& operator<<(ostream& os, const ModInt& m){
os << m.v;
return os;
}
istream & operator >> (istream &in, ModInt &m){
in >> m.v;
return in;
}
ModInt pow(ModInt a, ll n) {
assert(n >= 0);
ModInt ans = 1;
while (n > 0) {
if (n&1) ans = ans*a;
a = a*a;
n >>= 1;
}
return ans;
}
using mint = ModInt;
#define N_MAX 200002
ModInt inv[N_MAX],fac[N_MAX],finv[N_MAX];
void init(){
fac[0]=1;fac[1]=1;
finv[0]=1;finv[1]=1;
inv[1]=1;
for(int i=2;i<N_MAX;i++){
inv[i]=ModInt(MOD)-inv[MOD%i]*(MOD/i);
fac[i]=fac[i-1]*(ll) i;
finv[i]=finv[i-1]*inv[i];
}
}
template<typename T>
class Cumsum{
public:
Cumsum(vector<T> v): v(v){
n = v.size();
v_cumsum = vector<T>(n+1, T(0));
for(int i = 0; i < n; i++) v_cumsum[i+1] = v_cumsum[i]+v[i];
}
/**
* v[l] + ... + v[r-1]
*/
T sum(int l, int r){
if(r <= l) return T(0);
if(r > n) r = n;
if(l < 0) l = 0;
return v_cumsum[r]-v_cumsum[l];
}
private:
int n;
vector<T> v;
vector<T> v_cumsum;
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
init();
int n, k; cin >> n >> k;
auto dp = vec2d(k+1, n+1, mint(0));
dp[0][0] = 1;
for(int i = 1; i <= k; i++){
dp[i][0] = 1;
auto cumsum = Cumsum<mint>(dp[i-1]);
for(int j = 1; j <= n; j++){
dp[i][j] = cumsum.sum(0, j)*inv[j];
}
}
cout << dp[k][n] << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0