Submission #1004646

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004646		Valaki2	Calvinball championship (CEOI15_teams)	C++14	100 / 100	277 ms	700 KiB

teams

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

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int mod = 1e6 + 7;

void solve() {
    int n;
    cin >> n;
    vector<int> v(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    vector<int> prefmax(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        prefmax[i] = max(prefmax[i - 1], v[i]);
    }
    vector<int> dp(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        dp[i] = 1;
    }
    int ans = 0;
    for(int i = n; i >= 1; i--) {
        for(int j = 1; j <= v[i] - 1; j++) {
            ans += dp[max(j, prefmax[i  -1])];
            ans %= mod;
        }
        for(int j = 1; j <= i - 1; j++) {
            dp[j] = dp[j] * j + dp[j + 1];
            dp[j] %= mod;
        }
    }
    ans++;
    ans %= mod;
    cout << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10