結果

問題 No.1967 Sugoroku Optimization
ユーザー ゆにぽけゆにぽけ
提出日時 2023-10-09 08:25:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 655 ms / 2,000 ms
コード長 4,344 bytes
コンパイル時間 1,312 ms
コンパイル使用メモリ 128,296 KB
実行使用メモリ 35,304 KB
最終ジャッジ日時 2023-10-09 08:25:49
合計ジャッジ時間 7,849 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 655 ms
35,304 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 529 ms
31,980 KB
testcase_06 AC 599 ms
34,104 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 444 ms
26,560 KB
testcase_09 AC 291 ms
19,332 KB
testcase_10 AC 120 ms
16,012 KB
testcase_11 AC 11 ms
4,480 KB
testcase_12 AC 360 ms
22,976 KB
testcase_13 AC 152 ms
13,356 KB
testcase_14 AC 7 ms
4,376 KB
testcase_15 AC 7 ms
4,376 KB
testcase_16 AC 11 ms
4,872 KB
testcase_17 AC 12 ms
4,576 KB
testcase_18 AC 2 ms
4,376 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 611 ms
35,276 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 637 ms
35,304 KB
testcase_23 AC 384 ms
22,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
//using mint = modint<1000000007>;
template<class T,T (*op)(T,T),T (*e)()> struct SegmentTree
{
    private:
    int siz;
    vector<T> node;

    public:
    SegmentTree(int n = 0) noexcept
    {
        siz = 1;
        while(siz < n) siz <<= 1;

        node.assign(2*siz-1,e());
    }

    void replace(int pos,T x) noexcept {func_update(pos,x,[](T u,T v){return u = v;});}

    void add(int pos,T x) noexcept {func_update(pos,x,[](T u,T v){return u+v;});}

    void func_update(int pos,T x) noexcept {func_update(pos,x,op);}
    
    void func_update(int pos,T x,T (*func)(T,T)) noexcept
    {
        assert(0 <= pos && pos < siz);
        pos += siz - 1;

        node[pos] = func(node[pos],x);

        while(pos)
        {
            pos = (pos-1)/2;
            node[pos] = op(node[2*pos+1],node[2*pos+2]);
        }
    }

    T operator [](int pos) noexcept
    {
        assert(0 <= pos && pos < siz);
        return node[pos+siz-1];
    }

    T prod(int l,int r) noexcept
    {
        assert(0 <= l && l <= r && r <= siz);

        l += siz-1;
        r += siz-1;

        T Lval = e();
        T Rval = e();

        while(l < r)
        {
            if(!(l & 1)) Lval = op(Lval,node[l++]);
            if(!(r & 1)) Rval = op(node[--r],Rval);

            l >>= 1;
            r >>= 1;
        }

        return op(Lval,Rval);
    }

    T prod() noexcept {return node[0];}
};
mint op(mint a,mint b) {return a+b;}
mint e() {return 0;}
int N,K;
SegmentTree<mint,op,e> dp[2001];
void solve()
{
	cin >> N >> K;
	for(int i = 0;i <= K;i++) dp[i] = SegmentTree<mint,op,e>(N+1);
	dp[0].replace(N,1);
	for(int i = N;i--;)
	{
		mint p = mint(N-i).inverse();
		for(int j = 1;j <= K;j++)
		{
			mint ndp = dp[j-1].prod(i+1,N+1)*p;
			dp[j].replace(i,ndp);
		}
	}
	mint ans = 0;
	for(int i = 0;i <= K;i++) ans += dp[i][0];
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}
0