# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24685 | Bruteforceman | Calvinball championship (CEOI15_teams) | C++11 | 23 ms | 9908 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;
long long dp[1005][1005];
const int mod = 1000007;
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
for(int i = 0; i <= n; i++) {
dp[0][i] = 1;
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
dp[i][j] = dp[i - 1][j] * j + dp[i - 1][j + 1];
dp[i][j] %= mod;
}
}
int *a;
a = new int [n + 5];
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int maxn = 1;
int ans = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j < a[i]; j++) {
ans += dp[n - i][max(maxn, j)];
ans %= mod;
}
maxn = max(maxn, a[i]);
}
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... |