結果
問題 |
No.3228 Very Large Fibonacci Sum
|
ユーザー |
|
提出日時 | 2025-08-08 21:51:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,093 bytes |
コンパイル時間 | 3,828 ms |
コンパイル使用メモリ | 255,736 KB |
実行使用メモリ | 7,716 KB |
最終ジャッジ日時 | 2025-08-08 21:51:19 |
合計ジャッジ時間 | 4,425 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using mint = atcoder::modint1000000007; using ll = long long; template <class T, size_t N> struct Matrix { std::array<std::array<T, N>, N> A{}; Matrix() {} Matrix(const std::array<std::array<T, N>, N> &M) : A(M){} Matrix(const std::vector<std::vector<T>> &M) { for(size_t i = 0; i < N; i++){ for(size_t j = 0; j < N; j++){ A[i][j] = M[i][j]; } } } const std::array<T, N>& operator[](int i) const { return A[i]; } std::array<T, N>& operator[](int i) { return A[i]; } Matrix& operator+=(const Matrix& rhs) { for(size_t i = 0; i < N; i++){ for(size_t j = 0; j < N; j++){ A[i][j] += rhs[i][j]; } } return *this; } Matrix& operator-=(const Matrix& rhs) { for(size_t i = 0; i < N; i++){ for(size_t j = 0; j < N; j++){ A[i][j] -= rhs[i][j]; } } return *this; } Matrix& operator*=(const Matrix& rhs) { std::array<std::array<T, N>, N> res{}; for(size_t i = 0; i < N; i++){ for(size_t j = 0; j < N; j++){ for(size_t k = 0; k < N; k++){ res[i][j] += A[i][k] * rhs[k][j]; } } } swap(A, res); return *this; } Matrix& operator+() const { return *this; } Matrix& operator-() const { return Matrix() - *this; } friend Matrix operator+(const Matrix& lhs, const Matrix& rhs) { return Matrix(lhs) += rhs; } friend Matrix operator-(const Matrix& lhs, const Matrix& rhs) { return Matrix(lhs) -= rhs; } friend Matrix operator*(const Matrix& lhs, const Matrix& rhs) { return Matrix(lhs) *= rhs; } friend bool operator==(const Matrix& lhs, const Matrix& rhs) { return (lhs.A == rhs.A); } friend bool operator!=(const Matrix& lhs, const Matrix& rhs) { return (lhs.A != rhs.A); } Matrix pow(long long v){ Matrix res, temp = A; for(size_t i = 0; i < N; i++)res[i][i] = 1; while(v){ if(v & 1)res *= temp; temp *= temp; v >>= 1; } return res; } friend std::ostream& operator << (std::ostream &os, const Matrix& rhs) noexcept { for(size_t i = 0; i < N; i++){ if(i) os << '\n'; for(size_t j = 0; j < N; j++){ os << (j ? " " : "") << rhs[i][j]; } } return os; } }; int main(){ ios::sync_with_stdio(false); cin.tie(0); int a, b, c, d, e; ll n; cin >> a >> b >> c >> d >> e >> n; Matrix<mint, 4> Mt; // [0] <= c * [0] + d * [1] + e * [2] // [1] <= [0] // [2] <= [2] // [3] <= [3] + [1] Mt[0][0] = c; Mt[1][0] = d; Mt[2][0] = e; Mt[0][1] = 1; Mt[2][2] = 1; Mt[3][3] = 1; Mt[1][3] = 1; auto B = Mt.pow(n + 1); cout << (b * B[0][3] + a * B[1][3] + B[2][3]).val() << '\n'; }