This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
long long dp[2][10001][2];
int mod = 1000007;
int n;cin>>n;
int arr[n];
for(int i = 0;i<n;i++){
cin>>arr[i];
}
for(int i = n;i>=0;i--){
for(int e = 0;e<2;e++){
for(int j = 0;j<=i;j++){
if(i==n){
dp[i&1][j][e] = 1;
continue;
}
if(e||arr[i]>j){
dp[i&1][j][e] = (dp[!(i&1)][j+1][e|(arr[i]<(j+1))]+dp[!(i&1)][j][1]*j)%mod;
}else{
dp[i&1][j][e] = (dp[!(i&1)][j][e]+dp[!(i&1)][j][1]*(arr[i]-1))%mod;
}
}
}
}
cout<<dp[0][0][0]<<"\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |