Submission #99674

#	Time	Username	Problem	Language	Result	Execution time	Memory
99674		HardNut	Calvinball championship (CEOI15_teams)	C++17	10 / 100	15 ms	4224 KiB

teams

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

using namespace std;

typedef long long ll;

const int N = 2e5 + 5;
const ll INF = 1e18 + 5;
const ll mod = 1e6 + 7;
const int tx[] = {1, -1, 0, 0}, ty[] = {0, 0, 1, -1};
const ll bs = 31;

int n, a[N], b[N], cnt, res[N];
int dp[1005][1005];

void rec(int cur = 1, int len = 1) {
    if (len == n) {
        cnt++;
        return;
        for (int i = 1; i <= n; i++) {
            if (a[i] != b[i])
                return;
        }
        cout << cnt % mod;
        exit(0);
    }
    for (int i = 1; i <= cur + 1; i++) {
        b[len + 1] = i;
        rec(max(cur, i), len + 1);
        b[len + 1] = 0;
    }
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        dp[n][i] = 1;
    }
    for (int i = n - 1; i >= 1; i--) {
        for (int j = 1; j <= n; j++) {
            dp[i][j] = ((dp[i + 1][j] * j) % mod + dp[i][j]) % mod;
            dp[i][j] = (dp[i][j] + dp[i + 1][j + 1]) % mod;
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j < a[i]; j++) {
            ans = (ans + dp[i][j]) % mod;
        }
    }
    cout << ans + 1;
    return 0;
}

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