結果
| 問題 | No.1073 無限すごろく |
| ユーザー |
 kimiyuki
|
| 提出日時 | 2020-06-05 21:46:31 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,177 bytes |
| コンパイル時間 | 773 ms |
| コンパイル使用メモリ | 62,500 KB |
| 最終ジャッジ日時 | 2025-01-10 22:26:04 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
/home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:6:23: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:6:33: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:7:41: error: ‘W’ was not declared in this scope /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:7:42: error: template argument 2 is invalid /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:7:45: error: ‘H’ was not declared in this scope /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:7:46: error: template argument 1 is invalid /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:7:46: error: template argument 2 is invalid /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:9:23: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:9:33: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:9:43: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:10:1: error: ‘matrix’ does not name a type /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:15:23: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:15:33: error: ‘size_t’ has not been declared /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:16:15: error: ‘H’ was not declared in this scope /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:16:16: error: template argument 2 is invalid /home/user/GitHub/competitive-programming-library/number/matrix_template.hpp:16:18: error: declaration of ‘operator*’ as n
ソースコード
#line 1 "main.cpp"#define PROBLEM "https://yukicoder.me/problems/no/1073"#line 2 "/home/user/GitHub/competitive-programming-library/number/matrix_template.hpp"#include <array>#include <cstdint>#line 2 "/home/user/GitHub/competitive-programming-library/utils/macros.hpp"#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))#define ALL(x) std::begin(x), std::end(x)#line 5 "/home/user/GitHub/competitive-programming-library/number/matrix_template.hpp"template <typename T, size_t H, size_t W>using matrix = std::array<std::array<T, W>, H>;template <typename T, size_t A, size_t B, size_t C>matrix<T, A, C> operator * (matrix<T, A, B> const & a, matrix<T, B, C> const & b) {matrix<T, A, C> c = {};REP (y, A) REP (z, B) REP (x, C) c[y][x] += a[y][z] * b[z][x];return c;}template <typename T, size_t H, size_t W>std::array<T, H> operator * (matrix<T, H, W> const & a, std::array<T, W> const & b) {std::array<T, H> c = {};REP (y, H) REP (z, W) c[y] += a[y][z] * b[z];return c;}template <typename T, size_t H, size_t W>matrix<T, H, W> operator + (matrix<T, H, W> const & a, matrix<T, H, W> const & b) {matrix<T, H, W> c;REP (y, H) REP (x, W) c[y][x] = a[y][x] + b[y][x];return c;}template <typename T, size_t N>std::array<T, N> operator + (std::array<T, N> const & a, std::array<T, N> const & b) {std::array<T, N> c;REP (i, N) c[i] = a[i] + b[i];return c;}template <typename T, size_t H, size_t W>matrix<T, H, W> zero_matrix() {return {};}template <typename T, size_t N>matrix<T, N, N> unit_matrix() {matrix<T, N, N> a = {};REP (i, N) a[i][i] = 1;return a;}template <typename T, size_t N>matrix<T, N, N> powmat(matrix<T, N, N> x, int64_t k) {matrix<T, N, N> y = unit_matrix<T, N>();for (; k; k >>= 1) {if (k & 1) y = y * x;x = x * x;}return y;}#line 2 "/home/user/GitHub/competitive-programming-library/modulus/mint.hpp"#include <algorithm>#include <cassert>#include <iostream>#line 3 "/home/user/GitHub/competitive-programming-library/modulus/modpow.hpp"inline int32_t modpow(uint_fast64_t x, uint64_t k, int32_t MOD) {assert (/* 0 <= x and */ x < (uint_fast64_t)MOD);uint_fast64_t y = 1;for (; k; k >>= 1) {if (k & 1) (y *= x) %= MOD;(x *= x) %= MOD;}assert (/* 0 <= y and */ y < (uint_fast64_t)MOD);return y;}#line 4 "/home/user/GitHub/competitive-programming-library/modulus/modinv.hpp"inline int32_t modinv_nocheck(int32_t value, int32_t MOD) {assert (0 <= value and value < MOD);if (value == 0) return -1;int64_t a = value, b = MOD;int64_t x = 0, y = 1;for (int64_t u = 1, v = 0; a; ) {int64_t q = b / a;x -= q * u; std::swap(x, u);y -= q * v; std::swap(y, v);b -= q * a; std::swap(b, a);}if (not (value * x + MOD * y == b and b == 1)) return -1;if (x < 0) x += MOD;assert (0 <= x and x < MOD);return x;}inline int32_t modinv(int32_t x, int32_t MOD) {int32_t y = modinv_nocheck(x, MOD);assert (y != -1);return y;}#line 7 "/home/user/GitHub/competitive-programming-library/modulus/mint.hpp"/*** @brief quotient ring / 剰余環 $\mathbb{Z}/n\mathbb{Z}$*/template <int32_t MOD>struct mint {int32_t value;mint() : value() {}mint(int64_t value_) : value(value_ < 0 ? value_ % MOD + MOD : value_ >= MOD ? value_ % MOD : value_) {}mint(int32_t value_, std::nullptr_t) : value(value_) {}explicit operator bool() const { return value; }inline mint<MOD> operator + (mint<MOD> other) const { return mint<MOD>(*this) += other; }inline mint<MOD> operator - (mint<MOD> other) const { return mint<MOD>(*this) -= other; }inline mint<MOD> operator * (mint<MOD> other) const { return mint<MOD>(*this) *= other; }inline mint<MOD> & operator += (mint<MOD> other) { this->value += other.value; if (this->value >= MOD) this->value -= MOD; return *this; }inline mint<MOD> & operator -= (mint<MOD> other) { this->value -= other.value; if (this->value < 0) this->value += MOD; return *this; }inline mint<MOD> & operator *= (mint<MOD> other) { this->value = (uint_fast64_t)this->value * other.value % MOD; return *this; }inline mint<MOD> operator - () const { return mint<MOD>(this->value ? MOD - this->value : 0, nullptr); }inline mint<MOD> pow(uint64_t k) const { return mint<MOD>(modpow(value, k, MOD), nullptr); }inline mint<MOD> inv() const { return mint<MOD>(modinv(value, MOD), nullptr); }inline mint<MOD> operator / (mint<MOD> other) const { return *this * other.inv(); }inline mint<MOD> operator /= (mint<MOD> other) { return *this *= other.inv(); }inline bool operator == (mint<MOD> other) const { return value == other.value; }inline bool operator != (mint<MOD> other) const { return value != other.value; }};template <int32_t MOD> mint<MOD> operator * (int64_t value, mint<MOD> n) { return mint<MOD>(value) * n; }template <int32_t MOD> std::istream & operator >> (std::istream & in, mint<MOD> & n) { int64_t value; in >> value; n = value; return in; }template <int32_t MOD> std::ostream & operator << (std::ostream & out, mint<MOD> n) { return out << n.value; }#line 5 "main.cpp"using namespace std;constexpr int MOD = 1000000007;mint<MOD> solve(int64_t n) {matrix<mint<MOD>, 6, 6> f = {{{{ 0, 0, 0, 0, 0, mint<MOD>(6).inv() }},{{ 1, 0, 0, 0, 0, mint<MOD>(6).inv() }},{{ 0, 1, 0, 0, 0, mint<MOD>(6).inv() }},{{ 0, 0, 1, 0, 0, mint<MOD>(6).inv() }},{{ 0, 0, 0, 1, 0, mint<MOD>(6).inv() }},{{ 0, 0, 0, 0, 1, mint<MOD>(6).inv() }},}};array<mint<MOD>, 6> x = {{0,0,0,0,0,1,}};return (powmat(f, n) * x)[5];}int main() {int64_t n; cin >> n;auto ans = solve(n);cout << ans << endl;return 0;}