Submission #900217

#TimeUsernameProblemLanguageResultExecution timeMemory
900217raphaelpCalvinball championship (CEOI15_teams)C++14
70 / 100
34 ms65536 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long N;
    cin >> N;
    vector<long long> Tab(N);
    for (long long i = 0; i < N; i++)
    {
        cin >> Tab[i];
    }
    vector<vector<long long>> dp(N, vector<long long>(N, 1));
    for (long long i = N - 2; i >= 0; i--)
    {
        for (long long j = 0; j <= i; j++)
        {
            dp[i][j] = (dp[i + 1][j + 1] + (dp[i + 1][j] * (j + 1))) % 1000007;
        }
    }
    long long tot = 0;
    long long maxx = 0;
    for (long long i = 0; i < N; i++)
    {
        tot += (Tab[i] - 1) * dp[i][maxx - 1];
        tot = tot % 1000007;
        maxx = max(maxx, Tab[i]);
    }
    cout << (tot + 1) % 1000007;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...