結果
問題 | No.1331 Moving Penguin |
ユーザー | snuke |
提出日時 | 2021-01-08 21:28:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 4,216 bytes |
コンパイル時間 | 1,885 ms |
コンパイル使用メモリ | 214,468 KB |
実行使用メモリ | 646,432 KB |
最終ジャッジ日時 | 2024-04-28 02:03:42 |
合計ジャッジ時間 | 5,709 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 51 ms
15,400 KB |
testcase_05 | MLE | - |
testcase_06 | TLE | - |
testcase_07 | TLE | - |
testcase_08 | AC | 37 ms
21,848 KB |
testcase_09 | AC | 34 ms
21,688 KB |
testcase_10 | AC | 34 ms
21,704 KB |
testcase_11 | AC | 44 ms
27,944 KB |
testcase_12 | AC | 44 ms
27,900 KB |
testcase_13 | AC | 45 ms
27,904 KB |
testcase_14 | AC | 114 ms
71,768 KB |
testcase_15 | AC | 115 ms
71,684 KB |
testcase_16 | AC | 116 ms
71,652 KB |
testcase_17 | AC | 32 ms
20,256 KB |
testcase_18 | AC | 31 ms
19,764 KB |
testcase_19 | AC | 27 ms
17,452 KB |
testcase_20 | AC | 28 ms
18,256 KB |
testcase_21 | AC | 31 ms
19,912 KB |
testcase_22 | AC | 31 ms
19,684 KB |
testcase_23 | AC | 62 ms
40,452 KB |
testcase_24 | AC | 63 ms
40,488 KB |
testcase_25 | AC | 64 ms
40,588 KB |
testcase_26 | AC | 133 ms
42,520 KB |
testcase_27 | AC | 131 ms
41,800 KB |
testcase_28 | AC | 143 ms
46,192 KB |
testcase_29 | AC | 31 ms
9,256 KB |
testcase_30 | AC | 35 ms
14,848 KB |
testcase_31 | AC | 70 ms
27,008 KB |
testcase_32 | AC | 28 ms
12,288 KB |
testcase_33 | AC | 45 ms
19,328 KB |
testcase_34 | AC | 74 ms
27,860 KB |
testcase_35 | TLE | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
ソースコード
#include <bits/stdc++.h> #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define isin(x,l,r) ((l) <= (x) && (x) < (r)) #define pb push_back #define eb emplace_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define uni(x) x.erase(unique(rng(x)),x.end()) #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define show(x) cerr<<#x<<" = "<<x<<endl; #define PQ(T) priority_queue<T,v(T),greater<T> > #define bn(x) ((1<<x)-1) #define dup(x,y) (((x)+(y)-1)/(y)) #define newline puts("") #define v(T) vector<T> #define vv(T) v(v(T)) using namespace std; typedef long long int ll; typedef unsigned uint; typedef unsigned long long ull; typedef pair<int,int> P; typedef tuple<int,int,int> T; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<P> vp; typedef vector<T> vt; int getInt(){int x;scanf("%d",&x);return x;} template<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;} template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);} template<typename T>ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;} template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;} template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;} template<typename T>ll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("-1"); return;} #define yn {puts("Yes");}else{puts("No");} const int MX = 200005; // Mod int const int mod = 1000000007; // const int mod = 998244353; struct mint { ll x; mint():x(0){} mint(ll x):x((x%mod+mod)%mod){} // mint(ll x):x(x){} mint& fix() { x = (x%mod+mod)%mod; return *this;} mint operator-() const { return mint(0) - *this;} mint operator~() const { return mint(1) / *this;} mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;} mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;} mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;} mint& operator/=(const mint& a){ (x*=a.pow(mod-2).x)%=mod; return *this;} mint operator+(const mint& a)const{ return mint(*this) += a;} mint operator-(const mint& a)const{ return mint(*this) -= a;} mint operator*(const mint& a)const{ return mint(*this) *= a;} mint operator/(const mint& a)const{ return mint(*this) /= a;} mint pow(ll t) const { if(!t) return 1; mint res = pow(t/2); res *= res; return (t&1)?res*x:res; } bool operator<(const mint& a)const{ return x < a.x;} bool operator==(const mint& a)const{ return x == a.x;} }; mint ex(mint x, ll t) { return x.pow(t);} istream& operator>>(istream&i,mint&a){i>>a.x;return i;} ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;} typedef vector<mint> vm; struct comb { vm f, g; comb(){} comb(int mx):f(mx+1),g(mx+1) { f[0] = 1; rrep(i,mx) f[i] = f[i-1]*i; g[mx] = f[mx].pow(mod-2); for(int i=mx;i>0;i--) g[i-1] = g[i]*i; } mint operator()(int a, int b) { if (a < b) return 0; return f[a]*g[b]*g[a-b]; } }; // struct Solver { void solve() { int n; scanf("%d",&n); vi a(n); cin>>a; vector<map<int,mint>> dp(n); vm d(n+1); d[0] = 1; rep(i,n) { for (auto p : dp[i]) { int ni = i+p.fi; if (ni < n) dp[ni][p.fi] += p.se; d[i] += p.se; } if (i+a[i] < n) dp[i+a[i]][a[i]] += d[i]; if (a[i] != 1) d[i+1] += d[i]; } cout<<d[n-1]<<endl; } }; int main() { int ts = 1; // scanf("%d",&ts); rrep(ti,ts) { Solver solver; solver.solve(); } return 0; }