# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44746 | RayaBurong25_1 | Calvinball championship (CEOI15_teams) | C++17 | 311 ms | 32324 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 <stdio.h>
#define MOD 1000000007LL
int n;
int a[10005];
long long dp[1005][2005];
long long max(long long a, long long b)
{
return (a > b)?a:b;
}
int main()
{
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i <= n; i++)
{
for (j = 1; j <= 2*n; j++)
{
if (i == 0)
dp[i][j] = 1LL;
else if (j + 1 <= 2*n)
dp[i][j] = (1LL*j*dp[i - 1][j] + dp[i - 1][j + 1])%MOD;
// if (j <= 2*n - i)
// printf("%d ", dp[i][j]);
}
// printf("\n");
}
long long ans = 1;
int mx = 0;
for (i = 0; i < n; i++)
{
for (j = 1; j < a[i]; j++)
ans = (ans + dp[(n - 1) - i][max(mx, j)])%MOD;
mx = max(mx, a[i]);
}
printf("%d", ans);
}
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... |