結果
| 問題 | No.1275 綺麗な式 |
| ユーザー |
 iiljj
|
| 提出日時 | 2020-10-30 22:17:21 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 13,253 bytes |
| コンパイル時間 | 6,431 ms |
| コンパイル使用メモリ | 245,096 KB |
| 最終ジャッジ日時 | 2025-01-15 17:23:58 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:271:20: error: expected unqualified-id before ')' token
271 | Mat<Num, H, W>() : array<array<Num, W>, H>() { fill(0); }
| ^
main.cpp:272:20: error: expected unqualified-id before 'const'
272 | Mat<Num, H, W>(const Num value) : array<array<Num, W>, H>() { fill(value); }
| ^~~~~
main.cpp:272:20: error: expected ')' before 'const'
272 | Mat<Num, H, W>(const Num value) : array<array<Num, W>, H>() { fill(value); }
| ~^~~~~
| )
main.cpp:273:57: error: invalid declarator before 'init'
273 | Mat<Num, H, W>(std::initializer_list<array<Num, W>> init) : array<array<Num, W>, H>() {
| ^~~~
main.cpp:273:56: error: expected ')' before 'init'
273 | Mat<Num, H, W>(std::initializer_list<array<Num, W>> init) : array<array<Num, W>, H>() {
| ~ ^~~~~
| )
main.cpp: In function 'void solve()':
main.cpp:404:36: error: too many initializers for 'mat' {aka 'Mat<mint, 2, 2>'}
404 | mat A{{f1, prod * (-1)}, {1, 0}};
| ^
ソースコード
/* #region Head */// #define _GLIBCXX_DEBUG#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'#define sqrt sqrtl#define floor floorl#define log2 log2lconstexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec) is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#define DEBUG_#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \cin >> __VA_ARGS__;template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize() {ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }/* #endregion */// #include <atcoder/all>// using namespace atcoder;/* #region mint */// 自動で MOD を取る整数struct mint {ll x;mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}mint operator+(const mint a) const {mint res(*this);return res += a;}mint operator-(const mint a) const {mint res(*this);return res -= a;}mint operator*(const mint a) const {mint res(*this);return res *= a;}// O(log(t))mint pow_rec(ll t) const {if (!t) return 1;mint a = pow(t >> 1); // ⌊t/2⌋ 乗a *= a; // ⌊t/2⌋*2 乗if (t & 1) // ⌊t/2⌋*2 == t-1 のときa *= *this; // ⌊t/2⌋*2+1 乗 => t 乗return a;}mint pow(ll t) const {mint a(*this);mint res = 1;while (t) {if (t & 1) res *= a;t >>= 1, a *= a;}return res;}// for prime modmint inv_prime() const {return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)}mint inv() const {ll a = this->x, b = MOD, u = 1, v = 0, t;mint res;while (b) {t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}if (u < 0) u += MOD;res = u;return res;}mint &operator/=(const mint a) { return (*this) *= a.inv(); }mint operator/(const mint a) const {mint res(*this);return res /= a;}bool operator==(const mint a) const { return this->x == a.x; }bool operator==(const ll a) const { return this->x == a; }// mint 入力friend istream &operator>>(istream &is, mint &x) {is >> x.x;return is;}// mint 出力friend ostream &operator<<(ostream &os, mint x) {os << x.x;return os;}};/* #endregion *//* #region Mat */// 行列，==, !=, [] あたりは array と一緒template <class Num, size_t H, size_t W> class Mat : public array<array<Num, W>, H> {public:Mat<Num, H, W>() : array<array<Num, W>, H>() { fill(0); }Mat<Num, H, W>(const Num value) : array<array<Num, W>, H>() { fill(value); }Mat<Num, H, W>(std::initializer_list<array<Num, W>> init) : array<array<Num, W>, H>() {int i = 0;for (auto iter = init.begin(); iter != init.end(); ++iter) (*this)[i++] = array<Num, W>(*iter);}// 行列に別の行列を足すMat<Num, H, W> &operator+=(const Mat<Num, H, W> &another) {REP(i, 0, H) REP(j, 0, W)(*this)[i][j] += another[i][j];return *this;}// 行列から別の行列を引くMat<Num, H, W> &operator-=(const Mat<Num, H, W> &another) {REP(i, 0, H) REP(j, 0, W)(*this)[i][j] -= another[i][j];return *this;}// 行列に別の行列を右から掛ける// template <size_t AW> Mat<Num, H, AW> &operator*=(const Mat<Num, W, AW> &another) {// Mat<Num, H, AW> ret = {};// REP(i, 0, H) REP(j, 0, AW) REP(k, 0, W) ret[i][j] += (*this)[i][k] * another[k][j];// *this = ret;// return *this;// }// 更新する場合，行列サイズが変わらない乗算のみ許容するMat<Num, H, W> &operator*=(const Mat<Num, W, W> &another) {Mat<Num, H, W> ret = (*this) * another;*this = ret;return *this;}// 行列に別の行列を足すMat<Num, H, W> operator+(const Mat<Num, H, W> &another) const {Mat<Num, H, W> ret(*this);return ret += another;}// 行列から別の行列を引くMat<Num, H, W> operator-(const Mat<Num, H, W> &another) const {Mat<Num, H, W> ret(*this);return ret -= another;}// 行列に別の行列を右から掛けるtemplate <size_t AW> Mat<Num, H, AW> operator*(const Mat<Num, W, AW> &another) const {// Mat<Num, H, AW> ret(*this);// return ret *= another;Mat<Num, H, AW> ret = {};REP(i, 0, H) REP(j, 0, AW) REP(k, 0, W) ret[i][j] += (*this)[i][k] * another[k][j];return ret;}// 行列の n 乗を計算するMat<Num, H, W> pow(ll n) const {assert(H == W);Mat<Num, H, W> ret = {};Mat<Num, H, W> a(*this);REP(i, 0, H) ret[i][i] = 1;while (n) {if (n & 1) ret = a * ret;a = a * a, n >>= 1;}return ret;}// 列和が 1 になるよう正規化するMat<Num, H, W> norm() const {array<Num, W> s = {};Mat<Num, H, W> a(*this);REP(i, 0, H) REP(j, 0, W) s[j] += a[i][j];REP(i, 0, H) REP(j, 0, W) a[i][j] /= s[j];return a;}// 行列の n 乗を計算する（列和が常に 1 になるよう正規化する）Mat<Num, H, W> pow_norm(ll n) const {assert(H == W);Mat<Num, H, W> ret = {};Mat<Num, H, W> a(*this);REP(i, 0, H) ret[i][i] = 1;while (n) {if (n & 1) ret = (a * ret).norm();a = (a * a).norm(), n >>= 1;}return ret;}template <class... T> Mat<Num, H, W> assign(T... nums) {vc<Num> num_list = vc<Num>{nums...};assert(SIZE(num_list) == H * W);REP(i, 0, H) REP(j, 0, W)(*this)[i][j] = num_list[W * i + j];return *this;}void fill(Num num) { REP(i, 0, H) REP(j, 0, W)(*this)[i][j] = num; }void print() { REP(i, 0, H) REP(j, 0, W) cout << (*this)[i][j] << (j == W - 1 ? '\n' : ' '); }void dump_col(ll j) { REP(i, 0, H) cout << (*this)[i][j] << (i == H - 1 ? '\n' : ' '); }};/* #endregion */// Problemvoid solve() {VAR(ll, a, b, n); //if (n == 0) {cout << 2 << endl;return;}mint A1 = mint(a) * 2;mint A2 = (mint(a) * a + b) * 2;if (n == 1) {cout << A1 << endl;return;}if (n == 2) {cout << A2 << endl;return;}mint sum = mint(a) * 2;mint prod = mint(a) * a - b;// auto f = [&](auto &&f, ll i) -> mint {// if (i == 1) return sum;// if (i == 2) return sum * sum - prod * 2;// return f(f, 1) * f(f, i - 1) - prod * f(f, i - 2);// };// cout << f(f, n) << endl;mint f1 = sum;mint f2 = sum * sum - prod * 2;using mat = Mat<mint, 2, 2>;mat A{{f1, prod * (-1)}, {1, 0}};A = A.pow(n - 1);mint fn = A[1][0] * f2 + A[1][1] * f1;cout << fn << endl;}// entry pointint main() {solve();return 0;}