Submission #110615

#	Time	Username	Problem	Language	Result	Execution time	Memory
110615		someone_aa	Calvinball championship (CEOI15_teams)	C++17	20 / 100	39 ms	9952 KiB

teams

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 1100;
const ll mod = 1000007;
int dp[maxn][maxn];
int a[maxn], n;

bool important[maxn];

int main() {
    cin>>n;

    int maxv = 0;
    for(int i=1;i<=n;i++) {
        cin>>a[i];

        if(a[i] > maxv) {
            maxv = a[i];
            important[i] = true;
        }
    }

    dp[1][1] = 1;
    for(int i=2;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            dp[i][j] = dp[i-1][j-1] + 1LL * j * dp[i-1][j];
            dp[i][j] %= mod;
        }
    }

    int j = maxv;
    int result = 0;

    for(int i=0;i<maxv;i++) {
        result += dp[n][i];
        result %= mod;
    }

    for(int i=n;i>=1;i--) {
        if(important[i]) {
            // don't add anything, go to state (i-1, a[i]-1)
            j = a[i] - 1;
        }
        else {
            // add extra, go to state (i-1, j)
            result += dp[i-1][j-1]; result %= mod;
            result += (a[i]-1)*(dp[i-1][j]); result %= mod;
        }
    }

    result++;
    result%=mod;
    cout<<result;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 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