結果
問題 | No.1331 Moving Penguin |
ユーザー | Kite_kuma |
提出日時 | 2021-01-08 21:58:50 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 380 ms / 1,500 ms |
コード長 | 11,643 bytes |
コンパイル時間 | 1,990 ms |
コンパイル使用メモリ | 179,440 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 14:39:17 |
合計ジャッジ時間 | 18,746 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
/* author: Kite_kumacreated: 2021.01.08 21:37:23 */// #ifdef LOCAL// #define _GLIBCXX_DEBUG// #endif#include <bits/stdc++.h>using namespace std;#pragma region aliases#define rep(i, n) for(long long i = 0; i < (n); i++)#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)#define Rep(i, m, n) for(long long i = (m); i < (n); i++)#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)#define REP(i, m, n, p) for(long long i = m; i < n; i += p)#define foa(s, v) for(auto &s : v)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()#define bcnt(n) __builtin_popcountll(n)using ll = long long;using ld = long double;using ull = unsigned long long;using vb = vector<bool>;using vi = vector<int>;using vvi = vector<vector<int>>;using vvvi = vector<vector<vector<int>>>;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;template <class T = ll>using V = vector<T>;template <class T = ll>using VV = V<V<T>>;template <class T = ll>using VVV = V<V<V<T>>>;template <class T = ll>using pqup = priority_queue<T, vector<T>, greater<T>>;template <class T = ll>using pqdn = priority_queue<T>;#pragma endregion#pragma region constantslong long const dekai = 1e18;const long double pi = acos(-1);const char dl = '\n';const char sp = ' ';int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};const int mod = 1000000007;// const int mod = 998244353;#pragma endregion#pragma region basic_proceduretemplate <class T>inline bool isin(T x, T lef, T rig) {return ((lef <= x) && (x < rig));}template <class T>inline bool chmin(T &a, T b) {if(a > b) {a = b;return true;}return false;}template <class T>inline bool chmax(T &a, T b) {if(a < b) {a = b;return true;}return false;}void Yes(bool f = 1) { cout << (f ? "Yes" : "No") << '\n'; }void No() { cout << "No\n"; }void YES(bool f = 1) { cout << (f ? "YES" : "NO") << '\n'; }void NO() { cout << "NO\n"; }template <class T>void drop(T answer) {cout << answer << '\n';exit(0);}void err(bool flag) {if(!flag) return;cout << -1 << '\n';exit(0);}template <class T>void vout(vector<T> const &v, bool tate = 0) {if(tate) {for(auto const &a : v) {cout << a << '\n';}return;}for(auto it = v.begin(); it != v.end(); it++) {cout << (*it);if(it != v.end() - 1) {cout << ' ';}}cout << '\n';return;}inline void print() { cout << '\n'; }template <class T>inline void print(T x) {cout << x << '\n';return;}template <typename Head, typename... Tail>void print(Head H, Tail... T) {cout << H << " ";print(T...);}template <class T>void add(vector<T> &v, T val) {for(auto &a : v) a += val;return;}template <class T>T dup(T a, T b) {assert(b != 0);T x = abs(a);T y = abs(b);T z = (x + y - 1) / y;if((a < 0 && b > 0) || (a > 0 && b < 0))return -z;else if(a == 0)return 0;elsereturn z;}template <class T>T greatest_lower_multiple(T x, T d) {if(d == 0) return 0;if(d < 0) d *= -1;T y = x % d;if(y < 0) y += d;return x - y;}template <class T>T least_upper_multiple(T x, T d) {return -greatest_lower_multiple(-x, d);}long long POW(long long a, long long n) {long long res = 1;while(n > 0) {if(n & 1) res = res * a;a = a * a;n >>= 1;}return res;}long long modpow(long long a, long long n, long long mod) { // a^n modassert(n >= 0);if(mod == 1) return 0LL;long long res = 1;while(n > 0) {if(n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}// a * x % mod == __gcd(a,mod)なるxを返す// a が modの倍数でないことが条件long long modinv(long long a, long long mod) {long long b = mod, u = 1, v = 0;while(b) {long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}u %= mod;if(u < 0) u += mod;return u;}vvll comb(100, vll(100, -1));long long com(long long n, long long k) { //普通の二項計数assert(n < 100 && k < 100);if(n < k || k < 0 || n < 0) return 0;if(comb[n][k] != -1) return comb[n][k];ll res;if(n - k < k)res = com(n, n - k);else if(k == 0)res = 1;elseres = com(n - 1, k - 1) + com(n - 1, k);comb[n][k] = res;return res;}const int MAX = 5100000; // about 300ms, when MAX = 3*10^7 : 1900mslong long fac[MAX], finv[MAX], inv[MAX];void cominit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for(int i = 2; i < MAX; i++) {fac[i] = fac[i - 1] * i % mod;inv[i] = mod - inv[mod % i] * (mod / i) % mod;finv[i] = finv[i - 1] * inv[i] % mod;}}long long commod(long long n, long long k) {if(n < k) return 0;if(n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % mod) % mod;}long long pmod(long long n, long long k) {if(n < k) return 0;if(n < 0 || k < 0) return 0;return fac[n] * finv[n - k] % mod;}// n個の区別しないボールを区別するk個の箱に入れる方法の総数long long hmod(long long n, long long k) { // 重複組み合わせreturn commod(n + k - 1, n);}#pragma endregion#pragma region input#define VEC(type, name, size) \vector<type> name(size); \INPUT(name)#define VVEC(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \INPUT(name)#define INT(...) \int __VA_ARGS__; \INPUT(__VA_ARGS__)#define LL(...) \long long __VA_ARGS__; \INPUT(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \INPUT(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \INPUT(__VA_ARGS__)#define DOUBLE(...) \double __VA_ARGS__; \INPUT(__VA_ARGS__)#define LD(...) \long double __VA_ARGS__; \INPUT(__VA_ARGS__)template <class T>void scan(T &a) {cin >> a;}template <class T>void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T, class L>void scan(pair<T, L> &p) {scan(p.first);scan(p.second);}void INPUT() {}template <class Head, class... Tail>void INPUT(Head &head, Tail &... tail) {scan(head);INPUT(tail...);}template <typename T1, typename T2>istream &operator>>(istream &is, pair<T1, T2> &p) {is >> p.first >> p.second;return is;}#pragma endregion#pragma region debug#pragma region outputtemplate <typename T1, typename T2>std::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {os << p.first << " " << p.second;return os;}template <class T>std::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {for(int i = 0; i < (int)v.size(); i++) {if(i) os << " ";os << v[i];}return os;}#pragma endregion#pragma region viewtemplate <typename T>void view(const T e) {std::cerr << e;}template <typename T, typename U>void view(const std::pair<T, U> &p) {std::cerr << "(";view(p.first);std::cerr << ", ";view(p.second);std::cerr << ")";}template <typename T>void view(const std::set<T> &s) {if(s.empty()) {std::cerr << "{ }";return;}std::cerr << "{ ";for(auto &t : s) {view(t);std::cerr << ", ";}std::cerr << "\b\b }";}template <typename T>void view(const std::unordered_set<T> &s) {if(s.empty()) {std::cerr << "{ }";return;}std::cerr << "{ ";for(auto &t : s) {view(t);std::cerr << ", ";}std::cerr << "\b\b }";}template <typename T>void view(const std::vector<T> &v) {if(v.empty()) {std::cerr << "{ }";return;}std::cerr << "{ ";for(const auto &e : v) {view(e);std::cerr << ", ";}std::cerr << "\b\b }";}template <typename T>void view(const std::vector<std::vector<T>> &vv) {std::cerr << "{\n";for(const auto &v : vv) {std::cerr << "\t";view(v);std::cerr << '\n';}std::cerr << "}";}template <typename T, typename U>void view(const std::vector<std::pair<T, U>> &v) {std::cerr << "{\n";for(const auto &c : v) {std::cerr << "\t(";view(c.first);std::cerr << ", ";view(c.second);std::cerr << ")\n";}std::cerr << "}";}template <typename T, typename U>void view(const std::map<T, U> &m) {std::cerr << "{\n";for(const auto &t : m) {std::cerr << "\t[";view(t.first);std::cerr << "] : ";view(t.second);std::cerr << '\n';}std::cerr << "}";}template <typename T, typename U>void view(const std::unordered_map<T, U> &m) {std::cerr << "{\n";for(const auto &t : m) {std::cerr << "\t[";view(t.first);std::cerr << "] : ";view(t.second);std::cerr << '\n';}std::cerr << "}";}#pragma endregion// when debugging : g++ foo.cpp -DLOCAL#ifdef LOCALvoid debug_out() {}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {view(H);std::cerr << ", ";debug_out(T...);}#define debug(...) \do { \std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \debug_out(__VA_ARGS__); \std::cerr << "\b\b]\n"; \} while(0)#define dump(x) \do { \std::cerr << __LINE__ << " " << #x << " : "; \view(x); \std::cerr << '\n'; \} while(0)#else#define debug(...) (void(0))#define dump(x) (void(0))#endif#pragma endregion#pragma region modinttemplate <int mod>struct ModInt {int x;ModInt() : x(0) {}ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int)(1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(long long n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }friend istream &operator>>(istream &is, ModInt &a) {long long t;is >> t;a = ModInt<mod>(t);return (is);}static int get_mod() { return mod; }};using mint = ModInt<mod>;#pragma endregionint main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);srand((unsigned)time(NULL));INT(n);VEC(int, a, n);int rt = 330;#ifdef LOCALrt = 3;#endifV<mint> dp(n, 0);dp[0] = 1;VV<mint> add(rt, V<mint>(rt));// debug(dp);rep(i, n) {debug(dp);debug(add);int now = a[i];mint& tmp = dp[i];Rep(j, 1, rt) {int amari = i % j;tmp += add[j][amari];}if(now < rt) {add[now][i % now] += tmp;} else {REP(j, i+now, n, now) { dp[j] += tmp; }}if(now != 1 && i < n - 1) {dp[i + 1] += tmp;}}debug(dp);drop(dp[n - 1]);return 0;}