제출 #1122086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122086		HasanV11010238	Calvinball championship (CEOI15_teams)	C++17	70 / 100	56 ms	65536 KiB

teams

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long long
#define mod 1000007
int main(){
    int n;
    cin>>n;
    vector<ll> v(n + 1, 0);
    for (int i = 1; i <= n; i++){
        cin>>v[i];
    }
    vector<vector<ll>> dp(n + 2, vector<ll>(n + 1, 0)), prdp(n + 1, vector<ll>(n + 1, 0));
    for (int i = 0; i <= n; i++){
        dp[n + 1][i] = 1;
    }
    for (int i = n; i >= 1; i--){
        for (int j = 1; j <= i; j++){
            dp[i][j] = dp[i + 1][j] * j;
            dp[i][j] += dp[i + 1][j + 1];
            dp[i][j] %= mod;
        }
    }
    ll ans = 0, la = 0;
    for (int i = 1; i <= n; i++){
        ll su = v[i] - 1;
        for (int j = 1; j <= su; j++){
            ans += dp[i + 1][max(la, (ll)j)];
            ans %= mod;
        }
        ans %= mod;
        la = max(v[i], la);
    }
    cout<<(ans + 1) % mod<<"\n";
}

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