#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e6+7;
const ll maxn=1005;
int dp[maxn][maxn];
ll expo(ll n, ll x){
if (x==0) return 1;
if (x==1) return n;
ll temp=expo(n,x/2);
if (x&1){
return (temp*(temp*n)%mod)%mod;
}
return (temp*temp)%mod;
}
ll solve(ll digit, ll rem){
if (rem==0) return 1;
if (dp[digit][rem]!=-1) return dp[digit][rem];
ll ans=0;
ans=(solve(digit,rem-1)*digit)%mod+solve(digit+1,rem-1);
return dp[digit][rem]=ans%mod;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,ele,ans=0;
cin>>n;
ll ele2=0,temp;
memset(dp,-1,sizeof(dp));
for (int i=1;i<=n;i++){
cin>>ele;
for (int j=1;j<ele;j++){
temp=max<ll>(j,ele2);
ans+=solve(temp,n-i);
ans%=mod;
}
ele2=max(ele,ele2);
}
cout<<(ans+1)%mod;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4168 KB |
Output is correct |
2 |
Correct |
2 ms |
4164 KB |
Output is correct |
3 |
Correct |
3 ms |
4160 KB |
Output is correct |
4 |
Correct |
2 ms |
4172 KB |
Output is correct |
5 |
Correct |
2 ms |
4160 KB |
Output is correct |
6 |
Correct |
2 ms |
4160 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4164 KB |
Output is correct |
2 |
Correct |
2 ms |
4172 KB |
Output is correct |
3 |
Correct |
2 ms |
4172 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4172 KB |
Output is correct |
2 |
Correct |
2 ms |
4140 KB |
Output is correct |
3 |
Correct |
2 ms |
4164 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4160 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
2 ms |
4172 KB |
Output is correct |
3 |
Correct |
2 ms |
4172 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4172 KB |
Output is correct |
2 |
Correct |
3 ms |
4280 KB |
Output is correct |
3 |
Correct |
4 ms |
4164 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4300 KB |
Output is correct |
2 |
Correct |
6 ms |
4308 KB |
Output is correct |
3 |
Correct |
9 ms |
4308 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
16 ms |
9180 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
11 ms |
4476 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
4680 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |