# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95860 | Kastanda | Calvinball championship (CEOI15_teams) | C++11 | 237 ms | 568 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 = 10004, Mod = 1000007;
int n, Mx, tot, A[N], C[N], dp[2][N];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]), C[A[i]] ++, Mx = max(Mx, A[i]);
tot = 1;
for (int i = 0; i < N; i++)
dp[0][i] = 1;
for (int i = 1; i <= n; i++)
{
int w = i & 1;
for (int j = 0; j < N; j++)
dp[w][j] = (dp[!w][j + 1] + 1LL * dp[!w][j] * j) % Mod;
C[A[n - i + 1]] --;
if (!C[A[n - i + 1]])
Mx --;
for (int j = 1; j < A[n - i + 1]; j++)
{
tot = (tot + dp[!w][Mx]);
if (tot >= Mod)
tot -= Mod;
}
}
return !printf("%d\n", tot);
}
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... |