# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34358 | mohammad_kilani | Calvinball championship (CEOI15_teams) | C++14 | 639 ms | 2172 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;
#define mod 1000007
#define oo 2000000000
const int N = 10010;
int arr[N],dp[2][N],mxl[N],n;
int main() {
//freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&arr[i]);
for(int i=0;i<=n+2;i++) dp[(n & 1)][i] = 1;
mxl[0] = 0;
for(int i=1;i<n;i++) mxl[i] = max(mxl[i-1],arr[i-1]);
int ans = 1 , mx = 0 ;
for(int i=n-1;i>=0;i--){
int mx = mxl[i];
for(int j=1;j<arr[i];j++){
mx = max(mx,j);
ans+= dp[(i+1) & 1][mx];
if(ans >= mod) ans-=mod;
}
for(int j=1;j<=max(mxl[i],arr[i])+1;j++){
dp[i&1][j] = (long long)dp[(i+1)&1][j] * j % mod;
dp[i&1][j] += dp[(i+1)&1][j+1];
if(dp[i&1][j] >= mod) dp[i&1][j] -=mod;
}
}
printf("%d\n",ans);
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... |