# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244482 | dantoh000 | Calvinball championship (CEOI15_teams) | C++14 | 206 ms | 760 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 mod = 1000007;
typedef long long ll;
int n;
int a[10005];
ll dp[2][10005];
int mx[10005];
ll ans = 0;
int main(){
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;
}
for (int i = 1; i < n; i++){
for (int j = 1; j <= n; j++){
dp[i&1][j] = j*dp[1-i&1][j] + dp[1-i&1][j+1];
dp[i&1][j] %= mod;
}
ans += (a[n-i]-1)*dp[i&1][mx[n-i-1]];
ans %= mod;
}
ans = (ans+a[n])%mod;
printf("%lld",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... |