結果
問題 | No.891 隣接3項間の漸化式 |
ユーザー |
![]() |
提出日時 | 2019-09-20 21:39:45 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,256 bytes |
コンパイル時間 | 1,886 ms |
コンパイル使用メモリ | 175,572 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-14 16:55:50 |
合計ジャッジ時間 | 3,064 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 39 |
コンパイルメッセージ
main.cpp:11:20: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 11 | constexpr ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {} | ^~~~ main.cpp:38:9: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 38 | M pow(auto n) const { | ^~~~ main.cpp:44:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 44 | friend M operator*(auto l, M r) { return M(l) *= r; } | ^~~~ main.cpp:45:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 45 | friend M operator/(auto l, M r) { return M(l) /= r; } | ^~~~ main.cpp:46:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 46 | friend M operator+(auto l, M r) { return M(l) += r; } | ^~~~ main.cpp:47:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 47 | friend M operator-(auto l, M r) { return M(l) -= r; } | ^~~~ main.cpp:50:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 50 | friend bool operator==(auto l, M r) { return M(l) == r; } | ^~~~ main.cpp:51:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 51 | friend bool operator!=(auto l, M r) { return !(l == r); } | ^~~~
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;template<class T = int> using V = vector<T>;template<class T = int> using VV = V< V<T> >;template<unsigned P> struct ModInt {using M = ModInt;unsigned v;constexpr ModInt() : v(0) {}constexpr ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {}constexpr ModInt(unsigned v, int) : v(v) {}static constexpr unsigned p() { return P; }M operator+() const { return *this; }M operator-() const { return {v ? P - v : 0, 0}; }explicit operator bool() const noexcept { return v; }bool operator!() const noexcept { return !(bool)*this; }M operator*(M r) const { return M(*this) *= r; }M operator/(M r) const { return M(*this) /= r; }M operator+(M r) const { return M(*this) += r; }M operator-(M r) const { return M(*this) -= r; }bool operator==(M r) const { return v == r.v; }bool operator!=(M r) const { return !(*this == r); }M& operator*=(M r) { v = (uint64_t)v * r.v % P; return *this; }M& operator/=(M r) { return *this *= r.inv(); }M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; }M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; }M inv() const {int a = v, b = P, x = 1, u = 0;while (b) {int q = a / b;swap(a -= q * b, b);swap(x -= q * u, u);}assert(a == 1);return x;}M pow(auto n) const {if (n < 0) return pow(-n).inv();M res = 1;for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;return res;}friend M operator*(auto l, M r) { return M(l) *= r; }friend M operator/(auto l, M r) { return M(l) /= r; }friend M operator+(auto l, M r) { return M(l) += r; }friend M operator-(auto l, M r) { return M(l) -= r; }friend ostream& operator<<(ostream& os, M r) { return os << r.v; }friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; }friend bool operator==(auto l, M r) { return M(l) == r; }friend bool operator!=(auto l, M r) { return !(l == r); }};using Mint = ModInt<(unsigned)1e9 + 7>;template<class T> V<T> operator*(const VV<T>& A, const V<T>& x) {assert(A[0].size() == x.size());V<T> res(A.size());for (int i = 0; i < (int) A.size(); ++i) {res[i] = inner_product(begin(A[i]), end(A[i]), begin(x), (T) 0);}return res;}template<class T> VV<T> operator*(const VV<T>& A, const VV<T>& B) {assert(A[0].size() == B.size());VV<T> res(A.size(), V<T>(B[0].size()));for (int i = 0; i < (int) A.size(); ++i) for (int k = 0; k < (int) A[0].size(); ++k) for (int j = 0; j < (int) B[0].size(); ++j) {res[i][j] += A[i][k] * B[k][j];}return res;}template<class T> VV<T>& operator*=(VV<T>& A, const VV<T>& B) { return A = A * B; }template<class T> VV<T> I(int n) {VV<T> res(n, V<T>(n));for (int i = 0; i < n; ++i) res[i][i] = 1;return res;}template<class T> VV<T> pow(VV<T> A, lint n) {auto res = I<T>(A.size());while (n) {if (n & 1) res *= A;A *= A;n >>= 1;}return res;}int main() {cin.tie(nullptr); ios::sync_with_stdio(false);Mint a, b; int n; cin >> a >> b >> n;VV<Mint> A{{a, b},{1, 0}};V<Mint> x{1, 0};x = pow(A, n) * x;cout << x[1] << '\n';}