oj.uz

Submission #333264

# Submission time Handle Problem Language Result Execution time Memory
333264 2020-12-05T05:35:39 Z caoash Calvinball championship (CEOI15_teams) C++17
100 / 100
 994 ms 748 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")

#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 10005;
const int MOD = (int) (1e6 + 7);
const ll INF = (ll) 1e18;

ll dp[2][MX];

int main(){
#ifdef mikey 
    freopen("a.in", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    ll ans = 0;
    vl a(n);
    vl pref(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        pref[i] = a[i];
        if (i) pref[i] = max(pref[i], pref[i - 1]);
    }
    for (int i = 1; i <= n; i++) dp[0][i] = 1;
    for (int i = 0; i < n; i++) {
        if (i) {
            for (int j = 1; j < n; j++) {
                dp[i & 1][j] = (dp[(i & 1) ^ 1][j] * j) % MOD;
                dp[i & 1][j] += dp[(i & 1) ^ 1][j + 1];
                while (dp[i & 1][j] > MOD) dp[i & 1][j] -= MOD;
            }
        }
        int pos = n - (i + 1);
        ans = (ans + (ll) (a[pos] - 1) * dp[i & 1][(pos == 0 ? 0 : pref[pos - 1])]) % MOD;
    }
    cout << (ans + 1) % MOD << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 492 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 364 KB Output is correct
2 Correct 12 ms 364 KB Output is correct
3 Correct 10 ms 364 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 968 ms 620 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 492 KB Output is correct
2 Correct 259 ms 564 KB Output is correct
3 Correct 244 ms 492 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 984 ms 748 KB Output is correct
2 Correct 994 ms 748 KB Output is correct
3 Correct 974 ms 748 KB Output is correct