結果
| 問題 | No.1331 Moving Penguin |
| ユーザー |
 kyoprouno
|
| 提出日時 | 2021-01-09 15:48:03 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 245 ms / 1,500 ms |
| コード長 | 6,275 bytes |
| コンパイル時間 | 2,305 ms |
| コンパイル使用メモリ | 181,320 KB |
| 実行使用メモリ | 5,760 KB |
| 最終ジャッジ日時 | 2024-11-07 15:03:57 |
| 合計ジャッジ時間 | 11,571 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 49 |
ソースコード
#pragma GCC optimize("O3")#include <bits/stdc++.h>using namespace std;#ifdef LOCAL#define _GLIBCXX_DEBUG#endif#pragma region Macros#define FOR(i, l, r) for(int i = (l) ;i < (r) ;i++)#define REP(i, n) FOR(i, 0, n)#define REPS(i, n) FOR(i, 1, n+1)#define RFOR(i, l, r) for(int i = (l) ; i >= (r) ; i--)#define RREP(i, n) RFOR(i, n - 1, 0)#define RREPS(i, n) RFOR(i, n , 1)#define SZ(x) ((int)(x).size())#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()template <class T = int>using V = vector<T>;template <class T = int>using VV = V<V<T>>;#define ll long longusing ld = long double;#define pll pair<ll,ll>#define pii pair<int,int>#define pq priority_queue#define pb push_back#define eb emplace_back#define fi first#define se second#define endl '\n'#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))#define VEC(type, name, size) \V<type> name(size); \INPUT(name)#define VVEC(type, name, h, w) \VV<type> name(h, V<type>(w)); \INPUT(name)#define INT(...) \int __VA_ARGS__; \INPUT(__VA_ARGS__)#define LL(...) \ll __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(...) \LD __VA_ARGS__; \INPUT(__VA_ARGS__)void scan(int &a) { cin >> a;}void scan(long long &a) { cin >> a;}void scan(char &a) { cin >> a;}void scan(double &a) { cin >> a;}void scan(long double &a) { cin >> a;}void scan(char a[]) { scanf("%s", a);}void scan(string &a) { cin >> a;}template <class T>void scan(V<T> &);template <class T, class L>void scan(pair<T, L> &);template <class T>void scan(V<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);}template <class T>void scan(T &a) { cin >> a;}void INPUT() {}template <class Head, class... Tail>void INPUT(Head &head, Tail &... tail){scan(head);INPUT(tail...);}template <class T>inline void print(T x) { cout << x << '\n'; }template <typename T1, typename T2>istream &operator>>(istream &is, pair<T1, T2> &p) {is >> p.first >> p.second;return is;}template <typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2> &p) {os << p.first << " " << p.second;return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for(T &in : v) is >> in;return is;}template <class T>ostream &operator<<(ostream &os, const V<T> &v) {REP(i, SZ(v)) {if(i) os << " ";os << v[i];}return os;}//debugtemplate <typename T>void view(const V<T> &v) {cerr << "{ ";for(const auto &e : v) {cerr << e << ", ";}cerr << "\b\b }";}template <typename T>void view(const VV<T> &vv) {cerr << "{\n";for(const auto &v : vv) {cerr << "\t";view(v);cerr << "\n";}cerr << "}";}template <typename T, typename U>void view(const V<pair<T, U>> &v) {cerr << "{\n";for(const auto &c : v) cerr << "\t(" << c.first << ", " << c.second << ")\n";cerr << "}";}template <typename T, typename U>void view(const map<T, U> &m) {cerr << "{\n";for(auto &t : m) cerr << "\t[" << t.first << "] : " << t.second << "\n";cerr << "}";}template <typename T, typename U>void view(const pair<T, U> &p) { cerr << "(" << p.first << ", " << p.second << ")"; }template <typename T>void view(const set<T> &s) {cerr << "{ ";for(auto &t : s) {view(t);cerr << ", ";}cerr << "\b\b }";}template <typename T>void view(T e) { cerr << e; }#ifdef LOCALvoid debug_out() {}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {view(H);cerr << ", ";debug_out(T...);}#define debug(...) \do { \cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \debug_out(__VA_ARGS__); \cerr << "\b\b]\n"; \} while(0)#else#define debug(...) (void(0))#endiftemplate <class T>V<T> press(V<T> &x) {V<T> res = x;sort(all(res));res.erase(unique(all(res)), res.end());REP(i, SZ(x)) {x[i] = lower_bound(all(res), x[i]) - res.begin();}return res;}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;}inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }inline void err(bool b = true) {if(b) {cout << -1 << '\n';exit(0);}}template <class T>inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n';exit(0);}}template <class T>T divup(T x, T y) { return (x + (y - 1)) / y; }template <typename T>T pow(T a, long long n, T e = 1) {T ret = e;while(n) {if(n & 1) ret *= a;a *= a;n >>= 1;}return ret;}struct iofast {iofast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);}} iofast_;const int inf = 1e9;const ll INF = 1e18;#pragma endregioninline int topbit(unsigned long long x){return x?63-__builtin_clzll(x):-1;}inline int popcount(unsigned long long x){return __builtin_popcountll(x);}inline int parity(unsigned long long x){//popcount%2return __builtin_parity(x);}const ll mod=1e9+7;int main(){LL(N);ll K=sqrt(N);VEC(ll,A,N);VV<ll> sum(K+1,V<ll>(K+1));V<ll> dp(N);dp[0]=1;REP(i,N){if(i && A[i-1]!=1) dp[i]+=dp[i-1];dp[i]%=mod;REP(j,K+1){if(j==0) continue;dp[i]+=sum[j][i%j];dp[i]%=mod;}if(A[i]<=K){sum[A[i]][i%A[i]]+=dp[i];sum[A[i]][i%A[i]]%=mod;}else{for(ll j=i+A[i];j<N;j+=A[i]){dp[j]+=dp[i];dp[j]%=mod;}}}cout << dp[N-1] << endl;return 0;}