#601974 (C++14) No.1331 Moving Penguin

• 問題: No.1331 Moving Penguin
• ユーザー: Enjapma_kyopro
• 提出日時: 2021-01-09 18:32:35
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 191 ms / 1,500 ms
• コード長: 3,318 bytes
• コンパイル時間: 1,812 ms
• コンパイル使用メモリ: 167,568 KB
• 実行使用メモリ: 5,504 KB
• 最終ジャッジ日時: 2024-04-25 05:05:19
• 合計ジャッジ時間: 8,793 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	11 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	117 ms; 5,504 KB
testcase_05	AC	114 ms; 5,504 KB
testcase_06	AC	114 ms; 5,376 KB
testcase_07	AC	114 ms; 5,504 KB
testcase_08	AC	114 ms; 5,504 KB
testcase_09	AC	116 ms; 5,376 KB
testcase_10	AC	114 ms; 5,504 KB
testcase_11	AC	114 ms; 5,504 KB
testcase_12	AC	113 ms; 5,376 KB
testcase_13	AC	111 ms; 5,376 KB
testcase_14	AC	113 ms; 5,504 KB
testcase_15	AC	112 ms; 5,376 KB
testcase_16	AC	113 ms; 5,504 KB
testcase_17	AC	113 ms; 5,376 KB
testcase_18	AC	111 ms; 5,504 KB
testcase_19	AC	114 ms; 5,504 KB
testcase_20	AC	113 ms; 5,504 KB
testcase_21	AC	113 ms; 5,504 KB
testcase_22	AC	114 ms; 5,376 KB
testcase_23	AC	111 ms; 5,376 KB
testcase_24	AC	116 ms; 5,376 KB
testcase_25	AC	114 ms; 5,376 KB
testcase_26	AC	118 ms; 5,376 KB
testcase_27	AC	116 ms; 5,504 KB
testcase_28	AC	119 ms; 5,504 KB
testcase_29	AC	116 ms; 5,376 KB
testcase_30	AC	39 ms; 5,376 KB
testcase_31	AC	66 ms; 5,376 KB
testcase_32	AC	36 ms; 5,376 KB
testcase_33	AC	52 ms; 5,376 KB
testcase_34	AC	81 ms; 5,376 KB
testcase_35	AC	188 ms; 5,376 KB
testcase_36	AC	189 ms; 5,376 KB
testcase_37	AC	191 ms; 5,376 KB
testcase_38	AC	44 ms; 5,376 KB
testcase_39	AC	113 ms; 5,376 KB
testcase_40	AC	59 ms; 5,376 KB
testcase_41	AC	190 ms; 5,376 KB
testcase_42	AC	187 ms; 5,376 KB
testcase_43	AC	191 ms; 5,376 KB
testcase_44	AC	185 ms; 5,376 KB
testcase_45	AC	182 ms; 5,504 KB
testcase_46	AC	186 ms; 5,376 KB
testcase_47	AC	185 ms; 5,504 KB
testcase_48	AC	114 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>

using namespace std;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll> > Pd;

const ll INF = 1e18;
const ll fact_table = 3200008;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
// priority_queue <ll, vector<ll>, greater<ll> > pqls;
// priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/

#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/

bool icpc = false;
bool multicase = false;

ll n, m, p;
ll h, w;

ll x[100005];
ll dp[100005];
ll dpsum[205][205];

bool solve() {
    cin >> n;
    dp[n] = 1;
    for (int i = 1; i <= n; i++) {
        cin >> x[i];
    }
    for (int i = n; i >= 1; i--) {
        if (i < n) {
            ll res = 0;
            if (x[i] <= 200) {
                res = dpsum[x[i]][i % x[i]];
            } else {
                for (int j = i + x[i]; j <= n; j += x[i]) {
                    res += dp[j];
                    res %= mod;
                }
            }
            dp[i] = res;
        }
        if (x[i] > 1) {
            dp[i] += dp[i + 1];
            dp[i] %= mod;
        }
        for (int j = 1; j <= 200; j++) {
            dpsum[j][i % j] += dp[i];
            dpsum[j][i % j] %= mod;
        }
    }
    p(dp[1]);
    return true;
}

int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    if (icpc) {
        while (solve());
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }

// solve();
    return 0;
}