結果
問題 | No.1331 Moving Penguin |
ユーザー | milanis48663220 |
提出日時 | 2021-01-08 22:01:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 502 ms / 1,500 ms |
コード長 | 2,847 bytes |
コンパイル時間 | 854 ms |
コンパイル使用メモリ | 97,012 KB |
実行使用メモリ | 317,268 KB |
最終ジャッジ日時 | 2023-08-07 10:47:17 |
合計ジャッジ時間 | 22,308 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 99 ms
316,732 KB |
testcase_01 | AC | 93 ms
316,736 KB |
testcase_02 | AC | 91 ms
316,664 KB |
testcase_03 | AC | 92 ms
316,664 KB |
testcase_04 | AC | 468 ms
317,156 KB |
testcase_05 | AC | 467 ms
317,068 KB |
testcase_06 | AC | 461 ms
317,068 KB |
testcase_07 | AC | 463 ms
317,088 KB |
testcase_08 | AC | 483 ms
317,140 KB |
testcase_09 | AC | 462 ms
316,972 KB |
testcase_10 | AC | 459 ms
317,212 KB |
testcase_11 | AC | 463 ms
316,964 KB |
testcase_12 | AC | 457 ms
316,968 KB |
testcase_13 | AC | 458 ms
316,964 KB |
testcase_14 | AC | 456 ms
317,216 KB |
testcase_15 | AC | 457 ms
317,256 KB |
testcase_16 | AC | 460 ms
317,084 KB |
testcase_17 | AC | 461 ms
317,260 KB |
testcase_18 | AC | 456 ms
317,136 KB |
testcase_19 | AC | 454 ms
317,268 KB |
testcase_20 | AC | 450 ms
317,212 KB |
testcase_21 | AC | 449 ms
317,140 KB |
testcase_22 | AC | 452 ms
317,020 KB |
testcase_23 | AC | 455 ms
317,072 KB |
testcase_24 | AC | 453 ms
316,960 KB |
testcase_25 | AC | 453 ms
317,088 KB |
testcase_26 | AC | 463 ms
317,084 KB |
testcase_27 | AC | 464 ms
317,084 KB |
testcase_28 | AC | 461 ms
317,172 KB |
testcase_29 | AC | 463 ms
317,092 KB |
testcase_30 | AC | 152 ms
316,732 KB |
testcase_31 | AC | 236 ms
316,704 KB |
testcase_32 | AC | 139 ms
316,804 KB |
testcase_33 | AC | 187 ms
316,700 KB |
testcase_34 | AC | 283 ms
317,000 KB |
testcase_35 | AC | 477 ms
317,084 KB |
testcase_36 | AC | 477 ms
317,140 KB |
testcase_37 | AC | 477 ms
317,084 KB |
testcase_38 | AC | 157 ms
316,716 KB |
testcase_39 | AC | 445 ms
317,172 KB |
testcase_40 | AC | 212 ms
316,860 KB |
testcase_41 | AC | 459 ms
317,072 KB |
testcase_42 | AC | 487 ms
317,084 KB |
testcase_43 | AC | 487 ms
317,172 KB |
testcase_44 | AC | 485 ms
317,084 KB |
testcase_45 | AC | 500 ms
317,192 KB |
testcase_46 | AC | 502 ms
317,024 KB |
testcase_47 | AC | 499 ms
316,956 KB |
testcase_48 | AC | 458 ms
317,172 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <set> #include <map> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; const ll MOD = 1000000007; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } void operator+=(ll n){ v = (v+n)%MOD; } void operator-=(ll n){ v = (v-n+MOD)%MOD; } void operator*=(ll n){ v = (v*n)%MOD; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } void operator+=(ModInt n){ v = (v+n.v)%MOD; } void operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; } void operator*=(ModInt n){ v = (v*n.v)%MOD; } void operator=(ModInt n){ v = n.v; } void operator=(ll n){ v = n; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt dp_rem[400][100001]; ModInt dp[100001]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; ll n; cin >> n; vector<ll> a(n); for(int i = 0; i < n; i++) cin >> a[i]; dp[0] = 1; for(int i = 0; i < n; i++){ if(i != 0 && a[i-1] != 1) dp[i] += dp[i-1]; for(int j = 1; j*j <= n; j++) { dp[i] += dp_rem[j][i]; } if(a[i]*a[i] <= n){ dp_rem[a[i]][i] += dp[i]; }else{ for(int j = i+a[i]; j < n; j+= a[i]){ dp[j] += dp[i]; } } for(int j = 1; j*j <= n; j++) { dp_rem[j][i+j] += dp_rem[j][i]; } } cout << dp[n-1] << endl; }