# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107820 | luciocf | Calvinball championship (CEOI15_teams) | C++14 | 200 ms | 66560 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;
const int maxn = 1e4+10;
const int mod = 1e6+7;
int a[maxn];
int dp[maxn][maxn];
void add(int &a, int b)
{
a = (a+b)%mod;
}
int main(void)
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) dp[0][i] = 1;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
add(dp[i][j], (1ll*j*dp[i-1][j])%mod);
add(dp[i][j], dp[i-1][j+1]);
}
}
int ans = 1, mx = 1;
for (int i = 1; i <= n; i++)
{
for (int j = a[i]-1; j >= 1; j--)
add(ans, dp[n-i][max(mx, j)]);
mx = max(a[i], mx);
}
printf("%d\n", 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... |