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

• 問題: No.1331 Moving Penguin
• ユーザー: eQe
• 提出日時: 2021-11-13 02:10:14
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 386 ms / 1,500 ms
• コード長: 2,504 bytes
• コンパイル時間: 4,218 ms
• コンパイル使用メモリ: 257,664 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-25 05:20:35
• 合計ジャッジ時間: 19,534 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	8 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	318 ms; 5,376 KB
testcase_05	AC	329 ms; 5,376 KB
testcase_06	AC	326 ms; 5,376 KB
testcase_07	AC	330 ms; 5,376 KB
testcase_08	AC	327 ms; 5,376 KB
testcase_09	AC	319 ms; 5,376 KB
testcase_10	AC	320 ms; 5,376 KB
testcase_11	AC	318 ms; 5,376 KB
testcase_12	AC	330 ms; 5,376 KB
testcase_13	AC	319 ms; 5,376 KB
testcase_14	AC	317 ms; 5,376 KB
testcase_15	AC	321 ms; 5,376 KB
testcase_16	AC	321 ms; 5,376 KB
testcase_17	AC	320 ms; 5,376 KB
testcase_18	AC	321 ms; 5,376 KB
testcase_19	AC	324 ms; 5,376 KB
testcase_20	AC	323 ms; 5,376 KB
testcase_21	AC	320 ms; 5,376 KB
testcase_22	AC	320 ms; 5,376 KB
testcase_23	AC	324 ms; 5,376 KB
testcase_24	AC	318 ms; 5,376 KB
testcase_25	AC	323 ms; 5,376 KB
testcase_26	AC	324 ms; 5,376 KB
testcase_27	AC	322 ms; 5,376 KB
testcase_28	AC	328 ms; 5,376 KB
testcase_29	AC	322 ms; 5,376 KB
testcase_30	AC	62 ms; 5,376 KB
testcase_31	AC	139 ms; 5,376 KB
testcase_32	AC	53 ms; 5,376 KB
testcase_33	AC	96 ms; 5,376 KB
testcase_34	AC	179 ms; 5,376 KB
testcase_35	AC	326 ms; 5,376 KB
testcase_36	AC	332 ms; 5,376 KB
testcase_37	AC	340 ms; 5,376 KB
testcase_38	AC	69 ms; 5,376 KB
testcase_39	AC	308 ms; 5,376 KB
testcase_40	AC	120 ms; 5,376 KB
testcase_41	AC	324 ms; 5,376 KB
testcase_42	AC	335 ms; 5,376 KB
testcase_43	AC	336 ms; 5,376 KB
testcase_44	AC	373 ms; 5,376 KB
testcase_45	AC	386 ms; 5,376 KB
testcase_46	AC	384 ms; 5,376 KB
testcase_47	AC	341 ms; 5,376 KB
testcase_48	AC	317 ms; 5,376 KB

ソースコード

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
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;}

istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint& x) { os << x.val(); return os; }

template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class 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<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }

static const ll INF=1e18+7;
static const double PI=acos(-1);
static const double EPS=1e-10;

using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;

int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N;cin>>N;
  v1 a(N+1);for(ll i=1;i<=N;i++)cin>>a[i];
  
  using mint=modint1000000007;
  vector<mint> dp(N+1);
  ll LIM=sqrt(N);
  vector<vector<mint>> s(LIM+1,vector<mint>(LIM+1));
  dp[1]=1;
  for(ll i=1;i<=N;i++){
    for(ll j=1;j<=LIM;j++)dp[i]+=s[i%j][j];
    
    if(a[i]>1 and i+1<=N)dp[i+1]+=dp[i];
    
    if(a[i]<=LIM)s[i%a[i]][a[i]]+=dp[i];
    else for(ll j=i+a[i];j<=N;j+=a[i])dp[j]+=dp[i];
    
  }
  pt(dp[N]);
  
}