結果
問題 |
No.3225 2×2行列相似判定 〜easy〜
|
ユーザー |
![]() |
提出日時 | 2025-08-08 22:15:14 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 68 ms / 2,000 ms |
コード長 | 5,470 bytes |
コンパイル時間 | 6,459 ms |
コンパイル使用メモリ | 333,848 KB |
実行使用メモリ | 7,840 KB |
最終ジャッジ日時 | 2025-08-08 22:15:28 |
合計ジャッジ時間 | 7,624 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; typedef unsigned long long ull; typedef long double ld; #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) #define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--) #define repn(i,end) for(ll i = 0; i <= (ll)(end); i++) #define reps(i,start,end) for(ll i = start; i < (ll)(end); i++) #define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++) #define each(p,a) for(auto &p:a) typedef vector<ll> vll; typedef vector<pair<ll ,ll>> vpll; typedef vector<vector<ll>> vvll; typedef set<ll> sll; typedef map<ll , ll> mpll; typedef pair<ll ,ll> pll; typedef tuple<ll , ll , ll> tpl3; #define LL(...) ll __VA_ARGS__; input(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; input(__VA_ARGS__) #define Str(...) string __VA_ARGS__; input(__VA_ARGS__) #define Ch(...) char __VA_ARGS__; input(__VA_ARGS__) #define all(a) (a).begin(),(a).end() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define sz(x) (ll)x.size() // << std::fixed << std::setprecision(10) const ll INF = 1LL << 60; const ld EPS = 1e-9; ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}} ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}} inline ll positive_mod(ll a,ll m){return (a % m + m)%m;} inline ll popcnt(ull a){ return __builtin_popcountll(a);} //0indexed inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);} inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);} template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;} template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;} template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;} template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;} template<class... T>void input(T&... a){(cin >> ... >> a);} void print(){cout << endl;} template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;} template<class T> void pspace(const T& a){ cout << a << ' ';} void perr(){cerr << endl;} template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;} void yes(bool i = true){ return print(i?"yes":"no"); } void Yes(bool i = true){ return print(i?"Yes":"No"); } void YES(bool i = true){ return print(i?"YES":"NO"); } template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;} template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;} template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;} template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;} //grid探索用 vector<ll> _ta = {0,0,1,-1,1,1,-1,-1}; vector<ll> _yo = {1,-1,0,0,1,-1,1,-1}; bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);} ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;} ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} const ll MOD9 = 998244353LL; const ll MOD10 = 1000000007LL; //ref https://github.com/atcoder/live_library/blob/master/mat.cpp template<typename T> struct Matrix { int h, w; vector<vector<T>> d; Matrix() {} Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {} Matrix& unit() { assert(h == w); rep(i,h) d[i][i] = 1; return *this; } const vector<T>& operator[](int i) const { return d[i];} vector<T>& operator[](int i) { return d[i];} Matrix operator*(const Matrix& a) const { assert(w == a.h); Matrix r(h, a.w); rep(i,h)rep(k,w)rep(j,a.w) { r[i][j] += d[i][k]*a[k][j]; } return r; } Matrix pow(long long t) const { assert(h == w); if (!t) return Matrix(h,h).unit(); if (t == 1) return *this; Matrix r = pow(t>>1); r = r*r; if (t&1) r = r*(*this); return r; } /* mint only mint det() { assert(h == w); mint res = 1; rep(k,h) { for (int i = k; i < h; ++i) { if (d[i][k] == 0) continue; if (i != k) { swap(d[i],d[k]); res = -res; } } if (d[k][k] == 0) return 0; res *= d[k][k]; mint inv = mint(1)/d[k][k]; rep(j,h) d[k][j] *= inv; for (int i = k+1; i < h; ++i) { mint c = d[i][k]; for (int j = k; j < h; ++j) d[i][j] -= d[k][j]*c; } } return res; } //*/ }; int main(){ ios::sync_with_stdio(false);cin.tie(nullptr); LL(a,b,c,d,e,f,g,h); rep(i,67)rep(j,67)rep(k,67)rep(l,67){ if(i * l - j * k == 0)continue; if((i*a+j*c)%67 != (e*j+f*k)%67){ continue; } if((i*b+j*d)%67 != (e*j+f*l)%67){ continue; } if((k*a+l*c)%67 != (g*j+h*k)%67){ continue; } if((k*b+l*d)%67 != (g*j+h*l)%67){ continue; } cout << "Yes" << endl; return 0; } cout << "No" << endl; }