# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93734 | abood101 | Calvinball championship (CEOI15_teams) | C++14 | 1072 ms | 504 KiB |
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;
typedef pair<int,int > pp;
typedef long long ll;
int const N=1e4+2,oo=1e9,M=1e6;
ll const OO=1e18;
double const eps=1e-6,PI=acos(-1);
int mod=M+7;
int n,aa[N],dp[2][N][2];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&aa[i]);
int f=0;
for(int i=1;i<=n;i++)dp[f][i][0]=dp[f][i][1]=1;
for(int i=n-2;i>-1;i--){
f=1-f;
for(int j=1;j<=i+1;j++){
dp[f][j][1]=(dp[!f][j][1]*1LL*j+dp[!f][j+1][1])%mod;
if(aa[i+1]>j)dp[f][j][0]=(dp[!f][j][1]*1LL*j+(aa[i+1]==j+1)*dp[!f][aa[i+1]][0])%mod;
else dp[f][j][0]=(dp[!f][j][1]*1LL*(aa[i+1]-1)+dp[!f][j][0])%mod;
}
}
printf("%d\n",dp[f][1][0]);
return 0;
}
Compilation message (stderr)
# | 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... |