結果
問題 | No.1331 Moving Penguin |
ユーザー | Forested |
提出日時 | 2021-01-08 21:39:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,947 bytes |
コンパイル時間 | 2,199 ms |
コンパイル使用メモリ | 208,004 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-04-28 02:28:28 |
合計ジャッジ時間 | 13,153 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
6,816 KB |
testcase_01 | AC | 3 ms
6,940 KB |
testcase_02 | AC | 3 ms
6,940 KB |
testcase_03 | RE | - |
testcase_04 | AC | 206 ms
6,940 KB |
testcase_05 | AC | 301 ms
6,944 KB |
testcase_06 | AC | 298 ms
6,944 KB |
testcase_07 | AC | 298 ms
6,944 KB |
testcase_08 | AC | 201 ms
6,944 KB |
testcase_09 | AC | 203 ms
6,940 KB |
testcase_10 | AC | 202 ms
6,940 KB |
testcase_11 | AC | 204 ms
6,944 KB |
testcase_12 | AC | 204 ms
6,944 KB |
testcase_13 | AC | 206 ms
6,940 KB |
testcase_14 | AC | 211 ms
6,940 KB |
testcase_15 | AC | 211 ms
6,940 KB |
testcase_16 | AC | 211 ms
6,940 KB |
testcase_17 | AC | 203 ms
6,940 KB |
testcase_18 | AC | 203 ms
6,948 KB |
testcase_19 | AC | 204 ms
6,944 KB |
testcase_20 | AC | 200 ms
6,944 KB |
testcase_21 | AC | 201 ms
6,940 KB |
testcase_22 | AC | 203 ms
6,940 KB |
testcase_23 | AC | 207 ms
6,944 KB |
testcase_24 | AC | 206 ms
6,940 KB |
testcase_25 | AC | 209 ms
6,944 KB |
testcase_26 | AC | 209 ms
5,376 KB |
testcase_27 | AC | 211 ms
5,376 KB |
testcase_28 | AC | 209 ms
5,376 KB |
testcase_29 | AC | 204 ms
5,376 KB |
testcase_30 | AC | 71 ms
5,376 KB |
testcase_31 | AC | 119 ms
5,376 KB |
testcase_32 | AC | 62 ms
5,376 KB |
testcase_33 | AC | 93 ms
5,376 KB |
testcase_34 | AC | 139 ms
5,376 KB |
testcase_35 | AC | 333 ms
5,376 KB |
testcase_36 | AC | 330 ms
5,376 KB |
testcase_37 | AC | 332 ms
5,376 KB |
testcase_38 | AC | 74 ms
5,376 KB |
testcase_39 | AC | 200 ms
5,376 KB |
testcase_40 | AC | 105 ms
5,376 KB |
testcase_41 | AC | 303 ms
5,376 KB |
testcase_42 | AC | 226 ms
5,376 KB |
testcase_43 | AC | 226 ms
5,376 KB |
testcase_44 | AC | 226 ms
5,376 KB |
testcase_45 | AC | 209 ms
5,376 KB |
testcase_46 | AC | 210 ms
5,376 KB |
testcase_47 | AC | 209 ms
5,376 KB |
testcase_48 | AC | 201 ms
5,376 KB |
ソースコード
// Template #include "bits/stdc++.h" #define rep_override(x, y, z, name, ...) name #define rep2(i, n) for (int i = 0; i < (int)(n); ++i) #define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i) #define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() using namespace std; using ll = long long; constexpr int inf = 1001001001; constexpr ll infll = 3003003003003003003LL; template <typename T> inline bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template <typename T> inline bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &element : vec) is >> element; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) { os << vec[i] << (i + 1 == vec_len ? "" : " "); } return os; } struct IOSET { IOSET() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } ioset; // Mod-Int #include <iostream> #include <type_traits> template <unsigned int mod, std::enable_if_t<mod >= 1u && mod < (1u << 31)> * = nullptr> struct ModInt { unsigned int val; ModInt() : val(0) {} ModInt(long long x) : val(x < 0 ? x % mod + mod : (unsigned long long)x % mod) {} ModInt<mod> &operator+=(const ModInt<mod> &x) { val += x.val; if (val >= mod) val -= mod; return *this; } ModInt<mod> &operator-=(const ModInt<mod> &x) { if (val < x.val) val += mod; val -= x.val; return *this; } ModInt<mod> &operator*=(const ModInt<mod> &x) { unsigned long long s = (unsigned long long)val * x.val; val = (unsigned int)(s % mod); return *this; } ModInt<mod> operator+() const { return *this; } ModInt<mod> operator-() const { return ModInt<mod>(0u) - *this; } friend ModInt<mod> operator+(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) += y; } friend ModInt<mod> operator-(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) -= y; } friend ModInt<mod> operator*(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) *= y; } friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) { is >> x.val; // x.value %= mod; return is; } friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) { os << x.val; return os; } ModInt<mod> pow(unsigned long long x) const { ModInt<mod> res(1), s(*this); while (x) { if (x & 1) res *= s; s *= s; x >>= 1; } return res; } // --- mod is prime --- ModInt<mod> &operator/=(const ModInt<mod> &x) { *this *= x.pow(mod - 2); return *this; } friend ModInt<mod> operator/(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) /= y; } }; using Mint = ModInt<1000000007>; // Main int main() { int n; cin >> n; vector<int> a(n); cin >> a; const int b = 500; vector<vector<Mint>> d(b, vector<Mint>(b, Mint(0))); vector<Mint> dp(n, Mint(0)); dp[0] = Mint(1); rep(i, n) { rep(j, 1, b) { dp[i] += d[j][i % j]; } if (a[i] != 1) { dp[i + 1] += dp[i]; } if (a[i] < b) { d[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"; }