#600969 (C++17) No.1331 Moving Penguin

• 問題: No.1331 Moving Penguin
• ユーザー: rniya
• 提出日時: 2021-01-08 22:08:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 298 ms / 1,500 ms
• コード長: 6,654 bytes
• コンパイル時間: 3,126 ms
• コンパイル使用メモリ: 206,088 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-07 14:44:20
• 合計ジャッジ時間: 12,353 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	15 ms; 5,248 KB
testcase_01	AC	3 ms; 5,248 KB
testcase_02	AC	3 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	177 ms; 5,248 KB
testcase_05	AC	266 ms; 5,248 KB
testcase_06	AC	267 ms; 5,248 KB
testcase_07	AC	267 ms; 5,248 KB
testcase_08	AC	178 ms; 5,248 KB
testcase_09	AC	178 ms; 5,248 KB
testcase_10	AC	179 ms; 5,248 KB
testcase_11	AC	179 ms; 5,248 KB
testcase_12	AC	178 ms; 5,248 KB
testcase_13	AC	179 ms; 5,248 KB
testcase_14	AC	186 ms; 5,248 KB
testcase_15	AC	188 ms; 5,248 KB
testcase_16	AC	185 ms; 5,248 KB
testcase_17	AC	177 ms; 5,248 KB
testcase_18	AC	177 ms; 5,248 KB
testcase_19	AC	177 ms; 5,248 KB
testcase_20	AC	177 ms; 5,248 KB
testcase_21	AC	177 ms; 5,248 KB
testcase_22	AC	176 ms; 5,248 KB
testcase_23	AC	179 ms; 5,248 KB
testcase_24	AC	177 ms; 5,248 KB
testcase_25	AC	181 ms; 5,248 KB
testcase_26	AC	184 ms; 5,248 KB
testcase_27	AC	182 ms; 5,248 KB
testcase_28	AC	186 ms; 5,248 KB
testcase_29	AC	178 ms; 5,248 KB
testcase_30	AC	62 ms; 5,248 KB
testcase_31	AC	105 ms; 5,248 KB
testcase_32	AC	56 ms; 5,248 KB
testcase_33	AC	83 ms; 5,248 KB
testcase_34	AC	124 ms; 5,248 KB
testcase_35	AC	295 ms; 5,248 KB
testcase_36	AC	296 ms; 5,248 KB
testcase_37	AC	298 ms; 5,248 KB
testcase_38	AC	65 ms; 5,248 KB
testcase_39	AC	177 ms; 5,248 KB
testcase_40	AC	93 ms; 5,248 KB
testcase_41	AC	273 ms; 5,248 KB
testcase_42	AC	197 ms; 5,248 KB
testcase_43	AC	199 ms; 5,248 KB
testcase_44	AC	200 ms; 5,248 KB
testcase_45	AC	183 ms; 5,248 KB
testcase_46	AC	183 ms; 5,248 KB
testcase_47	AC	183 ms; 5,248 KB
testcase_48	AC	177 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
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,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    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();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    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;
    }
    constexpr modint &operator++() noexcept {if (++v==mod) v=0; return *this;}
    constexpr modint &operator--() noexcept {if (v==0) v=mod; return --v,*this;}
    constexpr modint operator++(int) noexcept {modint t=*this; return ++*this,t;}
    constexpr modint operator--(int) noexcept {modint t=*this; return --*this,t;}
    constexpr modint operator-() const noexcept {return modint(mod-v);}
    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 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;
    }
};

const int MAX=400;
using mint=modint<MOD>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N; cin >> N;
    vector<int> A(N); cin >> A;

    vector<mint> dp(N,0);
    vector<vector<mint>> sum(MAX,vector<mint>(MAX,0));
    dp[0]=1;
    for (int i=0;i<N;++i){
        for (int j=1;j<MAX;++j) dp[i]+=sum[j][i%j];
        if (i&&A[i-1]!=1) dp[i]+=dp[i-1];
        if (A[i]<MAX) sum[A[i]][i%A[i]]+=dp[i];
        else for (int j=i+A[i];j<N;j+=A[i]) dp[j]+=dp[i];
    }

    cout << dp[N-1] << '\n';
}