Submission #138965

#	Time	Username	Problem	Language	Result	Execution time	Memory
138965		meatrow	Calvinball championship (CEOI15_teams)	C++17	20 / 100	225 ms	65540 KiB

teams

//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const int N = 1e4 + 5;
ll mod = 1e9 + 7;

ll dp[N][N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int level = 1;
    for (int i = 1; i < n; i++) {
        for (int j = 1; j <= i + 1; j++) {
            dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j] * j) % mod;
        }
        for (int j = 1; j <= i; j++) {
            dp[i - 1][j] = 0;
        }
        dp[i - 1][level] = 1;
        for (int j = 1; j <= i + 1; j++) {
            (dp[i][j] += dp[i - 1][j] * min(j, a[i] - 1)) %= mod;
        }
        level = max(level, a[i]);
    }
    int ans = 1;
    for (int i = 1; i <= n; i++) {
        (ans += dp[n - 1][i]) %= mod;
    }
    cout << ans;
    return 0;
}

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