結果

問題 No.1331 Moving Penguin
ユーザー ningenMeningenMe
提出日時 2021-01-08 22:34:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 3,530 bytes
コンパイル時間 3,233 ms
コンパイル使用メモリ 223,436 KB
実行使用メモリ 10,496 KB
最終ジャッジ日時 2024-11-16 13:32:23
合計ジャッジ時間 37,301 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
10,496 KB
testcase_01 AC 2 ms
9,856 KB
testcase_02 AC 2 ms
10,496 KB
testcase_03 AC 1 ms
9,856 KB
testcase_04 AC 14 ms
10,496 KB
testcase_05 AC 395 ms
5,248 KB
testcase_06 AC 398 ms
5,248 KB
testcase_07 AC 401 ms
5,248 KB
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 AC 11 ms
5,248 KB
testcase_21 AC 11 ms
5,248 KB
testcase_22 AC 11 ms
5,248 KB
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 AC 15 ms
5,248 KB
testcase_27 AC 14 ms
5,248 KB
testcase_28 AC 14 ms
5,248 KB
testcase_29 AC 13 ms
5,248 KB
testcase_30 AC 5 ms
5,248 KB
testcase_31 AC 9 ms
5,248 KB
testcase_32 AC 5 ms
5,248 KB
testcase_33 AC 7 ms
5,248 KB
testcase_34 AC 10 ms
5,248 KB
testcase_35 AC 48 ms
5,248 KB
testcase_36 AC 50 ms
5,248 KB
testcase_37 AC 50 ms
5,248 KB
testcase_38 AC 6 ms
5,248 KB
testcase_39 AC 15 ms
5,248 KB
testcase_40 AC 8 ms
5,248 KB
testcase_41 AC 52 ms
5,248 KB
testcase_42 AC 48 ms
5,248 KB
testcase_43 AC 48 ms
5,248 KB
testcase_44 AC 49 ms
5,248 KB
testcase_45 AC 47 ms
5,248 KB
testcase_46 AC 46 ms
5,248 KB
testcase_47 AC 47 ms
5,248 KB
testcase_48 AC 12 ms
9,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


array<int  ,100000> A;
array<int64,100000> dp={};

/**
 * @url 
 * @est
 */ 
int main() {
    int N; cin >> N;
    for(int i=0;i<N;++i) scanf("%d",&A[i]);
    dp[0]=1;
    int64 sum = 0;
    for(int i=0;i+1<N;++i) {
        if(A[i]==1) {
            sum += dp[i];
            sum %= MOD;
        }
        else {
            for(int j=i+A[i];j<N;j+=A[i]) {
                dp[j]+=dp[i];
                dp[j]%=MOD;
            }
            dp[i+1]+=dp[i];
        }
        dp[i+1] += sum;
    }
    printf("%lld\n",dp[N-1]%MOD);
    return 0;
}
0