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