結果
問題 | No.344 ある無理数の累乗 |
ユーザー | firiexp |
提出日時 | 2020-03-30 01:47:48 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,585 bytes |
コンパイル時間 | 581 ms |
コンパイル使用メモリ | 85,668 KB |
最終ジャッジ日時 | 2024-04-27 03:07:08 |
合計ジャッジ時間 | 896 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:18:39: error: '::numeric_limits' has not been declared 18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^~~~~~~~~~~~~~ main.cpp:18:55: error: expected primary-expression before '>' token 18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^ main.cpp:18:61: error: no matching function for call to 'max()' 18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)' 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:18:61: note: candidate expects 2 arguments, 0 provided 18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 1000; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; template<u32 M = 1000000007> struct modint{ u32 val; modint(): val(0){} template<typename T> modint(T t){t %= (T)M; if(t < 0) t += (T)M; val = t;} modint pow(ll k) const { modint res(1), x(val); while(k){ if(k&1) res *= x; x *= x; k >>= 1; } return res; } template<typename T> modint& operator=(T t){t %= (T)M; if(t < 0) t += (T)M; val = t; return *this;} modint inv() const {return pow(M-2);} modint& operator+=(modint a){val += a.val; if(val >= M) val -= M; return *this;} modint& operator-=(modint a){if(val < a.val) val += M-a.val; else val -= a.val; return *this;} modint& operator*=(modint a){val = (u64)val*a.val%M; return *this;} modint& operator/=(modint a){return (*this) *= a.inv();} modint operator+(modint a) const {return modint(val) +=a;} modint operator-(modint a) const {return modint(val) -=a;} modint operator*(modint a) const {return modint(val) *=a;} modint operator/(modint a) const {return modint(val) /=a;} modint operator-(){return modint(M-val);} bool operator==(const modint a) const {return val == a.val;} bool operator!=(const modint a) const {return val != a.val;} bool operator<(const modint a) const {return val < a.val;} }; using mint = modint<MOD>; template<class H, size_t SIZE> struct SquareMatrix { using T = typename H::T; using ar = array<T, SIZE>; using mat = array<ar, SIZE>; mat A; SquareMatrix() = default; static SquareMatrix I(){ SquareMatrix X{}; for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { if(i == j) X[i][j] = H::one(); else X[i][j] = H::zero(); } } return X; } friend ar operator*=(ar &x, const SquareMatrix &Y) { ar ans{}; for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { H::add(ans[j], H::mul(x[i], Y[i][j])); } } x.swap(ans); return x; } friend ar operator*(ar x, const SquareMatrix &Y) { return x *= Y; } inline const ar &operator[](int k) const{ return (A.at(k)); } inline ar &operator[](int k) { return (A.at(k)); } SquareMatrix &operator+= (const SquareMatrix &B){ for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { H::add((*this)[i][j], B[i][j]); } } return (*this); } SquareMatrix &operator-= (const SquareMatrix &B){ for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { H::add((*this)[i][j], -B[i][j]); } } return (*this); } SquareMatrix &operator*=(const SquareMatrix &B) { SquareMatrix C{}; for (int i = 0; i < SIZE; ++i) { for (int k = 0; k < SIZE; ++k) { for (int j = 0; j < SIZE; ++j) { H::add(C[i][j], H::mul((*this)[i][k], B[k][j])); } } } A.swap(C.A); return (*this); } SquareMatrix pow(ll n) const { SquareMatrix a = (*this), res = I(); while(n > 0){ if(n & 1) res *= a; a *= a; n >>= 1; } return res; } SquareMatrix operator+(const SquareMatrix &B) const {return SquareMatrix(*this) += B;} SquareMatrix operator-(const SquareMatrix &B) const {return SquareMatrix(*this) -= B;} SquareMatrix operator*(const SquareMatrix &B) const {return SquareMatrix(*this) *= B;} }; struct SemiRing { using T = mint; static inline T mul(T x, T y){ return x * y; } static inline void add(T &x, T y){ x += y; } static inline T one(){ return {1}; } static inline T zero(){ return {0}; } }; using ar = array<SemiRing::T, 2>; using mat = SquareMatrix<SemiRing, 2>; int main() { int n; cin >> n; if(!n){ puts("1"); return 0; } ar x{1, 0}; mat A; A[0][0] = 1; A[0][1] = 1; A[1][0] = 3; A[1][1] = 1; x *= A.pow(n); printf("%d\n", (x[0]+x[0] - mint(1-(n&1))).val); return 0; }