結果

問題 No.1050 Zero (Maximum)
コンテスト
ユーザー rniya
提出日時 2020-09-22 12:30:33
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 20 ms / 2,000 ms
コード長 6,761 bytes
コンパイル時間 1,723 ms
コンパイル使用メモリ 170,472 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-26 00:03:33
合計ジャッジ時間 2,673 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1000000007;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<uint32_t mod> class modint{
    using i64=int64_t;
    using u32=uint32_t;
    using u64=uint64_t;
public:
    u32 v;
    constexpr modint(const i64 x=0) noexcept :v(x<0?mod-1-(-(x+1)%mod):x%mod){}
    constexpr u32 &value() noexcept {return v;}
    constexpr const u32 &value() const noexcept {return v;}
    constexpr modint operator+(const modint &rhs) const noexcept {return modint(*this)+=rhs;}
    constexpr modint operator-(const modint &rhs) const noexcept {return modint(*this)-=rhs;}
    constexpr modint operator*(const modint &rhs) const noexcept {return modint(*this)*=rhs;}
    constexpr modint operator/(const modint &rhs) const noexcept {return modint(*this)/=rhs;}
    constexpr modint &operator+=(const modint &rhs) noexcept {
        v+=rhs.v;
        if (v>=mod) v-=mod;
        return *this;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept {
        if (v<rhs.v) v+=mod;
        v-=rhs.v;
        return *this;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept {
        v=(u64)v*rhs.v%mod;
        return *this;
    }
    constexpr modint &operator/=(const modint &rhs) noexcept {
        return *this*=rhs.pow(mod-2);
    }
    constexpr modint pow(u64 exp) const noexcept {
        modint self(*this),res(1);
        while (exp>0){
            if (exp&1) res*=self;
            self*=self; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept {return modint(x)+y;}
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept {return modint(x)-y;}
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept {return modint(x)*y;}
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept {return modint(x)/y;}
    constexpr modint &operator++() noexcept {return ++v,*this;}
    constexpr modint &operator--() noexcept {return --v,*this;}
    constexpr modint operator++(int) noexcept {modint t=*this; return ++v,t;}
    constexpr modint operator--(int) noexcept {modint t=*this; return --v,t;}
    constexpr bool operator==(const modint &rhs) const noexcept {return v==rhs.v;}
    constexpr bool operator!=(const modint &rhs) const noexcept {return v!=rhs.v;}
    constexpr bool operator!() const noexcept {return !v;}
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        i64 v; rhs=modint{(s>>v,v)}; return s;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s<<rhs.v;
    }
};

template<class K,size_t N>
struct SquareMatrix{
    array<array<K,N>,N> dat;
    SquareMatrix(){
        for (size_t i=0;i<N;++i)
            for (size_t j=0;j<N;++j)
                dat[i][j]=K();
    }
    size_t size() const{return N;}
    array<K,N> &operator[](size_t i){return dat[i];}
    const array<K,N> &operator[](size_t i) const{return dat[i];}
    static SquareMatrix I(){
        SquareMatrix res;
        for (size_t i=0;i<N;++i) res[i][i]=K(1);
        return res;
    }
    SquareMatrix &operator+=(const SquareMatrix &B){
        for (size_t i=0;i<N;++i)
            for (size_t j=0;j<N;++j)
                (*this)[i][j]+=B[i][j];
        return (*this);
    }
    SquareMatrix operator+(const SquareMatrix &B) const{
        return SquareMatrix(*this)+=B;
    }
    SquareMatrix &operator-=(const SquareMatrix &B){
        for (size_t i=0;i<N;++i)
            for (size_t j=0;j<N;++j)
                (*this)[i][j]-=B[i][j];
        return (*this);
    }
    SquareMatrix operator-(const SquareMatrix &B) const{
        return SquareMatrix(*this)-=B;
    }
    SquareMatrix &operator*=(const SquareMatrix &B){
        SquareMatrix res;
        for (size_t i=0;i<N;++i)
            for (size_t j=0;j<N;++j)
                for (size_t k=0;k<N;++k)
                    res[i][j]+=(*this)[i][k]*B[k][j];
        dat.swap(res.dat);
        return (*this);
    }
    SquareMatrix operator*(const SquareMatrix &B) const{
        return SquareMatrix(*this)*=B;
    }
    SquareMatrix &operator^=(long long k){
        SquareMatrix res=I();
        while(k){
            if (k&1LL) res*=*this;
            *this*=*this; k>>=1LL;
        }
        dat.swap(res.dat);
        return (*this);
    }
    SquareMatrix operator^(long long k) const{
        return SquareMatrix(*this)^=k;
    }
};

using mint=modint<1000000007>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int M,K; cin >> M >> K;

    SquareMatrix<mint,55> SM;
    for (int i=0;i<M;++i){
        for (int j=0;j<M;++j){
            ++SM[i][(i+j)%M];
            ++SM[i][i*j%M];
        }
    }

    SM^=K;
    cout << SM[0][0] << '\n';
}
0