結果

問題 No.1331 Moving Penguin
ユーザー tokusakurai
提出日時 2021-01-08 21:46:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 140 ms / 1,500 ms
コード長 3,583 bytes
コンパイル時間 1,950 ms
コンパイル使用メモリ 200,612 KB
最終ジャッジ日時 2025-01-17 11:37:21
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;
template<int mod>
struct Mod_Int{
    int x;
    Mod_Int() : x(0) {}
    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    Mod_Int &operator += (const Mod_Int &p){
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    Mod_Int &operator -= (const Mod_Int &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    Mod_Int &operator *= (const Mod_Int &p){
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }
    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }
    Mod_Int &operator ++ () {return *this += Mod_Int(1);}
    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }
    Mod_Int &operator -- () {return *this -= Mod_Int(1);}
    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }
    Mod_Int operator - () const {return Mod_Int(-x);}
    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}
    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}
    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}
    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}
    bool operator == (const Mod_Int &p) const {return x == p.x;}
    bool operator != (const Mod_Int &p) const {return x != p.x;}
    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }
    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        for(; k; k >>= 1, now *= now){
            if(k&1) ret *= now;
        }
        return ret;
    }
    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }
    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};
using mint = Mod_Int<MOD>;
int main(){
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) cin >> A[i];
    int M = 0;
    while(M*M < N) M++;
    vector<mint> dp(N, 0);
    vector<vector<mint>> memo;
    rep(i, M+1) memo.eb(i, 0);
    dp[0] = 1;
    rep(i, N){
        rep2(j, 1, M){
            dp[i] += memo[j][i%j];
        }
        if(i == N-1) break;
        if(A[i] != 1) dp[i+1] += dp[i];
        if(A[i] <= M){
            memo[A[i]][i%A[i]] += dp[i];
        }
        else{
            int ptr = i+A[i];
            while(ptr < N){
                dp[ptr] += dp[i];
                ptr += A[i];
            }
        }
    }
    cout << dp[N-1] << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0