結果
問題 | No.1073 無限すごろく |
ユーザー |
![]() |
提出日時 | 2020-06-05 21:42:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 4,945 bytes |
コンパイル時間 | 2,545 ms |
コンパイル使用メモリ | 202,500 KB |
最終ジャッジ日時 | 2025-01-10 22:24:11 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>#define fi first#define se second#define rep(i,n) for(int i = 0; i < (n); ++i)#define rrep(i,n) for(int i = 1; i <= (n); ++i)#define drep(i,n) for(int i = (n)-1; i >= 0; --i)#define srep(i,s,t) for (int i = s; i < t; ++i)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define maxs(x,y) (x = max(x,y))#define mins(x,y) (x = min(x,y))#define isin(x,l,r) ((l) <= (x) && (x) < (r))#define pb push_back#define eb emplace_back#define sz(x) (int)(x).size()#define pcnt __builtin_popcountll#define uni(x) x.erase(unique(rng(x)),x.end())#define snuke srand((unsigned)clock()+(unsigned)time(NULL));#define show(x) cout<<#x<<" = "<<x<<endl;#define PQ(T) priority_queue<T,v(T),greater<T> >#define bn(x) ((1<<x)-1)#define dup(x,y) (((x)+(y)-1)/(y))#define newline puts("")#define v(T) vector<T>#define vv(T) v(v(T))using namespace std;typedef long long int ll;typedef unsigned uint;typedef unsigned long long ull;typedef pair<int,int> P;typedef tuple<int,int,int> T;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<ll> vl;typedef vector<P> vp;typedef vector<T> vt;inline int getInt() { int x; scanf("%d",&x); return x;}template<typename T>inline istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#define dame { puts("-1"); return 0;}#define yn {puts("Yes");}else{puts("No");}const int MX = 200005;// Mod intconst int mod = 1000000007;// const int mod = 998244353;struct mint {ll x;mint():x(0){}mint(ll x):x((x%mod+mod)%mod){}// mint(ll x):x(x){}mint& fix() { x = (x%mod+mod)%mod; return *this;}mint operator-() const { return mint(0) - *this;}mint operator~() const { return mint(1) / *this;}mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}mint& operator/=(const mint& a){ (x*=a.pow(mod-2).x)%=mod; return *this;}mint operator+(const mint& a)const{ return mint(*this) += a;}mint operator-(const mint& a)const{ return mint(*this) -= a;}mint operator*(const mint& a)const{ return mint(*this) *= a;}mint operator/(const mint& a)const{ return mint(*this) /= a;}mint pow(ll t) const {if(!t) return 1;mint res = pow(t/2);res *= res;return (t&1)?res*x:res;}bool operator<(const mint& a)const{ return x < a.x;}bool operator==(const mint& a)const{ return x == a.x;}};mint ex(mint x, ll t) { return x.pow(t);}istream& operator>>(istream&i,mint&a){i>>a.x;return i;}ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}typedef vector<mint> vm;struct comb {vm f, g;comb(){}comb(int mx):f(mx+1),g(mx+1) {f[0] = 1;rrep(i,mx) f[i] = f[i-1]*i;g[mx] = f[mx].pow(mod-2);for(int i=mx;i>0;i--) g[i-1] = g[i]*i;}mint operator()(int a, int b) {if (a < b) return 0;return f[a]*g[b]*g[a-b];}};//// Matrixstruct mat {typedef mint TT;int h, w;vv(TT) d;mat(){}mat(int h, int w, TT v=0):h(h),w(w),d(h,vector<TT>(w,v)){}v(TT)& operator[] (int i) { return d[i];}const v(TT)& operator[] (int i) const { return d[i];}void fil(TT v=0) { rep(i,h)rep(j,w) d[i][j] = v;}void unit() { rep(i,h)rep(j,w) d[i][j] = (i==j);}mat operator+(const mat& a) const { // same sizemat res(h,w);rep(i,h)rep(j,w) res[i][j] = d[i][j]+a[i][j];return res;}mat operator-(const mat& a) const { // same sizemat res(h,w);rep(i,h)rep(j,w) res[i][j] = d[i][j]-a[i][j];return res;}mat operator*(const mat& a) const { // w = a.hmat res(h,a.w);rep(i,h)rep(k,w)rep(j,a.w) res[i][j] += d[i][k]*a[k][j];return res;}mat power(ll a) { // h = wif (a == 0) {mat res(h,w); res.unit();return res;}mat res = power(a/2);res = res*res;if (a&1) res = res*(*this);return res;}void pri() {rep(i,h) {cout << "|";rep(j,w) cout << " " << d[i][j];cout << " |" << endl;}cout<<endl;}};//int main() {ll n;cin>>n;mat d(6,6);rep(i,6) d[0][i] = mint(1)/6;rrep(i,5) d[i][i-1] = 1;d = d.power(n);mint ans = d[0][0];cout<<ans<<endl;return 0;}