# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163304 | dantoh000 | Calvinball championship (CEOI15_teams) | C++14 | 232 ms | 596 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;
typedef long long ll;
const int mod = 1000007;
int main(){
int n; scanf("%d",&n);
int a[n];
int k[n];
for (int i = 0; i < n; i++) {
scanf("%d",&a[i]);
if (i) k[i] = max(k[i-1],a[i]);
else k[i] = a[i];
}
ll ct[2][n+1];
ll ans = a[n-1];
for (int i = 1; i <= n; i++){
ct[0][i] = 1;
}
for (int j = 1; j < n; j++){
ct[j%2][1] = ct[1-j%2][1];
for (int i = 2; i < n; i++){
ct[j%2][i] = (i-1)*ct[1-j%2][i]+ct[1-j%2][i+1];
ct[j%2][i] %= mod;
}
//printf("adding %d %d\n",a[n-j-1]-1,ct[j%2][k[n-j-1]]);
ans += (a[n-j-1]-1)*ct[j%2][k[n-j-1]];
ans %= mod;
}
printf("%d",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... |