# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72883 | arman_ferdous | Calvinball championship (CEOI15_teams) | C++17 | 544 ms | 1288 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 N = 1e4+10;
const int mod = 1e6+7;
int n, arr[N], pre[N];
long long dp[2][N];
int main() {
scanf("%d", &n);
pre[0] = -1;
for(int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
pre[i] = max(pre[i-1], arr[i]);
}
for(int i = 0; i < N; i++)
dp[0][i] = 1;
int ro = 1, ans = 0;
for(int i = n-1; i > 0; i--) {
for(int val = 1; val <= n; val++)
dp[ro][val] = ( val * dp[ro^1][val] + dp[ro^1][val+1] ) % mod;
for(int val = 1; val < arr[i+1]; val++)
ans = (ans + dp[ro^1][max(pre[i],val)]) % mod;
ro ^= 1;
} printf("%d\n", ans + 1);
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... |