#383682 (C++14) No.891 隣接3項間の漸化式

提出ソース

結果

問題	No.891 隣接3項間の漸化式
ユーザー	Laika
提出日時	2019-09-27 14:51:35
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	5,562 bytes
コンパイル時間	1,728 ms
コンパイル使用メモリ	175,772 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-24 06:54:49
合計ジャッジ時間	2,755 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	1 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	1 ms 6,940 KB
testcase_18	AC	1 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	1 ms 6,940 KB
testcase_22	AC	2 ms 6,944 KB
testcase_23	AC	2 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,944 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,944 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,944 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	2 ms 6,940 KB
testcase_36	AC	2 ms 6,944 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	2 ms 6,944 KB
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	2 ms 6,944 KB
testcase_41	AC	1 ms 6,940 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
#define ppp(a) (cout << (a) << endl);
#define cop(a) for(auto x:(a)){cout << x << endl;}


using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9+7;
const int INF = 1e9;
const ll LINF = 1e18;

ll mod(ll a, ll b){return (a%b+b)%b;}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void Judge(bool b){b?Yes():No();}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void JUDGE(bool b){b?YES():NO();}
ll powmod(ll b, ll e){ll r=1;while(e>0){if(e&1)r=(r%MOD)*(b%MOD)%MOD;b=(b%MOD)*(b%MOD)%MOD;e>>=1;}return r;}
double distance(ll x1, ll y1, ll x2, ll y2){return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));}

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
    int len = v.size();
    s << '[';
    for (int i = 0; i < len; ++i) {
        s << v[i]; if (i < len-1) s << ", ";
    }
    s << ']';
    return s;
}

struct aaa{
    aaa(){
        // comment this out when you use scanf or printf
        // cin.tie(0); ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(15);
    };
}fastio;



template<class T>
struct Matrix{
    vector<vector<T>> A;
    Matrix(){}
    Matrix(size_t n, size_t m): A(n, vector<T>(m, 0)) {}
    Matrix(size_t n): A(n, vector<T>(n, 0)) {}
    size_t height() const{
        return A.size();
    }
    size_t 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(size_t n){
        Matrix mat(n);
        for(size_t i = 0; i < n; ++i) mat[i][i] = 1;
        return mat;
    }

    Matrix &operator%=(const long long k){
        size_t n = height(), m = width();
        for(size_t i = 0; i < n; ++i){
            for(size_t j = 0; j < m; ++j){
                (*this)[i][j] %= k;
            }
        }
        return *this;
    }

    Matrix &operator+=(const Matrix &B){
        size_t n = height(), m = width();
        assert(n == B.height() and m == B.width());
        for(size_t i = 0; i < n; ++i){
            for(size_t j = 0; j < m; ++j){
                (*this)[i][j] += B[i][j];
            }
        }
        return *this;
    }

    Matrix &operator-=(const Matrix &B){
        size_t n = height(), m = width();
        assert(n == B.height() and m == B.width());
        for(size_t i = 0; i < n; ++i){
            for(size_t j = 0; j < m; ++j){
                (*this)[i][j] -= B[i][j];
            }
        }
        return *this;
    }


    Matrix &operator*=(const Matrix &B){
        size_t n = height(), m = B.width(), p = width();
        assert(p == B.height());
        vector<vector<T>> C(n, vector<T>(m, 0));
        for(size_t i = 0; i < n; ++i){
            for(size_t j = 0; j < m; ++j){
                for(size_t k = 0; k < p; ++k){
                    C[i][j] = (C[i][j] + (*this)[i][k]*B[k][j]);
                }
            }
        }
        A.swap(C);
        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);
    }


    friend ostream &operator<<(ostream &os, Matrix p) {
        size_t n = p.height(), m = p.width();
        for(size_t i = 0; i < n; i++) {
            os << "[";
            for(size_t j = 0; j < m; j++) {
                os << p[i][j] << (j+1 == m ? "]\n" : ",");
            }
        }
        return os;
    }

    Matrix pow(long long k, long long mod){
        Matrix B = Matrix::I(height());
        while(k){
            if(k&1) (B *= *this) %= mod;
            (*this *= *this) %= mod;
            k >>= 1LL;
        }
        return B;
    }

    T determinant() {
        Matrix B(*this);
        assert(width() == height());
        T ret = 1;
        for(size_t i = 0; i < width(); i++) {
            int idx = -1;
            for(size_t j = i; j < width(); j++) {
                if(B[j][i] != 0) idx = j;
            }
            if(idx == -1) return (0);
            if(i != idx) {
                ret *= -1;
                swap(B[i], B[idx]);
            }
            ret *= B[i][i];
            T vv = B[i][i];
            for(size_t j = 0; j < width(); j++) {
                B[i][j] /= vv;
            }
            for(size_t j = i + 1; j < width(); j++) {
                T a = B[j][i];
                for(int k = 0; k < width(); k++) {
                    B[j][k] -= B[i][k] * a;
                }
            }
        }
        return ret;
    }
};
int main(){

    int a, b, n;
    scanf("%d%d%d", &a, &b, &n);
    Matrix<ll> mat(2);
    mat[0][0] = a;
    mat[0][1] = b;
    mat[1][0] = 1;
    cout << mat.pow(n, MOD)[1][0] << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード