結果

問題 No.1073 無限すごろく
ユーザー akiaa11akiaa11
提出日時 2023-07-28 14:49:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 5,125 bytes
コンパイル時間 3,490 ms
コンパイル使用メモリ 258,524 KB
最終ジャッジ日時 2025-02-15 19:51:39
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

template<typename T>
class matrix{
	public:
		matrix(int h, int w, T c = 0) :
			_h(h), _w(w), _data(_h, std::vector<T>(_w, c)){}
		const std::vector<T>& operator[](int i) const{return _data[i];}
		std::vector<T>& operator[](int i) {return _data[i];}

		matrix operator*(const matrix& a) const{
			assert(_w == a.size());
			matrix res(_h, a[0].size());
			for(int i = 0 ; i < _h ; ++i){
				for(int k = 0 ; k < _w ; ++k){
					for(int j = 0 ; j < a[i].size() ; ++j){
						res[i][j] += _data[i][k] * a[k][j];
					}
				}
			}
			return res;
		}
		matrix operator+(const matrix& a) const{
			assert(_h == a.size());
			assert(_w == a[0].size());
			matrix res(_h, _w);
			for(int i = 0 ; i < _h ; ++i){
				for(int j = 0 ; j < _w ; ++j){
					res[i][j] += _data[i][j] + a[i][j];
				}
			}
			return res;
		}
		matrix& operator=(const matrix& a){
			assert(_h == a.size());
			assert(_w == a[0].size());
			for(int i = 0 ; i < _h ; ++i){
				for(int j = 0 ; j < _w ; ++j){
					_data[i][j] = a[i][j];
				}
			}
			return (*this);
		}

		matrix pow(long long t) const{
			matrix res(_h, _w);
			matrix temp = (*this);
			res.id();
			while(t){
				if(t & 1) res = res * temp;
				temp = temp * temp;
				t >>= 1;
			}
			return res;
		}

		void rotate_2d(int theta){
			rotate_2d(to_radian((theta + 360) % 360));
		}
		void rotate_2d(double radian){
			matrix temp(3, 3);
			temp[0][0] = cos(radian);
			temp[1][1] = cos(radian);
			temp[1][0] = sin(radian);
			temp[0][1] = -sin(radian);
			temp[2][2] = 1;
			(*this) = temp * (*this);
		}

		void line_symmetry_2d(T x, T y){
			matrix temp(3, 3);
			temp.id();
			if(x) temp[0][0] = -1;
			if(y) temp[1][1] = -1;
			temp[0][2] = 2 * x;
			temp[1][2] = 2 * y;
			(*this) = temp * (*this);
		}
	
		void id(int e = 1){
			for(int i = 0 ; i < _h ; ++i){
				_data[i].assign(_w, (T)0);
				_data[i][i] = (T)e;
			}
		}
		int size() const{return _h;}

	private:
		int _h;
		int _w;
		std::vector<std::vector<T>> _data;

		double to_radian(int theta){return (double)theta * M_PI / 180.0;}
};

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	ll n;cin>>n;
	matrix<mint10> t(6, 1), base(6, 6);
	t[0][0] = 1;
	rep(i, 6){
		base[i][0] = mint10(6).inv();
		if(i + 1 < 6) base[i][i + 1] = 1;
	}
	auto res = base.pow(n);
	auto ans = res * t;
	cout<<ans[0][0]<<endl;
}
0