結果

問題 No.1050 Zero (Maximum)
ユーザー petite_progpetite_prog
提出日時 2020-05-08 22:11:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 19 ms / 2,000 ms
コード長 6,173 bytes
コンパイル時間 1,907 ms
コンパイル使用メモリ 184,640 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-04 00:48:14
合計ジャッジ時間 2,578 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/*
   ∫ ∫ ∫
   
  _ 
 _   
______
 (´・ω・)ノ 
   |  /
   UU
*/
#pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1<<30;
const char bn = '\n';
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 (b<a) { a=b; return 1; } return 0; }
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i,s,n) for (int i = s; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end() //使!!
#define debug(x) cerr << #x << ": " << x << "\n";
#define mp make_pair
template <typename T>
ostream& operator<<(ostream& os, const vector<T> &V){
int N = V.size();
REP(i,N){
os << V[i];
if (i!=N-1) os << " ";
}
os << "\n";
return os;
}
template <typename T,typename S>
ostream& operator<<(ostream& os, pair<T,S> const&P){
os << "(";
os << P.first;
os << " , ";
os << P.second;
os << ")";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T> &S){
auto it=S.begin();
while(it!=S.end()){
os << *it;
os << " ";
it++;
}
os << "\n";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, deque<T> &q){
for(auto it=q.begin();it<q.end();it++){
os<<*it;
os<<" ";
}
os<<endl;
return os;
}
template <typename T,typename S>
ostream& operator<<(ostream& os, map<T,S> const&M){
for(auto e:M){
os<<e;
}
os<<endl;
return os;
}
vector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};
#pragma endregion
//fixed<<setprecision(10)<<ans<<endl;
int64 pow(int a,int b,int mod){
vector<bool> bit;
for(b=b;b>0;b>>=1){
bit.push_back(b&1);
}
vector<int64> fac(bit.size()); fac[0] = a;
int64 res = 1;
for(int i=1;i<bit.size();i++){
fac[i] = (fac[i-1] * fac[i-1])%mod;
}
for(int i=0;i<bit.size();i++){
if(bit[i]) res*=fac[i];
res%=mod;
}
return res;
}
//mint
struct mint {
int64 x;
mint(int64 x=0):x((x+2*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;
}
mint pow(int64 t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime MOD
mint inv() const {
return pow(MOD-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res/=a;
}
};
ostream& operator<<(ostream& os, mint a){
os << a.x;
return os;
}
//
vector<int64> prime_factorization(int64 n){
int64 copy = n;
vector<int64> res;
for(int64 i=2;i*i<=copy;i++){
if(n%i==0){
res.push_back(i);
}
while(n%i==0){
n/=i;
}
}
if(n!=1) res.push_back(n);
return res;
}
//[1,N]N
int64 Phi(int64 N){
int64 res = N;
for(auto p:prime_factorization(N)) res-=res/p;
return res;
}
template <typename T>
struct Matrix{
vector<vector<T>> matrix_data;
Matrix(){}
Matrix(const vector<vector<T>>& matrix_data):matrix_data(matrix_data){}
//
Matrix<T> Identity(size_t N){
vector<vector<T>> res(N,vector<T>(N,0));
for(size_t i=0; i<N; i++) res[i][i]=1;
return Matrix<T>(res);
}
//O(N^3 log k)
Matrix<T> power(int64 k){
Matrix<T> res = Matrix::Identity(matrix_data.size());
Matrix<T> tmp = *this;
while(k){
if(k&1){res *= tmp;}
tmp *= tmp;
k >>= 1LL;
}
return res;
}
//T det(){}
//Matrix<T> inv(){} (⇔det(A)!=0)
};
template <typename T>
Matrix<T> operator*(const Matrix<T>& mat_a, const Matrix<T>& mat_b){
size_t A = mat_a.matrix_data.size();
size_t B = mat_b.matrix_data.size();
assert(B > 0);
size_t C = mat_b.matrix_data[0].size();
Matrix<T> res(vector<vector<T>>(A,vector<T>(C,0)));
for(size_t i=0; i<A; i++){
// debug(mp(mat_a.matrix_data[i].size() , mat_b.matrix_data.size()))
assert(mat_a.matrix_data[i].size() == B);
for(size_t j=0; j<B; j++){
for(size_t k=0; k<C; k++){
res.matrix_data[i][j] += mat_a.matrix_data[i][k] * mat_b.matrix_data[k][j];
}
}
}
return res;
}
template <typename T>
Matrix<T>& operator*=(Matrix<T>& mat_a, Matrix<T>& mat_b){
mat_a = mat_a*mat_b;
return mat_a;
}
template <typename T>
ostream& operator<<(ostream& os, const Matrix<T>& M){
os << M.matrix_data;
return os;
}
int gcd(int a, int b){
if(b==0) return a;
return gcd(b,a%b);
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int M;
int64 K;
cin >> M >> K;
vector<vector<mint>> A(M,vector<mint>(M,0));
REP(i,M){
REP(j,M){
auto to = (i*j)%M;
A[i][to]+=1;
to = (i+j)%M;
A[i][to]+=1;
}
}
Matrix<mint> Mat(A);
Mat = Mat.power(K);
vector<vector<mint>> b(1,vector<mint>(M,0));
b[0][0] = 1;
Matrix<mint> vec(b);
auto ans = vec*Mat;
cout << ans.matrix_data[0][0] << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0