#920186 (C++17) No.1073 無限すごろく

提出ソース

結果

問題	No.1073 無限すごろく
ユーザー	ゆにぽけ
提出日時	2023-10-14 17:23:24
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	5,522 bytes
コンパイル時間	1,393 ms
コンパイル使用メモリ	136,652 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-16 11:37:26
合計ジャッジ時間	2,509 ms
ジャッジサーバーID （参考情報）	judge6 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	1 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	1 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	1 ms 6,940 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,944 KB
testcase_32	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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> struct mat
{
    private:
    vector<vector<T>> m;
    int h,w;

    public:
    constexpr mat(int _h,int _w,T x = 0) noexcept {m.assign(_h,vector<T>(_w,x));h = _h,w = _w;}

    constexpr vector<T> operator[](const int i) const {assert(0 <= i && i < h); return m[i];}

    constexpr vector<T> &operator[](const int i) noexcept {assert(0 <= i && i < h); return m[i];}

    constexpr mat operator+(mat &other) noexcept
    {
        mat tmp = *this;
        return tmp += other;
    }

    constexpr mat operator-(mat &other) noexcept
    {
        mat tmp = *this;
        return tmp -= other;
    }

    constexpr mat operator*(mat &other) noexcept
    {
        mat tmp = *this;
        return tmp *= other;
    }

    constexpr mat &operator+=(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);

        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) m[i][j] += other[i][j];

        return *this;
    }

    constexpr mat &operator-=(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);

        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) m[i][j] -= other[i][j];

        return *this;
    }

    constexpr mat &operator*=(mat &other) noexcept
    {
        assert(w == other.h);
        mat tmp(h,other.w);
        for(int i = 0;i < h;i++)for(int j = 0;j < other.w;j++)for(int k = 0;k < w;k++) tmp[i][j] += m[i][k]*other[k][j];

        for(int i = 0;i < h;i++)
        {
            m[i].resize(other.w);
            for(int j = 0;j < other.w;j++) m[i][j] = tmp[i][j];
        }

        return *this;
    }

    constexpr mat power(long n) noexcept
    {
        assert(h == w);
        assert(n >= 0);
        mat res(h,w);
        for(int i = 0;i < h;i++) res[i][i] = 1;

        mat p = *this;
        long ex = n;

        while(ex)
        {
            if(ex & 1) res *= p;
            p *= p;
            ex >>= 1;
        }

        return res;
    }

    constexpr bool operator==(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);
        bool res = true;
        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) if(m[i][j] != other[i][j]) res = false;

        return res;
    }

    constexpr bool operator!=(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);
        bool res = false;
        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) if(m[i][j] != other[i][j]) res = true;

        return res;
    }

    template<class S> friend ostream &operator<<(ostream &os,const mat<S> &x);
};

template<class S> ostream &operator<<(ostream &os,const mat<S> &x)
{
    for(int i = 0;i < x.h;i++)for(int j = 0;j < x.w;j++)
    {
        os << x[i][j] << (j+1 == x.w && i+1 < x.h ? "\n":" ");
        return os;
    }
}

void solve()
{
	long long N;
	cin >> N;
	mat<mint> M(6,6);
	for(int i = 0;i < 6;i++) M[0][i] = mint(6).inverse();
	for(int i = 1;i < 6;i++) M[i][i-1] = 1;
	mat<mint> S(6,1);
	S[0][0] = 1;
	mat<mint> MS = M.power(N) * S;
	cout << MS[0][0] << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}

yukicoder

結果

テストケース

ソースコード