# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107821 | luciocf | Calvinball championship (CEOI15_teams) | C++14 | 597 ms | 576 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[2][maxn], mx[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]);
mx[i] = max(mx[i-1], a[i]);
}
for (int i = 1; i <= n; i++) dp[0][i] = 1;
int ans = 1;
for (int i = n-1; i >= 1; i--)
{
int cur = (n-i)%2, prev = (n-i-1)%2;
for (int j = 1; j <= n; j++)
{
dp[cur][j] = 0;
add(dp[cur][j], (1ll*j*dp[prev][j])%mod);
add(dp[cur][j], dp[prev][j+1]);
}
for (int j = a[i]-1; j >= 1; j--)
add(ans, dp[cur][max(mx[i-1], j)]);
}
add(ans, a[n]-1);
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... |