結果

問題 No.3226 2×2行列累乗
ユーザー ooaiu
提出日時 2025-09-13 13:14:16
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 6,180 bytes
コンパイル時間 3,361 ms
コンパイル使用メモリ 289,756 KB
実行使用メモリ 7,716 KB
最終ジャッジ日時 2025-09-13 13:14:22
合計ジャッジ時間 4,979 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
using u64 = uint64_t;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcountll(x); }
inline ll floor_div(ll a, ll b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
inline ll ceil_div(ll a, ll b) noexcept { return floor_div(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
template <class T> void dedup(std::vector<T>& v) { std::sort(std::begin(v), std::end(v)), v.erase(std::unique(std::begin(v), std::end(v)), std::end(v)); }
template <class F> ll bisect(ll ok, ll ng, const F& f) { while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; }
template <class F> ld bisect_real(ld ok, ld ng, const F& f, int iter = 80) { while (iter--) { ld mid = (ok + ng) / 2.; (f(mid) ? ok : ng) = mid; } return ok; }
inline void SCAN() {}
template <class H, class... T> inline void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); }
#define INT(...) int __VA_ARGS__; SCAN(__VA_ARGS__)
#define LL(...) long long __VA_ARGS__; SCAN(__VA_ARGS__)
#define LD(...) long double __VA_ARGS__; SCAN(__VA_ARGS__)
#define STR(...) std::string __VA_ARGS__; SCAN(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; SCAN(__VA_ARGS__)
#define VEC(type, name, size) std::vector<type> name(size); for (int i = 0; i < (int)size; i++) SCAN(name[i]);
#define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); for (int i = 0; i < (int)h; i++) for (int j = 0; j < (int)w; j++) SCAN(name[i][j]);
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define len(x) (long long)(size(x))
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

template <class T>
struct Matrix : public std::vector<std::vector<T>> {
    Matrix() = default;
    Matrix(int h, int w, const T& v) : std::vector<std::vector<T>>(h, std::vector<T>(w, v)) {}
    Matrix(int h, int w) : Matrix(h, w, T{}) {}
    Matrix(const std::vector<std::vector<T>>& V) : std::vector<std::vector<T>>(V) {}
    Matrix(std::vector<std::vector<T>>&& V) : std::vector<std::vector<T>>(std::move(V)) {}
    static Matrix eye(int sz) {
        Matrix res(sz, sz);
        for (int i = 0; i < sz; i++) res[i][i] = 1;
        return res;
    }
    int height() const { return this->size(); }
    int width() const { return this->size() ? (*this)[0].size() : 0; }
    bool is_square() const { return height() == width(); }
    Matrix& operator+=(const Matrix& other) {
        assert(height() == other.height() && width() == other.width());
        for (int i = 0; i < height(); i++)
            for (int j = 0; j < width(); j++) {
                (*this)[i][j] += other[i][j];
            }
        return *this;
    }
    Matrix& operator-=(const Matrix& other) {
        assert(height() == other.height() && width() == other.width());
        for (int i = 0; i < height(); i++)
            for (int j = 0; j < width(); j++) {
                (*this)[i][j] -= other[i][j];
            }
        return *this;
    }
    Matrix& operator*=(const Matrix& other) {
        assert(width() == other.height());
        Matrix res(height(), other.width());
        for (int i = 0; i < height(); i++) {
            for (int k = 0; k < width(); k++) {
                for (int j = 0; j < other.width(); j++) {
                    res[i][j] += (*this)[i][k] * other[k][j];
                }
            }
        }
        return *this = std::move(res);
    }
    Matrix& operator*=(T s) {
        for (int i = 0; i < height(); i++) {
            for (int j = 0; j < width(); j++) {
                (*this)[i][j] *= s;
            }
        }
        return *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 Matrix operator*(const Matrix& lhs, T rhs) { return Matrix(lhs) *= rhs; }
    friend Matrix operator*(int lhs, const Matrix& rhs) { return Matrix(rhs) *= lhs; }
    Matrix pow(long long b) const {
        Matrix a = *this, res = eye(height());
        while (b) {
            if (b & 1) res *= a;
            a *= a;
            b >>= 1;
        }
        return res;
    }
    Matrix transpose() const {
        Matrix res(width(), height());
        for (int i = 0; i < height(); i++) {
            for (int j = 0; j < width(); j++) {
                res[j][i] = (*this)[i][j];
            }
        }
        return res;
    }
};

#include <atcoder/modint>
using mint = atcoder::modint;
void run_case() {
    ll A, B, C, D;
    cin >> A >> B >> C >> D;
    ll s, t, n, k;
    cin >> s >> t >> n >> k;
    mint::set_mod(k);
    Matrix<mint> M{{{A,B},{C,D}}};
    M = M.pow(n);
    auto R = M * Matrix<mint>{{{s}, {t}}};
    cout << R[0][0].val() << " " << R[1][0].val() << "\n";
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}
0