結果
問題 |
No.3224 2×2行列入門
|
ユーザー |
![]() |
提出日時 | 2025-08-08 21:21:05 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 12,640 bytes |
コンパイル時間 | 3,287 ms |
コンパイル使用メモリ | 284,404 KB |
実行使用メモリ | 7,720 KB |
最終ジャッジ日時 | 2025-08-08 21:21:11 |
合計ジャッジ時間 | 4,281 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" #line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << std::min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(std::vector<T> &v){ std::sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #line 2 "/Users/noya2/Desktop/Noya2_library/math/matrix.hpp" #line 6 "/Users/noya2/Desktop/Noya2_library/math/matrix.hpp" #include <ranges> #line 8 "/Users/noya2/Desktop/Noya2_library/math/matrix.hpp" namespace noya2 { template<typename T, size_t hw = -1uz> struct matrix { static constexpr int h = hw, w = hw; static inline T one = T(1); std::array<T, hw*hw> m; matrix () : m({}) {} matrix (const std::array<T, hw*hw> &_m) : m(_m) {} template<typename toT> matrix (const std::initializer_list<toT> &_m) { std::copy(_m.begin(), _m.end(), m.begin()); } matrix (const std::array<std::array<T, hw>, hw> &_m){ for (int i = 0; i < h; i++) for (int j = 0; j < w; j++){ m[idx(i,j)] = _m[i][j]; } } matrix (const std::vector<std::vector<T>> &_m){ for (int i = 0; i < h; i++) for (int j = 0; j < w; j++){ m[idx(i,j)] = _m[i][j]; } } auto operator[](int i) const { return std::ranges::subrange(m.begin()+i*w,m.begin()+(i+1)*w); } auto operator[](int i){ return std::ranges::subrange(m.begin()+i*w,m.begin()+(i+1)*w); } matrix &operator+= (const matrix &r){ for (int i = 0; i < h; ++i){ for (int j = 0; j < w; ++j){ m[idx(i,j)] += r.m[idx(i,j)]; } } return *this; } matrix &operator-= (const matrix &r){ for (int i = 0; i < h; ++i){ for (int j = 0; j < w; ++j){ m[idx(i,j)] -= r.m[idx(i,j)]; } } return *this; } matrix &operator*= (const matrix &r){ matrix ret; for (int i = 0; i < h; i++){ for (int k = 0; k < w; k++){ for (int j = 0; j < r.w; j++){ ret.m[idx(i,j)] += m[idx(i,k)] * r.m[idx(k,j)]; } } } return *this = ret; } matrix operator+ (const matrix &r) const { return matrix(*this) += r; } matrix operator- (const matrix &r) const { return matrix(*this) -= r; } matrix operator* (const matrix &r) const { return matrix(*this) *= r; } matrix& operator*=(const T &r){ for (int i = 0; i < h; ++i){ for (int j = 0; j < w; ++j){ m[idx(i,j)] *= r; } } return *this; } friend matrix operator* (const T &r, const matrix &mat){ return matrix(mat) *= r; } friend matrix operator* (const matrix &mat, const T &r){ return matrix(mat) *= r; } matrix pow(long long n) const { if (n == 0) return e(); matrix f = pow(n / 2); matrix ret = f * f; if (n & 1) ret *= (*this); return ret; } int idx(int i, int j){ return i * w + j; } static void set_one(T _one){ one = _one; } static matrix e(){ matrix ret; for (int i = 0; i < h; i++){ ret[i][i] = one; } return ret; } friend std::ostream &operator<<(std::ostream &os, const matrix &mat){ for (int i = 0; i < mat.h; i++){ if (i != 0) os << '\n'; for (int j = 0; j < mat.w; j++){ if (j != 0) os << ' '; os << mat[i][j]; } } return os; } friend std::istream &operator>>(std::istream &is, matrix &mat){ for (int i = 0; i < mat.h; i++){ for (int j = 0; j < mat.w; j++){ is >> mat[i][j]; } } return is; } friend bool operator==(const matrix &a, const matrix &b){ for (int i = 0; i < a.h; i++){ for (int j = 0; j < a.w; j++){ if (a[i][j] != b[i][j]){ return false; } } } return true; } }; template<typename T> struct matrix<T,-1uz> { int h, w; std::vector<T> m; matrix () {} matrix (int _h) : matrix(_h,_h) {} matrix (int _h, int _w) : h(_h), w(_w), m(_h*_w) {} matrix (int _h, int _w, const std::vector<T> &_m) : h(_h), w(_w), m(_m) { assert((int)_m.size() == _h*_w); } matrix (const std::vector<std::vector<T>> &_m){ h = _m.size(); assert(h >= 1); w = _m[0].size(); for (int i = 0; i < h; i++) for (int j = 0; j < w; j++){ m[idx(i,j)] = _m[i][j]; } } auto operator[](int i) const { return std::ranges::subrange(m.begin()+i*w,m.begin()+(i+1)*w); } auto operator[](int i){ return std::ranges::subrange(m.begin()+i*w,m.begin()+(i+1)*w); } matrix &operator+= (const matrix &r){ for (int i = 0; i < h; ++i){ for (int j = 0; j < w; ++j){ m[idx(i,j)] += r.m[idx(i,j)]; } } return *this; } matrix &operator-= (const matrix &r){ for (int i = 0; i < h; ++i){ for (int j = 0; j < w; ++j){ m[idx(i,j)] -= r.m[idx(i,j)]; } } return *this; } matrix &operator*= (const matrix &r){ matrix ret(h, r.w); for (int i = 0; i < h; i++){ for (int k = 0; k < w; k++){ for (int j = 0; j < r.w; j++){ ret[i][j] += (*this)[i][k] * r[k][j]; } } } return *this = ret; } matrix operator+ (const matrix &r) const { return matrix(*this) += r; } matrix operator- (const matrix &r) const { return matrix(*this) -= r; } matrix operator* (const matrix &r) const { return matrix(*this) *= r; } matrix& operator*=(const T &r){ for (int i = 0; i < h; ++i){ for (int j = 0; j < w; ++j){ m[idx(i,j)] *= r; } } return *this; } friend matrix operator* (const T &r, const matrix &mat){ return matrix(mat) *= r; } friend matrix operator* (const matrix &mat, const T &r){ return matrix(mat) *= r; } matrix pow(long long n){ if (n == 0) return e(h); matrix f = pow(n / 2); matrix ret = f * f; if (n & 1) ret *= (*this); return ret; } int idx(int i, int j) const { return i * w + j; } static matrix e(int _h){ auto ret = matrix(_h, _h); for (int i = 0; i < _h; i++){ ret[i][i] = T(1); } return ret; } friend std::ostream &operator<<(std::ostream &os, const matrix &mat){ for (int i = 0; i < mat.h; i++){ if (i != 0) os << '\n'; for (int j = 0; j < mat.w; j++){ if (j != 0) os << ' '; os << mat[i][j]; } } return os; } friend std::istream &operator>>(std::istream &is, matrix &mat){ for (int i = 0; i < mat.h; i++){ for (int j = 0; j < mat.w; j++){ is >> mat[i][j]; } } return is; } matrix transpose() const { matrix ret(w, h); for (int i = 0; i < h; i++){ for (int j = 0; j < w; j++){ ret[j][i] = m[idx(i, j)]; } } return ret; } }; template<typename T, size_t _hw = -1uz> T determinant(matrix<T, _hw> mat){ int hw = mat.h; T ret = 1; for (int i = 0; i < hw; i++) { int idx = -1; for (int j = i; j < hw; j++) { if (mat[j][i] != 0) { idx = j; break; } } if (idx == -1) return 0; if (i != idx) { ret *= T(-1); for (int j = 0; j < hw; j++){ std::swap(mat[i][j],mat[idx][j]); } } ret *= mat[i][i]; T inv = T(1) / mat[i][i]; for (int j = 0; j < hw; j++) { mat[i][j] *= inv; } for (int j = i + 1; j < hw; j++) { T a = mat[j][i]; if (a == 0) continue; for (int k = i; k < hw; k++) { mat[j][k] -= mat[i][k] * a; } } } return ret; } } // namespace noya2 #line 4 "c.cpp" void solve(){ using mat = matrix<ll,2>; mat a, b; in(a,b); auto ans = a * b * a * b; out(ans); } int main(){ int t = 1; //in(t); while (t--) { solve(); } }