#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;
ll 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;
for (int i=1;i<=rem;i++){
ans+=solve(digit+1,rem-i)*expo(digit,i-1);
ans%=mod;
}
ans+=expo(digit,rem);
ans%=mod;
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 |
4 ms |
8140 KB |
Output is correct |
2 |
Correct |
3 ms |
8140 KB |
Output is correct |
3 |
Correct |
4 ms |
8140 KB |
Output is correct |
4 |
Correct |
4 ms |
8140 KB |
Output is correct |
5 |
Correct |
3 ms |
8140 KB |
Output is correct |
6 |
Correct |
4 ms |
8140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8140 KB |
Output is correct |
2 |
Correct |
3 ms |
8140 KB |
Output is correct |
3 |
Correct |
4 ms |
8140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8140 KB |
Output is correct |
2 |
Correct |
4 ms |
8140 KB |
Output is correct |
3 |
Correct |
4 ms |
8140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
8140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
8140 KB |
Output is correct |
2 |
Correct |
6 ms |
8140 KB |
Output is correct |
3 |
Correct |
5 ms |
8140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
482 ms |
8244 KB |
Output is correct |
2 |
Correct |
474 ms |
8244 KB |
Output is correct |
3 |
Correct |
473 ms |
8240 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1089 ms |
8268 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1073 ms |
8268 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1071 ms |
8268 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1036 ms |
8268 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |