結果
| 問題 |
No.1073 無限すごろく
|
| コンテスト | |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-06-05 22:10:43 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 6,411 bytes |
| コンパイル時間 | 2,171 ms |
| コンパイル使用メモリ | 184,840 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-12-17 15:38:08 |
| 合計ジャッジ時間 | 2,948 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...) \
([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...) \
([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) cerr << a[_i][_j] << sp; \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) if (_i) cerr << sp << a[_i]; \
else cerr << a[_i]; \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
signed main() {
using matrix = vector<vector<ll>>;
function<matrix(matrix, matrix)> add = [=](matrix A, matrix B) {
int m = A.size(), n = A[0].size();
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
A[i][j] += B[i][j];
A[i][j] %= MOD;
}
}
return A;
};
function<matrix(matrix)> t = [=](matrix A) {
int m = A.size(), n = A[0].size();
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (i < j) swap(A[i][j], A[j][i]);
}
}
return A;
};
function<matrix(ll, matrix)> multiple = [=](ll A, matrix B) {
int m = B.size(), n = B[0].size();
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
B[i][j] *= A;
B[i][j] %= MOD;
}
}
return B;
};
function<matrix(matrix, matrix)> product = [=](matrix A, matrix B) {
int m = A.size(), n = B.size(), l = B[0].size();
matrix C(m, vector<ll>(l));
for (int i = 0; i < m; i++) {
for (int j = 0; j < l; j++) {
for (int k = 0; k < n; k++) {
C[i][j] += A[i][k] * B[k][j] % MOD;
C[i][j] %= MOD;
}
}
}
return C;
};
ll N;
cin >> N;
matrix A = {{inv(6), inv(6), inv(6), inv(6), inv(6), inv(6)},
{1, 0, 0, 0, 0, 0},
{0, 1, 0, 0, 0, 0},
{0, 0, 1, 0, 0, 0},
{0, 0, 0, 1, 0, 0},
{0, 0, 0, 0, 1, 0}};
matrix B = {{0}, {0}, {0}, {0}, {0}, {0}};
ll DP[7] = {};
DP[0] = 1;
rep(i, 6) rep(j, 6) if (i + (j + 1) <= 6) {
DP[i + j + 1] += DP[i] * inv(6);
DP[i + 1] %= MOD;
}
rep(i, 6) B[i][0] = DP[6 - i];
matrix R = {{1, 0, 0, 0, 0, 0}, {0, 1, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0},
{0, 0, 0, 1, 0, 0}, {0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 1}};
rep(i, 61) {
if ((N - 1) & (1LL << i)) {
R = product(R, A);
}
A = product(A, A);
}
cout << product(R, B)[5][0] << rt;
}
// -g -D_GLIBCXX_DEBUG -fsanitize=undefined