結果
| 問題 | No.1050 Zero (Maximum) |
| ユーザー |
 nrvft
|
| 提出日時 | 2020-05-08 21:43:38 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 19 ms / 2,000 ms |
| コード長 | 5,477 bytes |
| コンパイル時間 | 2,226 ms |
| コンパイル使用メモリ | 208,212 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-07-04 00:20:07 |
| 合計ジャッジ時間 | 2,999 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 1 ms
6,940 KB |
| testcase_02 | AC | 6 ms
6,944 KB |
| testcase_03 | AC | 5 ms
6,940 KB |
| testcase_04 | AC | 12 ms
6,940 KB |
| testcase_05 | AC | 13 ms
6,944 KB |
| testcase_06 | AC | 6 ms
6,940 KB |
| testcase_07 | AC | 8 ms
6,944 KB |
| testcase_08 | AC | 2 ms
6,940 KB |
| testcase_09 | AC | 4 ms
6,944 KB |
| testcase_10 | AC | 15 ms
6,940 KB |
| testcase_11 | AC | 12 ms
6,944 KB |
| testcase_12 | AC | 2 ms
6,940 KB |
| testcase_13 | AC | 2 ms
6,940 KB |
| testcase_14 | AC | 2 ms
6,944 KB |
| testcase_15 | AC | 2 ms
6,944 KB |
| testcase_16 | AC | 17 ms
6,940 KB |
| testcase_17 | AC | 19 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
template<class T> inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 5e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
template <class T>
struct Matrix {
vector<vector<T>> mat;
int row, col;
Matrix(int r, int c, T v = 0) : mat(r, vector<T>(c, v)), row(r), col(c){};
inline const vector<T> &operator[](int k) const { return mat[k]; }
inline vector<T> &operator[](int k) { return mat[k]; }
Matrix &operator+=(const Matrix &A) {
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
(*this)[i][j] += A[i][j];
return (*this);
}
Matrix &operator-=(const Matrix &A) {
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
(*this)[i][j] -= A[i][j];
return (*this);
}
Matrix &operator*=(const Matrix &A) {
vector<vector<T>> res(row, vector<T>(A.col, 0));
for (int i = 0; i < row; i++)
for (int j = 0; j < A.col; j++)
for (int k = 0; k < col; k++)
res[i][j] += mat[i][k] * A[k][j];
mat.swap(res);
return (*this);
}
Matrix &operator^=(long long p) {
Matrix res = Matrix(row, col);
for (int i = 0; i < row; i++) res[i][i] = 1;
while(p > 0){
if (p & 1) res *= *this;
*this *= *this;
p >>= 1;
}
mat.swap(res.mat);
return (*this);
}
Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }
Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }
Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }
Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }
friend ostream &operator<<(ostream &os, Matrix &p) {
for (int i = 0; i < p.row; i++) {
os << "[";
for (int j = 0; j < p.col; j++) {
os << p[i][j] << (j + 1 == p.col ? "]\n" : ",");
}
}
return (os);
}
};
// modint
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator - () const noexcept {
return val ? MOD - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= MOD) val -= MOD;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += MOD;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(a, n / 2, MOD);
t = t * t;
if (n & 1) t = t * a;
return t;
}
};
using mint = Fp<MOD>;
int main() {
init();
ll M, K;
cin >> M >> K;
Matrix<mint> A(M, M), B(M, 1);
B[0][0] = 1;
rep(i,M)rep(j,M){
A[(i + j) % M][i] += 1;
A[i * j % M][i] += 1;
}
A ^= K;
B = A * B;
cout << B[0][0] << endl;
}