結果

問題 No.658 テトラナッチ数列 Hard
コンテスト
ユーザー mugen_1337
提出日時 2020-07-19 23:43:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 420 ms / 2,000 ms
コード長 5,119 bytes
コンパイル時間 2,238 ms
コンパイル使用メモリ 204,812 KB
最終ジャッジ日時 2025-01-12 01:04:02
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==v.size()?"":" ");
    return os;
}

template<ll Mod>
struct ModInt{
    long long x;
    ModInt():x(0){}
    ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}
    ModInt &operator+=(const ModInt &p){
        if((x+=p.x)>=Mod) x-=Mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x+=Mod-p.x)>=Mod)x-=Mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x=(int)(1ll*x*p.x%Mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        (*this)*=p.inverse();
        return *this;
    }
    ModInt operator-()const{return ModInt(x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
    ModInt operator==(const ModInt &p)const{return x==p.x;}
    ModInt operator!=(const ModInt &p)const{return x!=p.x;}
    ModInt inverse()const{
        int a=x,b=Mod,u=1,v=0,t;
        while(b>0){
            t=a/b;
            swap(a-=t*b,b);swap(u-=t*v,v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n)const{
        ModInt ret(1),mul(x);
        while(n>0){
            if(n&1) ret*=mul;
            mul*=mul;n>>=1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
    friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
    static int get_mod(){return Mod;}
};
using mint=ModInt<17>;

template<class T>
struct Matrix{
    vector<vector<T>> A;
    Matrix(){}
    Matrix(int n,int m):A(n,vector<T>(m,T(0))){}
    Matrix(int n):A(n,vector<T>(n,T(0))){}
    int height()const{return (A.size());}
    int width()const{return (A[0].size());}
    inline const vector<T> &operator[](int k)const{return (A.at(k));}
    inline vector<T> &operator[](int k){return (A.at(k));}
    static Matrix I(int n){
        Matrix mat(n);
        for(int i=0;i<n;i++)mat[i][i]=1;
        return (mat);
    }
    Matrix &operator+=(const Matrix &B){
        int n=height(),m=width();
        assert(n==B.height() and m==B.width());
        for(int i=0;i<n;i++)for(int j=0;j<m;j++)(*this)[i][j]+=B[i][j];
        return (*this);
    }
    Matrix &operator-=(const Matrix &B){
        int n=height(),m=width();
        assert(n==B.height() and m==B.width());
        for(int i=0;i<n;i++)for(int j=0;j<m;j++)(*this)[i][j]-=B[i][j];
        return (*this);
    }
    Matrix &operator*=(const Matrix &B){
        int n=height(),m=B.width(),p=width();
        assert(p==B.height());
        vector<vector<T>> C(height(),vector<T>(B.width(),T(0)));
        for(int i=0;i<n;i++)for(int j=0;j<m;j++)for(int k=0;k<p;k++)
        C[i][j]=(C[i][j]+(*this)[i][k]*B[k][j]);
        swap(A,C);
        return (*this);
    }
    Matrix &operator^=(ll k){
        Matrix res=Matrix::I(height());
        while(k>0){
            if(k&1) res*=(*this);
            (*this)*=(*this);
            k>>=1ll;
        }
        A.swap(res.A);
        return (*this);
    }
    Matrix operator+(const Matrix &B)const{return (Matrix(*this)+=B);}
    Matrix operator-(const Matrix &B)const{return (Matrix(*this)-=B);}
    Matrix operator*(const Matrix &B)const{return (Matrix(*this)*=B);}
    Matrix operator^(const long long k)const{return (Matrix(*this)^=k);}
    friend ostream &operator<<(ostream &os,Matrix &p){
        for(int i=0;i<p.height();i++){
            os<<"[";
            for(int j=0;j<p.width();j++) os<<p[i][j]<<(j+1==p.width()?"]\n":" ");
        }
        return os;
    }
};

signed main(){
    Matrix<mint> base(4);
    base[0][0]=1;base[0][1]=1;base[0][2]=1;base[0][3]=1;
    base[1][0]=1;
                 base[2][1]=1;
                              base[3][2]=1;
    Matrix<mint> a0(4,1);
    a0[0][0]=1;

    int q;cin>>q;
    for(;q--;){
        ll n;cin>>n;
        if(n<4){
            cout<<0<<endl;
            continue;
        }
        auto b=base;
        b^=n-4;
        auto res=b*a0;
        cout<<res[0][0]<<endl;
    }
    return 0;
}
0