結果
問題 | No.1331 Moving Penguin |
ユーザー | firiexp |
提出日時 | 2021-01-08 22:30:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 344 ms / 1,500 ms |
コード長 | 3,238 bytes |
コンパイル時間 | 1,300 ms |
コンパイル使用メモリ | 105,552 KB |
最終ジャッジ日時 | 2025-01-17 12:48:18 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:62:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 62 | for (auto &&i : v) scanf("%d", &i); | ~~~~~^~~~~~~~~~
ソースコード
#include <iostream>#include <algorithm>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = unsigned;using u64 = unsigned long long;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;template <u32 M>struct modint {u32 val;public:static modint raw(int v) { modint x; x.val = v; return x; }modint() : val(0) {}template <class T>modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); }modint(bool v) { val = ((unsigned int)(v) % M); }modint& operator++() { val++; if (val == M) val = 0; return *this; }modint& operator--() { if (val == 0) val = M; val--; return *this; }modint operator++(int) { modint result = *this; ++*this; return result; }modint operator--(int) { modint result = *this; --*this; return result; }modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; }modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; }modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; }modint& operator/=(const modint& b) { return *this = *this * b.inv(); }modint operator+() const { return *this; }modint operator-() const { return modint() - *this; }modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }modint inv() const { return pow(M-2); }friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; }friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; }friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; }friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; }friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; }friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; }};using mint = modint<MOD>;template <class T, class U>vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }template<class... Ts, class U>auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }int main() {int n;cin >> n;vector<int> v(n);for (auto &&i : v) scanf("%d", &i);int M = 200;auto dp = make_v(M+1, n, mint(0));vector<mint> ans(n);ans[0] = 1;for (int i = 0; i < n; ++i) {for (int j = 0; j <= M; ++j) {if(i >= j) dp[j][i] += dp[j][i-j];ans[i] += dp[j][i];}if(v[i] <= M) dp[v[i]][i] += ans[i];else {for (int j = i+v[i]; j < n; j += v[i]) {ans[j] += ans[i];}}if(i+1 < n && v[i] != 1) ans[i+1] += ans[i];}cout << ans.back().val << "\n";return 0;}