#include <iostream>
using namespace std;
const int stala=1e4+10;
const long long mod=1000007;
long long dp[stala][2];
long long dp2[stala][2];
int tab[stala];
void prep(int ile)
{
for(int i=1;i<=ile;i++){
dp[i][1]=dp[i][0];
dp2[i][1]=dp2[i][0];
dp[i][0]=0;
dp[i][1]=0;
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ile;
cin>>ile;
for(int i=1;i<=ile;i++){
cin>>tab[i];
}
long long wyn=0;
for(int i=ile;i>=1;i--){
if(i==ile){
for(int j=1;j<=ile;j++){
dp[j][0]=i;
dp2[j][0]=1;
}
}
else{
for(int j=1;j<=i;j++){
dp[j][0]=(long long)j*(dp[j][1]+dp2[j+1][1]);
dp[j][1]=dp[j][1]+dp2[j+1][1];
dp[j][0]%=mod;
dp[j][1]%=mod;
}
}
wyn+=dp[tab[i]-1][0];
wyn%=mod;
prep(ile);
}
cout<<wyn;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
221 ms |
840 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
54 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
218 ms |
824 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |